Pages that link to "Item:Q3437005"
From MaRDI portal
The following pages link to Perfect coloring and linearly χ-boundP6-free graphs (Q3437005):
Displaying 29 items.
- Star chromatic bounds (Q327688) (← links)
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs (Q510963) (← links)
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs (Q968185) (← links)
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs (Q1014826) (← links)
- Structure and algorithms for (cap, even hole)-free graphs (Q1685999) (← links)
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs (Q1687923) (← links)
- Star coloring of certain graph classes (Q1706426) (← links)
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey (Q1733849) (← links)
- Chromatic bounds for some classes of \(2 K_2\)-free graphs (Q1783621) (← 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 some \(P_5\)-free graphs (Q2144602) (← 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)
- On the chromatic number of (\(P_6\), diamond)-free graphs (Q2413634) (← links)
- Vizing bound for the chromatic number on some graph classes (Q2631086) (← links)
- A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs (Q2701401) (← links)
- On the chromatic number of (P_{5},windmill)-free graphs (Q4690990) (← links)
- Square-Free Graphs with No Six-Vertex Induced Path (Q5232134) (← links)
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS (Q5232874) (← links)
- On graphs with no induced five‐vertex path or paraglider (Q6055942) (← links)
- Coloring of some crown-free graphs (Q6063283) (← links)
- An optimal χ‐bound for (P6, diamond)‐free graphs (Q6080859) (← links)
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs (Q6098088) (← links)
- Divisibility and coloring of some \(P_5\)-free graphs (Q6124429) (← links)
- Coloring graphs with no induced five‐vertex path or gem (Q6134643) (← links)
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings (Q6611001) (← 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)
