Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs

DOI10.1007/S00373-008-0801-0zbMath1190.05066OpenAlexW2077333178MaRDI QIDQ1014826

M. A. Shalu, T. Karthick, Sheshayya A. Choudum

Publication date: 29 April 2009

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-008-0801-0

zbMATH Keywords

graphschromatic numberclique number\(\chi \)-binding function

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (11)

Bounded clique cover of some sparse graphs ⋮ Vizing bound for the chromatic number on some graph classes ⋮ Star chromatic bounds ⋮ On graphs with no induced five‐vertex path or paraglider ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ Coloring (\(P_5\), kite)-free graphs with small cliques ⋮ Independent sets and matchings in subcubic graphs ⋮ Star coloring of certain graph classes ⋮ Independence and matching number in graphs with maximum degree 4 ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Claw-free graphs. VI: Colouring
• On the chromatic index of multigraphs without large triangles
• The strong perfect graph theorem
• On the chromatic number of a graph with two forbidden subgraphs
• Vertex colouring and forbidden subgraphs -- a survey
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• A characterization of perfect graphs
• Perfect coloring and linearly χ-boundP6-free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Berge trigraphs
• Hidden superconformal symmetry in M-theory
• On the divisibility of graphs

This page was built for publication: Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs