Pages that link to "Item:Q6055942"
From MaRDI portal
The following pages link to On graphs with no induced five‐vertex path or paraglider (Q6055942):
Displaying 9 items.
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- On the chromatic number of some \(P_5\)-free graphs (Q2144602) (← links)
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions (Q2166229) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- Clique‐width: Harnessing the power of atoms (Q6062871) (← 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)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- Optimal chromatic bound for (P2+P3,P2+P3¯ ${P}_{2}+{P}_{3},\bar{{P}_{2}+{P}_{3}}$)‐free graphs (Q6143379) (← links)