The following pages link to Network-Colourings (Q5786873):
Displaying 14 items.
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Color-character of uncolorable cubic graphs (Q1036808) (← links)
- Construction of class two graphs with maximum vertex degree three (Q1147159) (← links)
- Colouring problems (Q1255499) (← links)
- Classification and characterizations of snarks (Q1584327) (← links)
- Morphology of small snarks (Q2112562) (← links)
- Superposition of snarks revisited (Q2225424) (← links)
- Even cycles and even 2-factors in the line graph of a simple graph (Q2411500) (← links)
- The hunting of a snark with total chromatic number 5 (Q2448882) (← links)
- Irreducible snarks of given order and cyclic connectivity (Q2495514) (← links)
- Graphs with valency k, edge connectivity k, chromatic index k+1 and arbitrary girth (Q2561602) (← links)
- (Q3305178) (← links)
- Smallest snarks with oddness 4 and cyclic connectivity 4 have order 44 (Q5225040) (← links)
- Rotationally symmetric snarks from voltage graphs (Q6197742) (← links)
