Algorithm for finding structures and obstructions of tree ideals

DOI10.1016/J.DISC.2005.12.054MaRDI QIDQ2370450zbMATH OpenOpenAlexFDO

Authors 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 algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10)

Review text

The title of the article completely reflects its content.

Cites work

• Algorithm for finding structures and obstructions of tree ideals
• Graph minors. IV: Tree-width and well-quasi-ordering
• scientific article; zbMATH DE number 475613 (Why is no real title available?)
• scientific article; zbMATH DE number 3198033 (Why is no real title available?)
• On structural descriptions of lower ideals of trees
• Well-Quasi-Ordering, The Tree Theorem, and Vazsonyi's Conjecture

Cited in

(3)

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

This page was built for publication: Algorithm for finding structures and obstructions of tree ideals

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