Chromatic bounds for the subclasses of \(pK_2\)-free graphs

DOI10.1007/978-3-030-67899-9_23OpenAlexW3127981037MaRDI QIDQ831732

Athmakoori Prashant, M. Gokulnath

Publication date: 24 March 2022

Full work available at URL: https://doi.org/10.1007/978-3-030-67899-9_23

zbMATH Keywords

chromatic numbercoloring\( \chi \)-binding funtion\(2K_2\)-free graphs\(pK_2\)-free graphs

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15)

Related Items

Chromatic bounds for some subclasses of \((P_3\cup P_2)\)-free graphs, Bounds for the chromatic number of some \(pK_2\)-free graphs, Coloring of a superclass of \(2K_2\)-free graphs

Cites Work

• Unnamed Item
• Unnamed Item
• A bound on the chromatic number of graphs without certain induced subgraphs
• Triangle-free graphs and forbidden subgraphs
• On the chromatic number of \(2 K_2\)-free graphs
• Colouring of \((P_3 \cup P_2)\)-free graphs
• Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
• Chromatic bounds for some classes of \(2 K_2\)-free graphs
• Graphs with no induced \(C_ 4\) and \(2K_ 2\)
• Vertex colouring and forbidden subgraphs -- a survey
• On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
• Vizing bound for the chromatic number on some graph classes
• $(2P_2,K_4)$-Free Graphs are 4-Colorable