Induced immersions

DOI10.1007/978-3-642-35261-4_33MaRDI QIDQ4909547zbMATH OpenOpenAlexFDO

Authors Rémy Belmonte, Pim Van 't Hof, Marcin Kamiński

Publication date 21 March 2013

Published in Algorithms and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-35261-4_33

zbMATH Keywords

graph operationsinduced immersionmultigraph

Mathematics Subject Classification ID

Graph operations (line graphs, products, etc.) (05C76) Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25)

Recommendations

• Packing and covering immersion models of planar subcubic graphs
• A weak immersion relation on graphs and its applications
• Packing and covering immersion-expansions of planar sub-cubic graphs
• Coloring immersion-free graphs
• On H‐immersions

Cited in

(6)

• Packing and covering immersion-expansions of planar sub-cubic graphs
• Packing and covering immersion models of planar subcubic graphs
• Graph editing to a fixed target
• BIMINIMAL IMMERSIONS
• Fast Algorithms forK4Immersion Testing
• Finding topological subgraphs is fixed-parameter tractable

This page was built for publication: Induced immersions

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