Pages that link to "Item:Q3651176"
From MaRDI portal
The following pages link to A list version of Dirac's theorem on the number of edges in colour-critical graphs (Q3651176):
Displaying 14 items.
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Proof of the list edge coloring conjecture for complete graphs of prime degree (Q743657) (← links)
- Coloring vertices and faces of locally planar graphs (Q855294) (← links)
- On list critical graphs (Q1044925) (← links)
- List edge chromatic number of graphs with large girth (Q1197027) (← links)
- A new lower bound on the number of edges in colour-critical graphs and hypergraphs (Q1405127) (← links)
- A Brooks type theorem for the maximum local edge connectivity (Q1753016) (← links)
- Variable degeneracy: Extensions of Brooks' and Gallai's theorems (Q1972133) (← links)
- Beyond degree choosability (Q2401410) (← links)
- A map colour theorem for the union of graphs (Q2581497) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- A short proof that the list packing number of any graph is well defined (Q6091812) (← links)
- Generalized DP-colorings of graphs (Q6091813) (← links)
- Variable degeneracy on toroidal graphs (Q6143693) (← links)
