Linear chromatic bounds for a subfamily of 3K₁-free graphs

DOI10.1007/S00373-008-0801-0MaRDI QIDQ1014826zbMATH OpenOpenAlexFDO

Authors T. Karthick, M. A. Shalu, S. 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

\(\chi \)-binding functionchromatic numberclique numbergraphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic bounds for some classes of 2 K₂-free graphs
• Bounds for the chromatic number of some \(pK_2\)-free graphs
• On the chromatic number of \(2 K_2\)-free graphs
• scientific article; zbMATH DE number 2186978
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs

Cites work

• A characterization of perfect graphs
• Berge trigraphs
• Claw-free graphs. VI: Colouring
• Graph theory with applications
• Hidden superconformal symmetry in M-theory
• scientific article; zbMATH DE number 2186978 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• On the chromatic index of multigraphs without large triangles
• On the chromatic number of a graph with two forbidden subgraphs
• On the divisibility of graphs
• Perfect coloring and linearly χ-boundP6-free graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The strong perfect graph theorem
• Vertex colouring and forbidden subgraphs -- a survey

Cited in

(19)

• Star coloring of certain graph classes
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Chromatic bounds for some classes of 2 K₂-free graphs
• Coloring of \((P_5, 4\)-wheel)-free graphs
• Bounded clique cover of some sparse graphs
• Independence and matching number in graphs with maximum degree 4
• Vizing bound for the chromatic number on some graph classes
• scientific article; zbMATH DE number 2186978 (Why is no real title available?)
• Star chromatic bounds
• Independent sets and matchings in subcubic graphs
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• On graphs with no induced five‐vertex path or paraglider
• An optimal χ‐bound for (P6, diamond)‐free graphs
• Coloring (P₅, kite)-free graphs with small cliques
• A Generalization of \chi -Binding Functions
• Linear χ -binding functions for some classes of ( P ₃ ∪ P ₂ )-free graphs
• Optimal coloring of \((P_2 + P_3, \mathrm{gem})\)-free graphs
• -boundedness and related problems on graphs without long induced paths: a survey
• Odd clique minors and chromatic bounds of {\(3K_1\), paraglider}-free graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1014826)