The following pages link to Colouring the petals of a graph (Q1871369):
Displaying 10 items.
- Some criteria for a graph to be class 1 (Q442377) (← links)
- The chromatic index of a graph whose core is a cycle of order at most 13 (Q742593) (← links)
- Graph edge coloring: a survey (Q1733850) (← links)
- Edge-colouring graphs with bounded local degree sums (Q2184694) (← links)
- Chromatic index of graphs with no cycle with a unique chord (Q2267844) (← links)
- The chromatic index of a claw-free graph whose core has maximum degree 2 (Q2354597) (← links)
- The Hilton--Zhao Conjecture is True for Graphs with Maximum Degree 4 (Q5232150) (← links)
- Clique-perfectness of complements of line graphs (Q5891101) (← links)
- Clique-perfectness of complements of line graphs (Q5919747) (← links)
- The core conjecture of Hilton and Zhao (Q6196157) (← links)
