Cycles intersecting edge-cuts of prescribed sizes - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Discrete Mathematics and Theoretical Computer Science Year : 2005

Cycles intersecting edge-cuts of prescribed sizes

Abstract

We prove that every cubic bridgeless graph $G$ contains a $2$-factor which intersects all (minimal) edge-cuts of size $3$ or $4$. This generalizes an earlier result of the authors, namely that such a $2$-factor exists provided that $G$ is planar. As a further extension, we show that every graph contains a cycle (a union of edge-disjoint circuits) that intersects all edge-cuts of size $3$ or $4$. Motivated by this result, we introduce the concept of a coverable set of integers and discuss a number of questions, some of which are related to classical problems of graph theory such as Tutte's $4$-flow conjecture or the Dominating circuit conjecture.
Fichier principal
Vignette du fichier
dmAE0160.pdf (140.01 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-01184454 , version 1 (14-08-2015)

Identifiers

Cite

Tomáš Kaiser, Riste Škrekovski. Cycles intersecting edge-cuts of prescribed sizes. 2005 European Conference on Combinatorics, Graph Theory and Applications (EuroComb '05), 2005, Berlin, Germany. pp.303-308, ⟨10.46298/dmtcs.3465⟩. ⟨hal-01184454⟩

Collections

INSMI TDS-MACS
80 View
756 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More