Pages that link to "Item:Q765195"
From MaRDI portal
The following pages link to \(\Delta \)-critical graphs with small high vertex cliques (Q765195):
Displaying 8 items.
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Partitioning and coloring graphs with degree constraints (Q1947012) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Brooks' theorem for 2-fold coloring (Q5061398) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)