The following pages link to A survey of χ‐boundedness (Q5066934):
Displayed 50 items.
- A better upper bound on the chromatic number of (cap, even-hole)-free graphs (Q1981707) (← links)
- Structure and colour in triangle-free graphs (Q2034076) (← links)
- Induced subgraphs of graphs with large chromatic number. V. Chandeliers and strings (Q2040019) (← links)
- From \(\chi\)- to \(\chi_p\)-bounded classes (Q2099414) (← links)
- A counterexample to a conjecture about triangle-free induced subgraphs of graphs with large chromatic number (Q2101164) (← links)
- A note on a conjecture of Wu, Xu and Xu (Q2109109) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Local boxicity (Q2122684) (← links)
- Chordal directed graphs are not \(\chi\)-bounded (Q2138574) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- Graph theory -- a survey on the occasion of the Abel Prize for László Lovász (Q2143333) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- 2-divisibility of some odd hole free graphs (Q2155661) (← links)
- Coloring graph classes with no induced fork via perfect divisibility (Q2161205) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- The \(\varepsilon\)-\(t\)-net problem (Q2167320) (← links)
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
- The Erdős-Hajnal property for graphs with no fixed cycle as a pivot-minor (Q2662350) (← links)
- Degeneracy of \(P_t\)-free and \(C_{\geq t}\)-free graphs with no large complete bipartite subgraphs (Q2664559) (← links)
- Graph theory. Abstracts from the workshop held January 2--8, 2022 (Q2693028) (← links)
- Burling graphs revisited. I: New characterizations (Q2700996) (← links)
- Polynomial bounds for chromatic number VI. Adding a four-vertex path (Q2701011) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- Dense Induced Subgraphs of Dense Bipartite Graphs (Q4986805) (← links)
- Circle graphs are quadratically χ‐bounded (Q5006380) (← links)
- Treewidth versus Clique Number. I. Graph Classes with a Forbidden Structure (Q5013568) (← links)
- Improved bounds for colouring circle graphs (Q5039236) (← links)
- Box and Segment Intersection Graphs with Large Girth and Chromatic Number (Q5162871) (← links)
- Helly-type problems (Q5868651) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5918711) (← links)
- Distributed coloring and the local structure of unit-disk graphs (Q5925586) (← links)
- Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree (Q6046682) (← links)
- THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
- Triangle‐free graphs with large chromatic number and no induced wheel (Q6047638) (← links)
- Fair allocation algorithms for indivisible items under structured conflict constraints (Q6056608) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
- Polynomial bounds for chromatic number. III. Excluding a double star (Q6057630) (← links)
- Coloring of some crown-free graphs (Q6063283) (← links)
- Some remarks on graphs with no induced subdivision of \(K_4\) (Q6064854) (← links)
- On coloring digraphs with forbidden induced subgraphs (Q6074583) (← links)
- Attempting perfect hypergraphs (Q6076187) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Polynomial bounds for chromatic number VII. Disjoint holes (Q6081574) (← links)
- Rainbow independent sets in certain classes of graphs (Q6081576) (← links)
- Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
- Problems close to my heart (Q6116410) (← links)
- Weakening total coloring conjecture and Hadwiger's conjecture on total graphs (Q6117407) (← links)
- A note on the Gyárfás-Sumner conjecture (Q6121918) (← links)
- Highly Connected Subgraphs with Large Chromatic Number (Q6141860) (← links)
- Grounded \(\mathrm{L}\)-graphs are polynomially \(\chi \)-bounded (Q6142355) (← links)