Perfect coloring and linearly χ-boundP6-free graphs
From MaRDI portal
Publication:3437005
DOI10.1002/jgt.20212zbMath1121.05045OpenAlexW4248338075MaRDI QIDQ3437005
T. Karthick, M. A. Shalu, Sheshayya 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
Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (23)
Vizing bound for the chromatic number on some graph classes ⋮ On the chromatic number of some \(P_5\)-free graphs ⋮ Star chromatic bounds ⋮ Homogeneous sets, clique-separators, critical graphs, and optimal \(\chi\)-binding functions ⋮ On the chromatic number of (\(P_6\), diamond)-free graphs ⋮ Structure and algorithms for (cap, even hole)-free graphs ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ Coloring of some crown-free graphs ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ Divisibility and coloring of some \(P_5\)-free graphs ⋮ Coloring graphs with no induced five‐vertex path or gem ⋮ Star coloring of certain graph classes ⋮ A tight linear bound to the chromatic number of \((P_5, K_1 +(K_1 \cup K_3))\)-free graphs ⋮ Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ On the chromatic number of \((P_{5},K_{2,t})\)-free graphs ⋮ First-fit coloring of \(\{P_{5},K_{4}-e\}\)-free graphs ⋮ Chromatic bounds for some classes of \(2 K_2\)-free graphs ⋮ On the chromatic number of (P_{5},windmill)-free graphs ⋮ Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs ⋮ Square-Free Graphs with No Six-Vertex Induced Path ⋮ A BOUND FOR THE CHROMATIC NUMBER OF (, GEM)-FREE GRAPHS ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs
This page was built for publication: Perfect coloring and linearly χ-boundP6-free graphs
