Pages that link to "Item:Q1942664"
From MaRDI portal
The following pages link to The chromatic number of \(\{P_5,K_4\}\)-free graphs (Q1942664):
Displaying 33 items.
- Chromatic number of \(P_5\)-free graphs: Reed's conjecture (Q279215) (← links)
- On the small graphs with chromatic number 5 without 4-cliques (Q1584347) (← links)
- On the chromatic number of \(2 K_2\)-free graphs (Q1634757) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Borodin-Kostochka's conjecture on \((P_5,C_4)\)-free graphs (Q2053188) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- The maximum size of an edge 2-neighborhood in \(P_5\)-free graphs (Q2144507) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Classes of graphs with no long cycle as a vertex-minor are polynomially \(\chi\)-bounded (Q2284734) (← links)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- On the chromatic number of pentagon-free graphs of large minimum degree (Q2460625) (← 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)
- On chromatic number of graphs without certain induced subgraphs. (Q2918532) (← links)
- A Survey on the Computational Complexity of Coloring Graphs with Forbidden Subgraphs (Q2978179) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
- $(2P_2,K_4)$-Free Graphs are 4-Colorable (Q5232143) (← links)
- (Q5740788) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5918256) (← links)
- On indicated coloring of some classes of graphs (Q5919702) (← links)
- \(k\)-critical graphs in \(P_5\)-free graphs (Q5925505) (← links)
- Coloring (P5,gem) $({P}_{5},\text{gem})$‐free graphs with Δ−1 ${\rm{\Delta }}-1$ colors (Q6046645) (← links)
- Polynomial bounds for chromatic number II: Excluding a star‐forest (Q6057629) (← links)
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
- Coloring graphs without induced \(P_5\) or \(K_5-e\) (Q6089566) (← links)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
- On cd-coloring of \(\{P_5,K_4\}\)-free chordal graphs (Q6102271) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
- Coloring (\(P_5\), kite)-free graphs with small cliques (Q6180573) (← links)
- Graphs of large chromatic number (Q6198641) (← links)
- The chromatic number of (\(P_5\), HVN)-free graphs (Q6639497) (← links)
- Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable (Q6660054) (← links)
