Square-free graphs with no induced fork

DOI10.37236/9144MaRDI QIDQ831350zbMATH OpenOpenAlexFDO

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)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.37236/9144

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

graph structureforbidden induced subgraphforkantifork

Mathematics Subject Classification ID

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

Recommendations

• Coloring graph classes with no induced fork via perfect divisibility
• scientific article; zbMATH DE number 6612817
• Claw-free graphs. VI: Colouring
• Excluding the fork and antifork
• scientific article; zbMATH DE number 2186978

Cites work

• scientific article; zbMATH DE number 3747156 (Why is no real title available?)
• scientific article; zbMATH DE number 4183452 (Why is no real title available?)
• Claw-free graphs. VI: Colouring
• Coloring quasi-line graphs
• Excluding the fork and antifork
• On the chromatic number of \(2 K_2\)-free graphs
• Radius two trees specify χ‐bounded classes
• Sur le coloriage des graphs
• The Ramsey number R(3, t) has order of magnitude t²/log t
• The structure of claw-free graphs
• Vertex colouring and forbidden subgraphs -- a survey

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)