Coloring (\(P_5\), kite)-free graphs with small cliques
From MaRDI portal
Publication:6180573
DOI10.1016/j.dam.2023.11.025zbMath1529.05065arXiv2204.08631OpenAlexW4388750232MaRDI QIDQ6180573
T. Karthick, Yiao Ju, Shenwei Huang
Publication date: 22 December 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2204.08631
Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Updating the complexity status of coloring graphs without a fixed induced linear forest
- The strong perfect graph theorem
- \(K_{4}\)-free graphs with no odd holes
- Linear chromatic bounds for a subfamily of \(3K_{1}\)-free graphs
- Coloring the hypergraph of maximal cliques of a graph with no long path
- On the structure and stability number of \(P_{5}\)- and co-chair-free graphs
- Triangle-free graphs and forbidden subgraphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
- Triangle-free \(2P_3\)-free graphs are 4-colorable
- The chromatic number of \(\{P_5,K_4\}\)-free graphs
- Forbidden Subgraphs and 3-Colorings
- χ‐bounds, operations, and chords
- Square-Free Graphs with No Six-Vertex Induced Path
- $(2P_2,K_4)$-Free Graphs are 4-Colorable
- Sur le coloriage des graphs
- Coloring graphs with no induced five‐vertex path or gem
This page was built for publication: Coloring (\(P_5\), kite)-free graphs with small cliques