Pages that link to "Item:Q409481"
From MaRDI portal
The following pages link to Graphs with chromatic number close to maximum degree (Q409481):
Displaying 16 items.
- On the Corrádi-Hajnal theorem and a question of Dirac (Q345076) (← links)
- Ore's conjecture on color-critical graphs is almost true (Q462926) (← links)
- Characterizing 4-critical graphs with Ore-degree at most seven (Q684124) (← links)
- Stochastic solutions for fractional wave equations (Q745693) (← links)
- Sharpening an ore-type version of the Corrádi-Hajnal theorem (Q1688267) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← 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)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- (Q5883509) (← links)
- A note on Reed's conjecture for triangle-free graphs (Q6080563) (← links)
- Special issue in honour of Landon Rabern (Q6091821) (← links)
- Coloring \(\{ P 2 \cup P 3 , \operatorname{house} \} \)-free graphs with \(\Delta - 1\) colors (Q6143841) (← links)
- (Q6150893) (← links)
- Partitioning of a graph into induced subgraphs not containing prescribed cliques (Q6180565) (← links)
- Brooks' theorem in graph streams: a single-pass semi-streaming algorithm for \(\Delta\)-coloring (Q6566595) (← links)
