Finding Minors in Graphs with a Given Path Structure
type: Item
instance of: scholarly article
title: Finding Minors in Graphs with a Given Path Structure
zbMATH Open document ID: 1312.05129
author: André Kündgen
author: Michael J. Pelsmajer
author: Radhika Ramamurthi
published in: Journal of Graph Theory
publication date: 2015-05-22T00:00:00Z
full work available at URL: https://arxiv.org/abs/1207.6141
Mathematics Subject Classification ID: 05C83
zbMATH DE Number: 6439461
zbMATH Keywords: graph minors
zbMATH Keywords: schemes
zbMATH Keywords: immersions
MaRDI profile type: MaRDI publication profile
OpenAlex ID: W1527738996
arXiv ID: 1207.6141
cites work: Knots and links in spatial graphs
cites work: Graph Minors and Reliable Single Message Transmission
cites work: Removing even crossings
cites work: Hadwiger's conjecture for \(K_ 6\)-free graphs
cites work: Toward a theory of crossing numbers
DOI: 10.1002/JGT.21812
Recommended article: On finding Min-Min disjoint paths
Recommended article: Q4949780
Recommended article: Graph minors. XIII: The disjoint paths problem
Recommended article: Graph minors and linkages
Recommended article: Q3684139
Recommended article: Q3139528
Recommended article: Finding Contractions and Induced Minors in Chordal Graphs via Disjoint Paths
Recommended article: Minimum Degree and Dominating Paths
Recommended article: On Finding Minimal Two-Connected Subgraphs
Recommended article: Q3689215
description: scientific article; zbMATH DE number 6439461