Coloring of a superclass of \(2K_2\)-free graphs

DOI10.1007/978-3-031-25211-2_15arXiv2207.08168OpenAlexW4318023094MaRDI QIDQ6132534

Athmakoori Prashant, S. Francis Raj

Publication date: 17 August 2023

Published in: Algorithms and Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2207.08168

zbMATH Keywords

chromatic number\(2K_2\)-free graphs\( \chi \)-binding function

Mathematics Subject Classification ID

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

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Chromatic bounds for the subclasses of \(pK_2\)-free graphs
• The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
• On the existence of two non-neighboring subgraphs in a graph
• Paw-free graphs
• A bound on the chromatic number of graphs without certain induced 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 the chromatic number of some \(P_5\)-free graphs
• Graph Theory and Probability
• On the chromatic number of (P_{5},windmill)-free graphs
• $(2P_2,K_4)$-Free Graphs are 4-Colorable
• Sur le coloriage des graphs
• Chromatic bounds for some subclasses of \((P_3\cup P_2)\)-free graphs

This page was built for publication: Coloring of a superclass of \(2K_2\)-free graphs