Fano colourings of cubic graphs and the Fulkerson conjecture
From MaRDI portal
Publication:817779
DOI10.1016/J.TCS.2005.09.034zbMATH Open1082.05040OpenAlexW2057400553WikidataQ123179556 ScholiaQ123179556MaRDI QIDQ817779FDOQ817779
Authors: E. Máčajová, Martin Škoviera 
Publication date: 20 March 2006
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2005.09.034
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Decompositions and reductions of snarks
- Classification and characterizations of snarks
- Title not available (Why is that?)
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Blocking and anti-blocking pairs of polyhedra
- Fulkerson's conjecture and circuit covers
- Title not available (Why is that?)
- Snarks and reducibility
- Decomposition of snarks
- Title not available (Why is that?)
- Colouring of cubic graphs by Steiner triple systems
- A generalization of Tait coloring cubic graphs
- A small basis for four‐line configurations in steiner triple systems. Dedicated to the memory of gemma holly griggs
- Title not available (Why is that?)
Cited In (27)
- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Covering a cubic graph with perfect matchings
- Sparsely intersecting perfect matchings in cubic graphs
- Title not available (Why is that?)
- Perfect matchings with restricted intersection in cubic graphs
- Fractional colorings of cubic graphs with large girth
- Coloring cubic graphs by point-intransitive Steiner triple systems
- Signed cycle double covers
- On the 3-colouring vertex Folkman number \(F(2,2,4)\)
- Colourings of \((r,k)\)-fans
- \(H\)-colorings for 4-regular graphs
- Short cycle covers of graphs and nowhere-zero flows
- Unique Fulkerson coloring of Petersen minor-free cubic graphs
- Cubic graphs that cannot be covered with four perfect matchings
- Variations on the Petersen colouring conjecture
- Projective, affine, and abelian colorings of cubic graphs
- On a conjecture of Fan and Raspaud
- An equivalent formulation of the Fan-Raspaud conjecture and related problems
- New approach to Petersen coloring
- Non-intersecting perfect matchings in cubic graphs (Extended abstract)
- Cores, joins and the Fano-flow conjectures
- Kempe equivalence of colourings of cubic graphs
- Edge-Colourings of Cubic Graphs and Universal Steiner Triple Systems
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching
- Abelian Colourings of Cubic Graphs
- Wilson-Schreiber colourings of cubic graphs
- Cubic graphs with colouring defect 3
This page was built for publication: Fano colourings of cubic graphs and the Fulkerson conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q817779)
