The following pages link to Generation and properties of snarks (Q463288):
Displayed 26 items.
- On snarks that are far from being 3-edge colorable (Q281587) (← links)
- A faster test for 4-flow-criticality in snarks (Q324779) (← links)
- Construction of permutation snarks (Q345069) (← links)
- On even cycle decompositions of 4-regular line graphs (Q383685) (← links)
- On stable cycles and cycle double covers of graphs with large circumference (Q442360) (← links)
- How many conjectures can you stand? A survey (Q659764) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- Treelike snarks (Q727053) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Weak oddness as an approximation of oddness and resistance in cubic graphs (Q1752608) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- Small snarks with large oddness (Q2260625) (← links)
- Snarks from a Kászonyi perspective: a survey (Q2352260) (← links)
- A counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2354717) (← links)
- On type 2 snarks and dot products (Q2413173) (← links)
- Odd 2-factored snarks (Q2441652) (← links)
- Berge-Fulkerson conjecture on certain snarks (Q2516508) (← links)
- On Cubic Bridgeless Graphs Whose Edge-Set Cannot be Covered by Four Perfect Matchings (Q2922223) (← links)
- Cycle Double Covers in Cubic Graphs having Special Structures (Q2922224) (← links)
- Strong Circuit Double Cover of Some Cubic Graphs (Q2940992) (← links)
- Cubic Graphs with Large Circumference Deficit (Q3188672) (← links)
- On Perfect Matching Coverings and Even Subgraph Coverings (Q3466356) (← links)
- Improved bounds for hypohamiltonian graphs (Q4604513) (← links)
- 1‐Factor and Cycle Covers of Cubic Graphs (Q4982281) (← links)
- Snarks with large oddness and small number of vertices (Q5419943) (← links)
- Circuit Double Covers of Graphs (Q5506787) (← links)