Linkage for the diamond and the path with four vertices

DOI10.1002/JGT.20612zbMATH Open1244.05128OpenAlexW2154239812MaRDI QIDQ2897205FDOQ2897205

Authors: Michael D. Plummer, Gexin Yu, M. N. Ellingham 

Publication date: 10 July 2012

Published in: Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jgt.20612

Recommendations

• Linking four vertices in graphs of large connectivity
• Linkages in Polytope Graphs
• On linkages in polytope graphs
• 4-path graphs: a generalization of line graphs
• 4-connected triangulations on few lines
• 4-connected triangulations on few lines
• On the four-vertex theorem
• scientific article; zbMATH DE number 1344978
• A chain theorem for 4-connected graphs
• Four-connected triangulations of planar point sets

zbMATH Keywords

linkagediamondplanar triangulationfour-vertex path

Mathematics Subject Classification ID

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

Cites Work

• Graph minors. XIII: The disjoint paths problem
• Homomorphieeigenschaften und mittlere Kantendichte von Graphen
• Disjoint paths in graphs
• 2-linked graphs
• An improved linear edge bound for graph linkages
• 4-connected maximal planar graphs are 4-ordered
• Survey of results on \(k\)-ordered graphs
• Highly linked graphs
• Eine Verallgemeinerung des \(n\)-fachen Zusammenhangs für Graphen
• On \(H\)-linked graphs
• On Minimum Degree Implying That a Graph is H‐Linked
• An extremal problem for H‐linked graphs
• Minimum degree conditions for \(H\)-linked graphs
• On Sufficient Degree Conditions for a Graph to be $k$-linked
• On the Existence of Certain Configurations within Graphs and the 1-Skeletons of Polytopes
• Subdivisions in planar graphs
• Disjoint paths in graphs. I: 3-planar graphs and basic obstructions
• Disjoint paths in graphs. II: A special case
• The extremal function for 3-linked graphs
• Ore‐type degree conditions for a graph to be H‐linked
• (3,3)-linked planar graphs
• Implications among linkage properties in graphs

Cited In (6)

• Rooted topological minors on four vertices
• Connectivity for Kite-Linked Graphs
• 7-connected graphs are 4-ordered
• Linking four vertices in graphs of large connectivity
• Combined degree and connectivity conditions for \(H\)-linked graphs
• Optimal connectivity for fat-triangle linkages

This page was built for publication: Linkage for the diamond and the path with four vertices

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