Bounds for the chromatic number of some pK₂-free graphs

DOI10.1016/J.DAM.2023.02.022MaRDI QIDQ6103479zbMATH OpenOpenAlexFDO

Authors Athmakoori Prashant, S. Francis Raj, M. Gokulnath

Publication date 5 June 2023

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2023.02.022

zbMATH Keywords

\(2K_2\)-free graphs and \(pK_2\)-free graphs\(\chi\)-binding functionchromatic number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Recommendations

• Chromatic bounds for the subclasses of pK₂-free graphs
• Chromatic bounds for some classes of 2 K₂-free graphs
• On the chromatic number of \(2 K_2\)-free graphs
• Chromatic bounds for some subclasses of (P₃ P₂)-free graphs
• Bounds for the chromatic number of a graph
• Some bounds for the b-chromatic number of a graph
• On chromatic number of \(\{2K_1+K_2,C_4\}\)-free graphs
• scientific article; zbMATH DE number 6383843
• Bounds for the Grundy chromatic number of graphs in terms of domination number
• A comparison of the Grundy and b-chromatic number of \(K_{2,t}\)-free graphs

Cites work

• \((2P_2,K_4)\)-free graphs are 4-colorable
• A bound on the chromatic number of graphs without certain induced subgraphs
• Chromatic bounds for some classes of 2 K₂-free graphs
• Chromatic bounds for the subclasses of pK₂-free graphs
• Colouring of (P₃ P₂)-free graphs
• Graph Theory and Probability
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• scientific article; zbMATH DE number 2200042 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• On a property of the class of n-colorable graphs
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• On the chromatic number of (P_{5},windmill)-free graphs
• On the chromatic number of \(2 K_2\)-free graphs
• On the coverings of graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Sur le coloriage des graphs
• Triangle-free graphs and forbidden subgraphs
• Vertex colouring and forbidden subgraphs -- a survey
• Vizing bound for the chromatic number on some graph classes

Cited in

(8)

• Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
• On the chromatic number of \(2 K_2\)-free graphs
• Chromatic bounds for some classes of 2 K₂-free graphs
• On the chromatic number of \((P_{5},K_{2,t})\)-free graphs
• Linear χ -binding functions for some classes of ( P ₃ ∪ P ₂ )-free graphs
• Improved bounds on the chromatic number of (P₃ p₂, W₄)-free graphs
• Optimal chromatic bound for (P₃ P₂, house)-free graphs
• On the chromatic number of a superclass of 2 K₂-free graphs

This page was built for publication: Bounds for the chromatic number of some \(pK_2\)-free graphs

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