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