The following pages link to Snarks without small cycles (Q1924136):
Displaying 50 items.
- On snarks that are far from being 3-edge colorable (Q281587) (← links)
- Circuits of length 5 in 2-factors of cubic graphs (Q432713) (← links)
- On stable cycles and cycle double covers of graphs with large circumference (Q442360) (← links)
- Generation and properties of snarks (Q463288) (← links)
- AVD-total-chromatic number of some families of graphs with \(\Delta(G) = 3\) (Q516897) (← links)
- Edge-colourings of cubic graphs admitting a solvable vertex-transitive group of automorphisms (Q598472) (← links)
- Infinitely many hypohamiltonian cubic graphs of girth 7 (Q659692) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Treelike snarks (Q727053) (← links)
- Forbidden triples containing a complete graph and a complete bipartite graph of small order (Q742629) (← links)
- Infinite classes of dihedral snarks (Q839818) (← links)
- The circular chromatic index of graphs of high girth (Q858677) (← links)
- Smallest counterexample to the 5-flow conjecture has girth at least eleven (Q974466) (← links)
- A cyclically 6-edge-connected snark of order 118 (Q1356433) (← links)
- Reduction of the 5-flow conjecture to cyclically 6-edge-connected snarks. (Q1425113) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- Uniquely edge-3-colorable graphs and snarks (Q1586579) (← links)
- Superposition and constructions of graphs without nowhere-zero \(k\)-flows (Q1612758) (← links)
- Measurements of edge-uncolorability (Q1827679) (← links)
- A revival of the girth conjecture (Q1880788) (← links)
- Reducible configurations for the cycle double cover conjecture (Q1962036) (← links)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- Girth, oddness, and colouring defect of snarks (Q2166293) (← links)
- Coverings of cubic graphs and 3-edge colorability (Q2214325) (← links)
- Superposition of snarks revisited (Q2225424) (← links)
- Some results on the structure of multipoles in the study of snarks (Q2260618) (← links)
- Small snarks with large oddness (Q2260625) (← links)
- Snarks from a Kászonyi perspective: a survey (Q2352260) (← links)
- Odd 2-factored snarks (Q2441652) (← links)
- Fulkerson's conjecture and Loupekine snarks (Q2449149) (← links)
- Cycle double covers and spanning minors. I (Q2490249) (← links)
- Irreducible snarks of given order and cyclic connectivity (Q2495514) (← links)
- Forbidden triples generating a finite set of 3-connected graphs (Q2517659) (← links)
- The Fan–Raspaud conjecture: A randomized algorithmic approach and application to the pair assignment problem in cubic networks (Q2934517) (← links)
- Cubic Graphs with Large Circumference Deficit (Q3188672) (← links)
- Hypohamiltonian Snarks with Cyclic Connectivity 5 and 6 (Q3439424) (← links)
- Circular chromatic index of type 1 Blanuša snarks (Q3605142) (← links)
- 3-Regular Non 3-Edge-Colorable Graphs with Polyhedral Embeddings in Orientable Surfaces (Q3611866) (← links)
- Polyhedral embeddings of snarks in orientable surfaces (Q3625534) (← links)
- A survey on snarks and new results: Products, reducibility and a computer search (Q4242970) (← links)
- On generating snarks (Q4254298) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Between Proper and Strong Edge-Colorings of Subcubic Graphs (Q5041205) (← links)
- Induced Embeddings into Hamming Graphs. (Q5111242) (← links)
- Circuit Double Covers of Graphs (Q5506787) (← links)
- 5-Cycle Double Covers, 4-Flows, and Catlin Reduction (Q5883284) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5891228) (← links)
- Circular edge-colorings of cubic graphs with girth six (Q5900963) (← links)
- On the maximum number of edges in chordal graphs of bounded degree and matching number (Q5970781) (← links)
- Between proper and strong edge‐colorings of subcubic graphs (Q6046648) (← links)
