Growing Without Cloning

DOI10.1137/100817255zbMath1248.05170OpenAlexW2089755531MaRDI QIDQ2910955

Maria Chudnovsky, P. D. 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

simplicial cliqueprime claw-free graph

Mathematics Subject Classification ID

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

Related Items (7)

Unnamed Item ⋮ Structure Theorem forU₅-free Tournaments ⋮ Deciding whether there are infinitely many prime graphs with forbidden induced subgraphs ⋮ Free fermions behind the disguise ⋮ A note on simplicial cliques ⋮ Indecomposable tournaments and their indecomposable subtournaments with six vertices ⋮ Simplicial Vertices in Graphs with no Induced Four-Edge Path or Four-Edge Antipath, and theH₆-Conjecture

This page was built for publication: Growing Without Cloning