Perfect coloring and linearly χ-boundP6-free graphs
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 1339824
- On the strong perfect graph conjecture
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- On the chromatic number of some \(P_5\)-free graphs
- scientific article; zbMATH DE number 3887731
- Perfect graphs with no \(P_ 5\) and no \(K_ 5\)
- Coloring perfect \((K_ 4\)-e)-free graphs
- Generalized perfect graphs: Characterizations and inversion
- On the two‐edge‐colorings of perfect graphs
- Coloring graphs with no induced five‐vertex path or gem
Cited in
(35)- On graphs with no induced P₅ or K₅-e
- On the chromatic number of some \(P_5\)-free graphs
- Structure and coloring of a family of (P₇, C₅)-free graphs
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
- Coloring of \((P_5, 4\)-wheel)-free graphs
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
- Structure and algorithms for (cap, even hole)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Chromatic bounds for some classes of 2 K₂-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Coloring of \((P_6, \mathrm{dart}, K_4)\)-free graphs
- -boundedness and related problems on graphs without long induced paths: a survey
- Structure of some ( P₇, C₄)-free graphs with application to colorings
- A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
- Coloring (P₅, kite)-free graphs with small cliques
- Vizing bound for the chromatic number on some graph classes
- Star chromatic bounds
- Star coloring of certain graph classes
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Coloring of some crown-free graphs
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- The chromatic number of (\(P_5\), HVN)-free graphs
- On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
- Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
- Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
- Square-Free Graphs with No Six-Vertex Induced Path
- Non-perfect (P₅, C₅, K₅ -e)-free graphs are 5-colorable
- On graphs with no induced five‐vertex path or paraglider
- Coloring graphs with no induced five‐vertex path or gem
- A tight linear bound to the chromatic number of (P₅, K₁ +(K₁ K₃))-free graphs
- On the chromatic number of (P_{5},windmill)-free graphs
- Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs
- Divisibility and coloring of some \(P_5\)-free graphs
This page was built for publication: Perfect coloring and linearly χ-boundP6-free graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3437005)
