Pages that link to "Item:Q4622633"
From MaRDI portal
The following pages link to On Sylvester Colorings of Cubic Graphs (Q4622633):
Displaying 4 items.
- Disjoint odd circuits in a bridgeless cubic graph can be quelled by a single perfect matching (Q2692777) (← links)
- A generalization of Tait coloring cubic graphs (Q2706952) (← links)
- S_12 and P_12-colorings of cubic graphs (Q5217082) (← links)
- On the existence of graphs which can colour every regular graph (Q6162043) (← links)