The following pages link to (Q4242948):
Displaying 50 items.
- Clique number of the square of a line graph (Q271628) (← links)
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- A lower bound on the independence number of a graph in terms of degrees and local clique sizes (Q298956) (← links)
- Randomly colouring graphs (a combinatorial view) (Q458462) (← links)
- Colouring graphs when the number of colours is almost the maximum degree (Q462929) (← links)
- On the proper orientation number of bipartite graphs (Q484321) (← links)
- Chromatic number and complete graph substructures for degree sequences (Q485549) (← links)
- A superlocal version of Reed's conjecture (Q490262) (← links)
- Graphs with least eigenvalue \(-2\): ten years on (Q491141) (← links)
- On bounding the difference of the maximum degree and the clique number (Q497368) (← links)
- Upper bounds on the chromatic number of triangle-free graphs with a forbidden subtree (Q512863) (← links)
- Bounding \(\chi \) in terms of \(\omega \) and \(\varDelta \) for some classes of graphs (Q536214) (← links)
- Vertex cover problem parameterized above and below tight bounds (Q633768) (← links)
- List-coloring claw-free graphs with small clique number (Q742576) (← links)
- \([r,s,t]\)-coloring of trees and bipartite graphs (Q960923) (← links)
- Asymptotically optimal frugal colouring (Q965250) (← links)
- Some results on Reed's conjecture about \(\omega ,\Delta \), and \(\chi \) with respect to \(\alpha \) (Q968410) (← links)
- A strengthening of Brooks' theorem (Q1306303) (← links)
- On the list coloring version of Reed's conjecture (Q1689939) (← links)
- New construction of graphs with high chromatic number and small clique number (Q1702354) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- (\(\Delta-k\))-critical graphs (Q1767668) (← links)
- Corrigendum to: ``A local epsilon version of Reed's conjecture'' (Q1984533) (← links)
- Strong cliques in claw-free graphs (Q2053719) (← links)
- On the Nash number and the diminishing Grundy number of a graph (Q2127607) (← links)
- Colouring graphs with sparse neighbourhoods: bounds and applications (Q2131867) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- Bounding \(\chi\) by a fraction of \(\Delta\) for graphs without large cliques (Q2171021) (← links)
- New potential functions for greedy independence and coloring (Q2255044) (← links)
- A note on coloring vertex-transitive graphs (Q2341047) (← links)
- An upper bound for the chromatic number of line graphs (Q2461774) (← links)
- Exact square coloring of subcubic planar graphs (Q2659166) (← links)
- The chromatic number of triangle-free and broom-free graphs in terms of the number of vertices (Q2662887) (← links)
- Upper bounds for the chromatic number of a graph (Q3439493) (← links)
- Brooks' Theorem and Beyond (Q3466339) (← links)
- A Short Proof That χ Can be Bounded ε Away from Δ + 1 toward ω (Q3466351) (← links)
- Coloring nonuniform hypergraphs: A new algorithmic approach to the general Lov�sz local lemma (Q4521547) (← links)
- A Ramsey‐type problem and the Turán numbers* (Q4539875) (← links)
- Graph coloring approach with new upper bounds for the chromatic number: team building application (Q4611483) (← links)
- Claw‐Free Graphs, Skeletal Graphs, and a Stronger Conjecture on ω, Δ, and χ (Q4982280) (← links)
- $t$-Strong Cliques and the Degree-Diameter Problem (Q5020846) (← links)
- (Q5047016) (← links)
- Maximizing Line Subgraphs of Diameter at Most t (Q5071098) (← links)
- (Q5090456) (← links)
- Hitting all maximum cliques with a stable set using lopsided independent transversals (Q5199419) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- A Note on Hitting Maximum and Maximal Cliques With a Stable Set (Q5325947) (← links)
- Short Fans and the 5/6 Bound for Line Graphs (Q5357961) (← links)
- Algorithmic bounds for the chromatic number† (Q5449019) (← links)
- Coloring Graphs with Dense Neighborhoods (Q5495890) (← links)
