Snarks without small cycles
From MaRDI portal
Publication:1924136
DOI10.1006/jctb.1996.0032zbMath0855.05066OpenAlexW2022795828MaRDI QIDQ1924136
Publication date: 26 January 1997
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1006/jctb.1996.0032
Related Items
Superposition and constructions of graphs without nowhere-zero \(k\)-flows ⋮ 5-Cycle Double Covers, 4-Flows, and Catlin Reduction ⋮ On snarks that are far from being 3-edge colorable ⋮ Between Proper and Strong Edge-Colorings of Subcubic Graphs ⋮ A revival of the girth conjecture ⋮ A cyclically 6-edge-connected snark of order 118 ⋮ Cubic Graphs with Large Circumference Deficit ⋮ The circular chromatic index of graphs of high girth ⋮ Girth, oddness, and colouring defect of snarks ⋮ Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms ⋮ The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks ⋮ Between proper and strong edge‐colorings of subcubic graphs ⋮ Roman domination and independent Roman domination on graphs with maximum degree three ⋮ Cubic graphs with colouring defect 3 ⋮ On total coloring and equitable total coloring of infinite snark families ⋮ Flow resistance to resistance ratios in cubic graphs ⋮ Deciding whether four perfect matchings can cover the edges of a snark is NP-complete ⋮ Circuits of length 5 in 2-factors of cubic graphs ⋮ On stable cycles and cycle double covers of graphs with large circumference ⋮ Odd 2-factored snarks ⋮ Coverings of cubic graphs and 3-edge colorability ⋮ Reducible configurations for the cycle double cover conjecture ⋮ Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. ⋮ Fulkerson's conjecture and Loupekine snarks ⋮ Infinitely many hypohamiltonian cubic graphs of girth 7 ⋮ Superposition of snarks revisited ⋮ Measures of edge-uncolorability of cubic graphs ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) ⋮ Circular edge-colorings of cubic graphs with girth six ⋮ Some results on the structure of multipoles in the study of snarks ⋮ Small snarks with large oddness ⋮ Cycle double covers and spanning minors. I ⋮ Smallest counterexample to the 5-flow conjecture has girth at least eleven ⋮ Irreducible snarks of given order and cyclic connectivity ⋮ Circular chromatic index of type 1 Blanuša snarks ⋮ Treelike snarks ⋮ Berge-Fulkerson coloring for some families of superposition snarks ⋮ 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces ⋮ Forbidden triples generating a finite set of 3-connected graphs ⋮ Forbidden triples containing a complete graph and a complete bipartite graph of small order ⋮ Polyhedral embeddings of snarks in orientable surfaces ⋮ 1‐Factor and Cycle Covers of Cubic Graphs ⋮ Measurements of edge-uncolorability ⋮ Induced Embeddings into Hamming Graphs. ⋮ Classification and characterizations of snarks ⋮ Circuit Double Covers of Graphs ⋮ On the maximum number of edges in chordal graphs of bounded degree and matching number ⋮ Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 ⋮ Snarks from a Kászonyi perspective: a survey
