Growing without cloning

DOI10.1137/100817255MaRDI QIDQ2910955zbMATH OpenOpenAlexFDO

Authors Maria Chudnovsky, Paul Seymour

Publication date 12 September 2012

Published in SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://semanticscholar.org/paper/4eae14f9d6bbe34e173b71bc2ae5bb0788c28f2b

zbMATH Keywords

prime claw-free graphsimplicial clique

Mathematics Subject Classification ID

Structural characterization of families of graphs (05C75) Graph algorithms (graph-theoretic aspects) (05C85)

Recommendations

• The structure of claw-free graphs
• Claw-free graphs. I: Orientable prismatic graphs
• Claw-free graphs. IV: Decomposition theorem
• Claw-free graphs. II: Non-orientable prismatic graphs
• Clique or hole in claw-free graphs

Cited in

(7)

• Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs
• A note on simplicial cliques
• Free fermions behind the disguise
• Indecomposable tournaments and their indecomposable subtournaments with six vertices
• Structure theorem for \(U_{5}\)-free tournaments
• Recognizing indecomposability for tournaments
• Simplicial vertices in graphs with no induced four-edge path or four-edge antipath, and the \(H_{6}\)-conjecture

This page was built for publication: Growing without cloning

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2910955)