A weak immersion relation on graphs and its applications
From MaRDI portal
Publication:5931419
DOI10.1016/S0012-365X(00)00080-7zbMath0964.05065MaRDI QIDQ5931419
Rajeev Govindan, Siddharthan Ramachandramurthi
Publication date: 8 July 2001
Published in: Discrete Mathematics (Search for Journal in Brave)
Graph theory (including graph drawing) in computer science (68R10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Constructing Graphs with No Immersion of Large Complete Graphs ⋮ Splitter theorems for 4-regular graphs ⋮ Cutwidth: obstructions and algorithmic aspects ⋮ Linear Kernels for Edge Deletion Problems to Immersion-Closed Graph Classes ⋮ Lean Tree-Cut Decompositions: Obstructions and Algorithms