Pages that link to "Item:Q286768"
From MaRDI portal
The following pages link to The structure of graphs with circular flow number 5 or more, and the complexity of their recognition problem (Q286768):
Displaying 6 items.
- Measures of edge-uncolorability of cubic graphs (Q668025) (← links)
- Treelike snarks (Q727053) (← links)
- Computational results and new bounds for the circular flow number of snarks (Q785826) (← links)
- Cubic graphs that cannot be covered with four perfect matchings (Q2040017) (← links)
- (Q4990130) (← links)
- A unified approach to construct snarks with circular flow number 5 (Q6055928) (← links)