The following pages link to Factorisation of snarks (Q2380465):
Displaying 15 items.
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- 6-decomposition of snarks (Q1761505) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- Morphology of small snarks (Q2112562) (← links)
- Cyclic connectivity, edge-elimination, and the twisted Isaacs graphs (Q2131857) (← links)
- Superposition of snarks revisited (Q2225424) (← links)
- Critical and flow-critical snarks coincide (Q2227110) (← links)
- From edge-coloring to strong edge-coloring (Q2341055) (← links)
- Odd 2-factored snarks (Q2441652) (← links)
- Decompositions and reductions of snarks (Q4888119) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)
- The hardness of recognising poorly matchable graphs and the hunting of the \(d\)-snark (Q6550846) (← links)
- Fractal networks: topology, dimension, and complexity (Q6554415) (← links)