Pages that link to "Item:Q1229220"

The following pages link to Brooks' graph-coloring theorem and the independence number (Q1229220):

Displayed 7 items.

• On the maximum parsimony distance between phylogenetic trees (Q259724) ‎ (← links)
• A unified proof of Brooks' theorem and Catlin's theorem (Q472980) ‎ (← links)
• Chromatic optimisation: Limitations, objectives, uses, references (Q1162931) ‎ (← links)
• The edge chromatic difference sequence of a cubic graph (Q1377864) ‎ (← links)
• Vertex arboricity and maximum degree (Q1894756) ‎ (← links)
• The toughness of cubic graphs (Q1911237) ‎ (← links)
• Brooks' Theorem and Beyond (Q3466339) ‎ (← links)