Effective computation of immersion obstructions for unions of graph classes

DOI10.1007/978-3-642-31155-0_15MaRDI QIDQ6826475zbMATH OpenFDO

Authors Archontia C. Giannopoulou, Iosif Salem, Dimitris Zoros

Publication date 14 August 2012

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

zbMATH Keywords

obstructionstree-widthimmersionsunique linkage theorem

Mathematics Subject Classification ID

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

This page was built for publication: Effective computation of immersion obstructions for unions of graph classes

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