Snarks without small cycles
From MaRDI portal
Recommendations
Cited in
(59)- Cubic graphs with colouring defect 3
- Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6
- Generation of cubic graphs and snarks with large girth
- A cyclically 6-edge-connected snark of order 118
- The Fan-Raspaud conjecture: a randomized algorithmic approach and application to the pair assignment problem in cubic networks
- Cubic Cayley graphs and snarks
- On total coloring and equitable total coloring of infinite snark families
- Flow resistance to resistance ratios in cubic graphs
- Circular chromatic index of type 1 Blanuša snarks
- Circuit double covers of graphs
- Superposition of snarks revisited
- 1-factor and cycle covers of cubic graphs
- Deciding whether four perfect matchings can cover the edges of a snark is NP-complete
- On snarks that are far from being 3-edge colorable
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces
- Polyhedral embeddings of snarks in orientable surfaces
- Generation and properties of snarks
- The circular chromatic index of graphs of high girth
- Small snarks with large oddness
- Some results on the structure of multipoles in the study of snarks
- Circuits of length 5 in 2-factors of cubic graphs
- scientific article; zbMATH DE number 3884206 (Why is no real title available?)
- Odd 2-factored snarks
- Fulkerson's conjecture and Loupekine snarks
- Irreducible snarks of given order and cyclic connectivity
- On stable cycles and cycle double covers of graphs with large circumference
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction
- Cubic graphs with large circumference deficit
- Circular edge-colorings of cubic graphs with girth six
- Normal 5-edge-coloring of some snarks superpositioned by flower snarks
- A revival of the girth conjecture
- Berge-Fulkerson coloring for some families of superposition snarks
- Classification and characterizations of snarks
- Uniquely edge-3-colorable graphs and snarks
- Infinite classes of dihedral snarks
- Cycle double covers and spanning minors. I
- Forbidden triples containing a complete graph and a complete bipartite graph of small order
- Measures of edge-uncolorability of cubic graphs
- Measurements of edge-uncolorability
- Coverings of cubic graphs and 3-edge colorability
- Girth, oddness, and colouring defect of snarks
- Between Proper and Strong Edge-Colorings of Subcubic Graphs
- Superposition and constructions of graphs without nowhere-zero k-flows
- Smallest counterexample to the 5-flow conjecture has girth at least eleven
- Reducible configurations for the cycle double cover conjecture
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks.
- Induced embeddings into Hamming graphs
- Circular edge-colorings of cubic graphs with girth six
- Between proper and strong edge‐colorings of subcubic graphs
- Infinitely many hypohamiltonian cubic graphs of girth 7
- On the number of colorings of a snark minus an edge
- Forbidden triples generating a finite set of 3-connected graphs
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\)
- Treelike snarks
- Snarks from a Kászonyi perspective: a survey
- Roman domination and independent Roman domination on graphs with maximum degree three
- On the maximum number of edges in chordal graphs of bounded degree and matching number
This page was built for publication: Snarks without small cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1924136)
