A graph minor condition for graphs to be \(k\)-linked

DOI10.1016/j.ejc.2023.103874OpenAlexW4388795935MaRDI QIDQ6146500

Shun-ichi Maezawa

Publication date: 5 February 2024

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2023.103874

zbMATH Keywords

\(k\)-linked graphsfoundational subgraphs

Mathematics Subject Classification ID

Paths and cycles (05C38) Graph minors (05C83) Connectivity (05C40)

Cites Work

• The extremal function for 3-linked graphs
• Disjoint paths in graphs
• 2-linked graphs
• An improved linear edge bound for graph linkages
• Graph minors. XIII: The disjoint paths problem
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• Highly linked graphs
• A Polynomial Solution to the Undirected Two Paths Problem
• Graph minors and linkages
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes

This page was built for publication: A graph minor condition for graphs to be \(k\)-linked