Square-free graphs with no induced fork
DOI10.37236/9144zbMATH Open1464.05146OpenAlexW3157320200MaRDI QIDQ831350FDOQ831350
Authors: Maria Chudnovsky, Shenwei Huang, T. Karthick, Jenny Kaufmann 
Publication date: 11 May 2021
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.37236/9144
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Title not available (Why is that?)
- Sur le coloriage des graphs
- The structure of claw-free graphs
- The Ramsey number R(3, t) has order of magnitude t2/log t
- Title not available (Why is that?)
- Vertex colouring and forbidden subgraphs -- a survey
- Radius two trees specify χ‐bounded classes
- Coloring quasi-line graphs
- Claw-free graphs. VI: Colouring
- On the chromatic number of \(2 K_2\)-free graphs
- Excluding the fork and antifork
Cited In (8)
- Perfect divisibility and coloring of some fork-free graphs
- \( \chi \)-binding function for \((C_4, t\text{-broom}^+)\)-free graphs
- Excluding the fork and antifork
- Polynomial algorithm for finding the largest independent sets in graphs without forks
- Coloring graph classes with no induced fork via perfect divisibility
- Square-Free Graphs with No Six-Vertex Induced Path
- On a class of square-free graphs
- Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs
This page was built for publication: Square-free graphs with no induced fork
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831350)
