The following pages link to Generation and properties of snarks (Q463288):
Displaying 50 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)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Cycle double covers of infinite planar graphs (Q726631) (← links)
- Treelike snarks (Q727053) (← links)
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- Integer sequence discovery from small graphs (Q908306) (← links)
- Snarks with special spanning trees (Q1733867) (← links)
- On \(S\)-packing edge-colorings of cubic graphs (Q1735677) (← 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)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- Partially normal 5-edge-colorings of cubic graphs (Q2033935) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- House of graphs 2.0: a database of interesting graphs and more (Q2104929) (← links)
- Morphology of small snarks (Q2112562) (← links)
- Snarks with resistance \(n\) and flow resistance \(2n\) (Q2121784) (← links)
- Switching 3-edge-colorings of cubic graphs (Q2144509) (← links)
- On 4-connected 4-regular graphs without even cycle decompositions (Q2144604) (← links)
- On even cycle decompositions of line graphs of cubic graphs (Q2182216) (← links)
- Superposition of snarks revisited (Q2225424) (← links)
- Critical and flow-critical snarks coincide (Q2227110) (← links)
- Rotation snark, Berge-Fulkerson conjecture and Catlin's 4-flow reduction (Q2245053) (← links)
- Small snarks with large oddness (Q2260625) (← links)
- The smallest nontrivial snarks of oddness 4 (Q2306590) (← links)
- Cycle double covers and non-separating cycles (Q2323102) (← 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)
- Structural and computational results on platypus graphs (Q2656702) (← links)
- Strongly even cycle decomposable 4-regular line graphs (Q2662802) (← 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)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- A unified approach to construct snarks with circular flow number 5 (Q6055928) (← links)
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs (Q6056765) (← links)
- On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs (Q6093144) (← links)
- Square Coloring Planar Graphs with Automatic Discharging (Q6141869) (← links)
- Deciding whether four perfect matchings can cover the edges of a snark is NP-complete (Q6150678) (← links)
