The following pages link to Generation and properties of snarks (Q463288):
Displaying 15 items.
- Cubic Graphs with No Short Cycle Covers (Q5157388) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- Snarks with large oddness and small number of vertices (Q5419943) (← links)
- Circuit Double Covers of Graphs (Q5506787) (← 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)
- Some snarks are worse than others (Q6181999) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)
- <i>K</i><sub>2</sub>‐Hamiltonian graphs: II (Q6199383) (← links)
- Strongly even cycle decomposable non-planar line graphs (Q6204337) (← links)
- A note on \(\bar{X}\)-coloring and \(\hat{A}\)-coloring 4-regular graphs (Q6542056) (← links)
- Permutation snarks of order \(2 \pmod{8}\) (Q6621242) (← links)
