Bounds for the chromatic number of some \(pK_2\)-free graphs
From MaRDI portal
Publication:6103479
DOI10.1016/j.dam.2023.02.022zbMath1515.05071OpenAlexW4366608190MaRDI QIDQ6103479
Athmakoori Prashant, M. Gokulnath, S. Francis Raj
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
Cites Work
- Unnamed Item
- Unnamed Item
- Chromatic bounds for the subclasses of \(pK_2\)-free graphs
- On the coverings of graphs
- 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\)
- On a property of the class of n-colorable graphs
- Vizing bound for the chromatic number on some graph classes
- 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
This page was built for publication: Bounds for the chromatic number of some \(pK_2\)-free graphs