The size of an intertwine

DOI10.1007/3-540-58201-0_95zbMath1422.68124OpenAlexW1581136047MaRDI QIDQ4632453

Jens Lagergren

Publication date: 29 April 2019

Published in: Automata, Languages and Programming (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/3-540-58201-0_95

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph minors (05C83) Graph operations (line graphs, products, etc.) (05C76)

Related Items (1)

Effective computation of immersion obstructions for unions of graph classes

Cites Work

• Unnamed Item
• Graph minors. XX: Wagner's conjecture
• Graph minors. XXI. graphs with unique linkages
• A Menger-like property of tree-width: The finite case
• Quickly excluding a forest
• Quickly excluding a planar graph
• Graph minors. XIII: The disjoint paths problem
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Easy problems for tree-decomposable graphs
• Solution to König's Graph Embedding Problem

This page was built for publication: The size of an intertwine