Pages that link to "Item:Q1003831"
From MaRDI portal
The following pages link to Ore-type versions of Brooks' theorem (Q1003831):
Displaying 16 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Graphs with chromatic number close to maximum degree (Q409481) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- A fast algorithm for equitable coloring (Q532129) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Equitable defective coloring of sparse planar graphs (Q764883) (← links)
- \(\Delta \)-critical graphs with small high vertex cliques (Q765195) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Graphs containing every 2-factor (Q1926028) (← links)
- Improved lower bounds on the number of edges in list critical and online list critical graphs (Q2284728) (← links)
- Partitioning 2-Edge-Colored Ore-Type Graphs by Monochromatic Cycles (Q2800590) (← links)
- Graphs with $\chi=\Delta$ Have Big Cliques (Q2949718) (← links)
- Embedding Graphs into Larger Graphs: Results, Methods, and Problems (Q3295275) (← links)
- (Q5061398) (← links)
- Ramsey-Turán type results for matchings in edge colored graphs (Q6136669) (← links)
