Pages that link to "Item:Q5379815"
From MaRDI portal
The following pages link to Perfect divisibility and 2‐divisibility (Q5379815):
Displaying 19 items.
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Coloring of \((P_5, 4\)-wheel)-free graphs (Q2113346) (← 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)
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
- THE CHROMATIC NUMBER OF -FREE GRAPHS (Q6046762) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques (Q6084676) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- On the chromatic number of (P5,dart)-free graphs (Q6132236) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Perfect divisibility and coloring of some fork-free graphs (Q6570043) (← 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)
- On the chromatic number of a family of odd hole free graphs (Q6670771) (← links)
