Coloring graph classes with no induced fork via perfect divisibility
From MaRDI portal
Publication:2161205
DOI10.37236/10348zbMath1498.05099arXiv2104.02807OpenAlexW3148968250MaRDI QIDQ2161205
Vaidy Sivaraman, Jenny Kaufmann, T. Karthick
Publication date: 4 August 2022
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2104.02807
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)
Related Items (2)
Coloring of some crown-free graphs ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
Cites Work
- Unnamed Item
- Maximum weight independent sets in classes related to claw-free graphs
- Claw-free graphs. VI: Colouring
- Square-free graphs with no induced fork
- The strong perfect graph theorem
- Claw-free graphs. IV: Decomposition theorem
- On maximal independent sets of vertices in claw-free graphs
- Algorithme de recherche d'un stable de cardinalité maximum dans un graphe sans étoilé
- A bound on the chromatic number of graphs without certain induced subgraphs
- Claw-free graphs---a survey
- On the chromatic number of \(2 K_2\)-free graphs
- Polynomial \(\chi \)-binding functions and forbidden induced subgraphs: a survey
- Vertex colouring and forbidden subgraphs -- a survey
- Excluding the fork and antifork
- A characterization of perfect graphs
- Radius two trees specify χ‐bounded classes
- On the structure of (banner, odd hole)‐free graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- A survey of χ‐boundedness
- Perfect divisibility and 2‐divisibility
- Independent Sets of Maximum Weight in Apple-Free Graphs
- A polynomial algorithm to find an independent set of maximum weight in a fork-free graph
- On the divisibility of graphs
This page was built for publication: Coloring graph classes with no induced fork via perfect divisibility
