Perfect coloring and linearly χ-boundP6-free graphs
From MaRDI portal
Publication:3437005
DOI10.1002/JGT.20212zbMATH Open1121.05045OpenAlexW4248338075MaRDI QIDQ3437005FDOQ3437005
S. A. Choudum, T. Karthick, M. A. Shalu
Publication date: 11 May 2007
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.20212
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
Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)
Cited In (27)
- On the chromatic number of some \(P_5\)-free graphs
- A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS
- Coloring of \((P_5, 4\)-wheel)-free graphs
- Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
- First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free 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_2\)-free graphs
- On the chromatic number of (\(P_6\), diamond)-free graphs
- Structure of some \(( P_7, C_4)\)-free graphs with application to colorings
- Vizing bound for the chromatic number on some graph classes
- Star coloring of certain graph classes
- An optimal χ‐bound for (P6, diamond)‐free graphs
- Star chromatic bounds
- Coloring of some crown-free graphs
- Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions
- The chromatic number of (\(P_5\), HVN)-free graphs
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- On the chromatic number of \((P_{5},K_{2,t})\)-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_5, C_5, K_5 -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_5, K_1 +(K_1 \cup K_3))\)-free graphs
- On the chromatic number of (P_{5},windmill)-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)
