Fano colourings of cubic graphs and the Fulkerson conjecture
From MaRDI portal
(Redirected from Publication:817779)
Recommendations
Cites work
- scientific article; zbMATH DE number 3645098 (Why is no real title available?)
- scientific article; zbMATH DE number 4075098 (Why is no real title available?)
- scientific article; zbMATH DE number 1284204 (Why is no real title available?)
- scientific article; zbMATH DE number 908564 (Why is no real title available?)
- scientific article; zbMATH DE number 1432797 (Why is no real title available?)
- scientific article; zbMATH DE number 3390835 (Why is no real title available?)
- 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
- Blocking and anti-blocking pairs of polyhedra
- Classification and characterizations of snarks
- Colouring of cubic graphs by Steiner triple systems
- Decomposition of snarks
- Decompositions and reductions of snarks
- Fulkerson's conjecture and circuit covers
- Infinite Families of Nontrivial Trivalent Graphs Which are Not Tait Colorable
- Snarks and reducibility
Cited in
(27)- Three-matching intersection conjecture for perfect matching polytopes of small dimensions
- Covering a cubic graph with perfect matchings
- Cubic graphs with colouring defect 3
- Sparsely intersecting perfect matchings in cubic graphs
- scientific article; zbMATH DE number 3916298 (Why is no real title available?)
- Perfect matchings with restricted intersection in cubic graphs
- Fractional colorings of cubic graphs with large girth
- Signed cycle double covers
- Coloring cubic graphs by point-intransitive Steiner triple systems
- 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
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)