Square-free graphs with no induced fork

DOI10.37236/9144zbMath1464.05146OpenAlexW3157320200MaRDI QIDQ831350

Shenwei Huang, T. Karthick, Jenny Kaufmann, Maria Chudnovsky

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

zbMATH Keywords

graph structureforbidden induced subgraphforkantifork

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Coloring graph classes with no induced fork via perfect divisibility ⋮ Polynomial \(\chi\)-binding functions for \(t\)-broom-free graphs

Cites Work

• Claw-free graphs. VI: Colouring
• On the chromatic number of \(2 K_2\)-free graphs
• Vertex colouring and forbidden subgraphs -- a survey
• Excluding the fork and antifork
• Coloring quasi-line graphs
• Radius two trees specify χ‐bounded classes
• The Ramsey number R(3, t) has order of magnitude t²/log t
• Sur le coloriage des graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Square-free graphs with no induced fork