The following pages link to Odd 2-factored snarks (Q2441652):
Displaying 8 items.
- Construction of permutation snarks (Q345069) (← links)
- Circuits of length 5 in 2-factors of cubic graphs (Q432713) (← links)
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Treelike snarks (Q727053) (← links)
- On the smallest snarks with oddness 4 and connectivity 2 (Q1753089) (← links)
- Berge-Fulkerson coloring for some families of superposition snarks (Q2033883) (← links)
- A construction for a counterexample to the pseudo 2-factor isomorphic graph conjecture (Q2685701) (← links)
- Berge–Fulkerson coloring for C(12)‐linked permutation graphs (Q6056765) (← links)