Pages that link to "Item:Q2144602"
From MaRDI portal
The following pages link to On the chromatic number of some \(P_5\)-free graphs (Q2144602):
Displaying 21 items.
- On color-critical (\(P_5\),\(\operatorname{co-}P_5\))-free graphs (Q344847) (← links)
- The chromatic number of 5-valent circulants (Q998365) (← links)
- On the small graphs with chromatic number 5 without 4-cliques (Q1584347) (← links)
- The chromatic number of \(\{P_5,K_4\}\)-free graphs (Q1942664) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← links)
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs (Q2138579) (← links)
- On the chromatic number of pentagon-free graphs of large minimum degree (Q2460625) (← 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)
- Perfect coloring and linearly χ-boundP6-free graphs (Q3437005) (← links)
- On the divisibility of graphs (Q5957752) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- Coloring of some crown-free graphs (Q6063283) (← 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)
- 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)
