Perfect coloring and linearly χ-boundP6-free graphs

DOI10.1002/JGT.20212MaRDI QIDQ3437005zbMATH OpenOpenAlexFDO

Authors T. Karthick, M. A. Shalu, S. A. Choudum

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

zbMATH Keywords

\(P_6\)-free graph\(\chi\)-binding function\(P_4\)-free coloring\(P_5\)-free graphPerfect coloring

Mathematics Subject Classification ID

Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Coloring of graphs and hypergraphs (05C15)

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

(31)

• Linearly \(\chi \)-bounding \((P_6, C_4)\)-free graphs
• On graphs with no induced five‐vertex path or paraglider
• Coloring (\(P_5\), kite)-free graphs with small cliques
• Structure of some \(( P_7, C_4)\)-free graphs with application to colorings
• Forbidden induced pairs for perfectness and \(\omega\)-colourability of graphs
• Coloring of some crown-free graphs
• Linearly \(\chi\)-bounding \((P_6,C_4)\)-free graphs
• Chromatic bounds for some classes of \(2 K_2\)-free graphs
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• Square-Free Graphs with No Six-Vertex Induced Path
• A bound for the chromatic number of \((P_5, \text{gem})\)-free graphs
• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• On the chromatic number of some \(P_5\)-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• Star coloring of certain graph classes
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs
• Structure and algorithms for (cap, even hole)-free graphs
• First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs
• The chromatic number of (\(P_5\), HVN)-free graphs
• An optimal χ‐bound for (P6, diamond)‐free graphs
• On the chromatic number of (\(P_6\), diamond)-free graphs
• A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs
• Coloring graphs with no induced five‐vertex path or gem
• On the chromatic number of (P_{5},windmill)-free graphs
• Star chromatic bounds
• Improved bounds on the chromatic number of (\(P_5\), flag)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Vizing bound for the chromatic number on some graph classes
• Non-perfect \((P_5, C_5, K_5 -e)\)-free graphs are 5-colorable
• Divisibility and coloring of some \(P_5\)-free graphs
• Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions

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)