Short cycle covers of graphs and nowhere-zero flows
From MaRDI portal
Publication:3106270
DOI10.1002/jgt.20563zbMath1234.05138OpenAlexW2002557364MaRDI QIDQ3106270
Edita Máčajová, Xuding Zhu, Michael Tarsi, Andre Raspaud
Publication date: 20 December 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20563
upper boundscircular flowsbridgeless cubic graphFano coloringsFano flowslength of shortest cycle covers
Extremal problems in graph theory (05C35) Paths and cycles (05C38) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Flows in graphs (05C21)
Related Items (7)
Shortest circuit covers of signed graphs ⋮ Circuit Covers of Signed Graphs ⋮ A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs ⋮ Signed cycle double covers ⋮ Circuit decompositions and shortest circuit coverings of hypergraphs ⋮ 1‐Factor and Cycle Covers of Cubic Graphs ⋮ Short Cycle Covers on Cubic Graphs by Choosing a 2-Factor
Cites Work
- Tutte's 3-flow conjecture and short cycle covers
- Shortest coverings of graphs with cycles
- Fano colourings of cubic graphs and the Fulkerson conjecture
- Nowhere-zero 6-flows
- Eine gemeinsame Basis für die Theorie der Eulerschen Graphen und den Satz von Petersen
- Fulkerson's conjecture and circuit covers
- Projective, affine, and abelian colorings of cubic graphs
- A note about shortest cycle covers
- Short Cycle Covers of Graphs with Minimum Degree Three
- Covering Multigraphs by Simple Circuits
- On (k,d)-colorings and fractional nowhere-zero flows
- Blocking and anti-blocking pairs of polyhedra
- Circular chromatic number: A survey
This page was built for publication: Short cycle covers of graphs and nowhere-zero flows
