Chromatic bounds for some classes of \(2 K_2\)-free graphs
From MaRDI portal
Publication:1783621
DOI10.1016/J.DISC.2018.07.018zbMath1395.05059arXiv1702.00622OpenAlexW2962995451MaRDI QIDQ1783621
T. Karthick, Suchismita Mishra
Publication date: 21 September 2018
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1702.00622
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
Related Items (8)
Chromatic bounds for the subclasses of \(pK_2\)-free graphs ⋮ On the chromatic number of \(2 K_2\)-free graphs ⋮ On the chromatic number of \(P_5\)-free graphs with no large intersecting cliques ⋮ 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 ⋮ Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey ⋮ Coloring of \((P_5, 4\)-wheel)-free graphs
Cites Work
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- The strong perfect graph theorem
- On the coverings of graphs
- A bound on the chromatic number of graphs without certain induced subgraphs
- Linear recognition of pseudo-split graphs
- Colouring of \((P_3 \cup P_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\)
- A characterization of perfect graphs
- On a property of the class of n-colorable graphs
- Vizing bound for the chromatic number on some graph classes
- Perfect coloring and linearly χ-boundP6-free graphs
- Graph Classes: A Survey
- Sur le coloriage des graphs
- On the divisibility of graphs
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Chromatic bounds for some classes of \(2 K_2\)-free graphs
