A graph minor condition for graphs to be k-linked

DOI10.1016/J.EJC.2023.103874MaRDI QIDQ6146500zbMATH OpenOpenAlexFDO

Authors 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) Connectivity (05C40) Graph minors (05C83)

Recommendations

• Graph minors and linkages
• scientific article; zbMATH DE number 1439448
• Highly linked graphs
• scientific article; zbMATH DE number 6837054
• On Sufficient Degree Conditions for a Graph to be k-linked

Cites work

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

Cited in

(1)

• Linkages and removable paths avoiding vertices

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

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