Rooted minor problems in highly connected graphs

DOI10.1016/J.DISC.2004.07.007MaRDI QIDQ1886348zbMATH OpenOpenAlexFDO

Authors Ken-ichi Kawarabayashi

Publication date 18 November 2004

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2004.07.007

zbMATH Keywords

connectivityrooted minor

Mathematics Subject Classification ID

Connectivity (05C40) Graph minors (05C83)

Recommendations

• Extremal results for rooted minor problems
• Extremal functions for rooted minors
• Disjoint complete minors and bipartite minors
• Linear connectivity forces large complete bipartite minors
• Rooted K₄-minors

Cites work

• scientific article; zbMATH DE number 1432797 (Why is no real title available?)
• An improved linear edge bound for graph linkages
• Any 7-chromatic graph has \(K_7\) or \(K_{4,4}\) as a minor
• Extremal results for rooted minor problems
• Forcing unbalanced complete bipartite minors
• Graph minors. IX: Disjoint crossed paths
• Graph minors. XIII: The disjoint paths problem
• Hadwiger's conjecture for \(K_ 6\)-free graphs
• Highly linked graphs
• Linear connectivity forces large complete bipartite minors
• On \(K_{s,t}\)-minors in graphs with given average degree
• The extremal function for noncomplete minors
• Vertex partitions of \(K_{4,4}\)-minor free graphs

Cited in

(8)

• Rooted K₄-minors
• Extremal results for rooted minor problems
• Linkless and flat embeddings in 3-space
• List-coloring graphs without \(K_{4,k}\)-minors
• Forcing a K_r minor by high external connectivity
• Erdős-Pósa property and its algorithmic applications: parity constraints, subset feedback set, and subset packing
• Extremal functions for rooted minors
• Note on coloring graphs without odd-\(K_k\)-minors

This page was built for publication: Rooted minor problems in highly connected graphs

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