The structure of graphs not admitting a fixed immersion
type: Item
instance of: scholarly article
title: The structure of graphs not admitting a fixed immersion
zbMATH Open document ID: 1302.05148
author: Paul Wollan
published in: Journal of Combinatorial Theory. Series B
publication date: 2014-11-21T00:00:00Z
full work available at URL: https://arxiv.org/abs/1302.3867
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C05
zbMATH DE Number: 6371811
zbMATH Keywords: immersion
zbMATH Keywords: edge disjointness
zbMATH Keywords: tree decompositions
zbMATH Keywords: tree-cut decompositions
MaRDI profile type: Publication
OpenAlex ID: W2074101363
arXiv ID: 1302.3867
cites work: Graph Coloring and the Immersion Order
cites work: Graphs with small bandwidth and cutwidth
cites work: A note on forbidding clique immersions
cites work: A minimum degree condition forcing complete graph immersion
cites work: Immersing small complete graphs
cites work: On Well-Partial-Order Theory and Its Application to Combinatorial Problems of VLSI Design
cites work: On H‐immersions
cites work: Linear connectivity forces large complete bipartite minors: an alternative approach
cites work: Q4198056
cites work: Forbidding Kuratowski Graphs as Immersions
cites work: Cutwidth of Split Graphs and Threshold Graphs
cites work: Q5743487
cites work: Q3829569
cites work: Q5734436
cites work: Polynomial treewidth forces a large grid-like-minor
cites work: Graph minors. V. Excluding a planar graph
cites work: Graph minors XXIII. Nash-Williams' immersion conjecture
cites work: Call routing and the ratcatcher
cites work: Cutwidth I: A linear time fixed parameter algorithm
cites work: Cutwidth II: Algorithms for partial w-trees of bounded degree
cites work: A polynomial algorithm for the min-cut linear arrangement of trees
DOI: 10.1016/J.JCTB.2014.07.003
description: scientific article