Mineurs d'arbres avec racines

DOI10.1051/ita/1995290504011zbMath0838.68083OpenAlexW1582486436MaRDI QIDQ4858839

A. Pariès

Publication date: 27 May 1996

Published in: RAIRO - Theoretical Informatics and Applications (Search for Journal in Brave)

Full work available at URL: https://eudml.org/doc/92515

zbMATH Keywords

NP-completeness

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)

Cites Work

• Graph minors. XX: Wagner's conjecture
• Forbidden minors characterization of partial 3-trees
• Graph minors. I. Excluding a forest
• On the complexity of finding iso- and other morphisms for partial \(k\)- trees
• Graph minors. XIII: The disjoint paths problem
• Graph minors. II. Algorithmic aspects of tree-width
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Mineurs d'arbres avec racines