Algorithm for finding structures and obstructions of tree ideals

DOI10.1016/j.disc.2005.12.054zbMath1122.68089OpenAlexW1974455605MaRDI QIDQ2370450

Yared Nigussie

Publication date: 26 June 2007

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2005.12.054

zbMATH Keywords

obstructionsstructure-treetree ideal

Mathematics Subject Classification ID

Trees (05C05) Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items

Algorithm for finding structures and obstructions of tree ideals, On structural descriptions of lower ideals of series parallel posets, Finite structure for Friedman ideals of finite trees

Cites Work

• Unnamed Item
• Unnamed Item
• Algorithm for finding structures and obstructions of tree ideals
• Graph minors. IV: Tree-width and well-quasi-ordering
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture
• On structural descriptions of lower ideals of trees