Colouring of \((P_3 \cup P_2)\)-free graphs
From MaRDI portal
Publication:1706425
DOI10.1007/s00373-017-1870-8zbMath1390.05062arXiv1610.07177OpenAlexW3121832159MaRDI QIDQ1706425
Arpitha P. Bharathi, Sheshayya A. Choudum
Publication date: 22 March 2018
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1610.07177
colouringchromatic numberclique numberperfect graphsdiamond\((P_3 \cup P_2)\)-free graphs\(2K_{2}\)-free graphs
Related Items (10)
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_6\), diamond)-free graphs ⋮ Coloring of some crown-free graphs ⋮ An optimal χ‐bound for (P6, diamond)‐free graphs ⋮ 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 ⋮ Chromatic bounds for some classes of \(2 K_2\)-free graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs
- The strong perfect graph theorem
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree
- On the existence of two non-neighboring subgraphs in a graph
- A bound on the chromatic number of graphs without certain induced subgraphs
- (\(P_{5}\), diamond)-free graphs revisited: Structure and linear time optimization.
- On (\(P_{5}\), diamond)-free graphs
- Graphs with no induced \(C_ 4\) and \(2K_ 2\)
- Vertex colouring and forbidden subgraphs -- a survey
- On a property of the class of n-colorable graphs
- Vizing bound for the chromatic number on some graph classes
- Graph Classes: A Survey
This page was built for publication: Colouring of \((P_3 \cup P_2)\)-free graphs