Pages that link to "Item:Q1839257"

The following pages link to Proof of a conjecture of T. Gallai concerning connectivity properties of colour-critical graphs (Q1839257):

Displaying 9 items.

• Graphs with chromatic number close to maximum degree (Q409481) (← links)
• Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
• On the edge-density of 4-critical graphs (Q624211) (← links)
• Ore-type versions of Brooks' theorem (Q1003831) (← links)
• On list critical graphs (Q1044925) (← links)
• On constructive methods in the theory of colour-critical graphs (Q1121899) (← links)
• On the minimal number of edges in color-critical graphs (Q1272188) (← links)
• Path partition number in tough graphs (Q1356718) (← links)
• A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)