scientific article; zbMATH DE number 4094810

MaRDI QIDQ3821580zbMATH OpenFDO

Authors J. Nešetřil, Robin Thomas, Jiří Matoušek

Publication date 1988

zbMATH Keywords

branch-widthinduced-minorminorseries-parallel graphstree-widthwell-quasi-ordering

Mathematics Subject Classification ID

Graph theory (05C99) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• The complexity of induced minors and related problems
• scientific article; zbMATH DE number 3891421
• scientific article; zbMATH DE number 475588
• Fast minor testing in planar graphs
• Detecting induced star-like minors in polynomial time

Cited in

(17)

• String graphs. II: Recognizing string graphs is NP-hard
• String graphs. I: The number of critical nonstring graphs is infinite
• The complexity of induced minors and related problems
• Well quasi orders in subclasses of bounded treewidth graphs and their algorithmic applications
• Decidability of string graphs
• Hypertree-depth and minors in hypergraphs
• Detecting induced star-like minors in polynomial time
• Lift-contractions
• Lift contractions
• The complexity of minor-ancestral graph properties with forbidden pairs
• Recent progress on well-quasi-ordering graphs
• scientific article; zbMATH DE number 3891421 (Why is no real title available?)
• scientific article; zbMATH DE number 475588 (Why is no real title available?)
• Recognizing string graphs in NP
• Excluding an induced wheel minor in graphs without large induced stars
• String graph obstacles of high girth and of bounded degree
• Minimal universal and dense minor closed classes

This page was built for publication:

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