The following pages link to Two conjectures on edge-colouring (Q1123197):
Displaying 13 items.
- Some criteria for a graph to be class 1 (Q442377) (← links)
- Recent results on the total chromatic number (Q686483) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- The chromatic index of a graph whose core has maximum degree two (Q1197023) (← links)
- How to find overfull subgraphs in graphs with large maximum degree (Q1329811) (← links)
- Vertex-splitting and chromatic index critical graphs (Q1363752) (← links)
- On edge-colouring indifference graphs (Q1391299) (← links)
- Decompositions for the edge colouring of reduced indifference graphs. (Q1401296) (← links)
- Bounds for the rainbow disconnection numbers of graphs (Q2115196) (← links)
- The chromatic index of a claw-free graph whose core has maximum degree 2 (Q2354597) (← links)
- On edge-colouring indifference graphs (Q5096339) (← links)
- (Q5708515) (← links)
- The overfull conjecture on split-comparability and split-interval graphs (Q6048434) (← links)
