(3,3)-linked planar graphs
From MaRDI portal
A graph \(G\) is \((m,n)\)-linked if for any two disjoint subsets \(R,B\subseteq V(G)\) with \(| R| \leq m\) and \(| B|\leq n,\) \(G\) has two disjoint connected subgraphs containing \(R\) and \(B,\) respectively. The author shows that a planar graph with at least six vertices is \((3,3)\)-linked if and only if \(G\) is \(4\)-connected and maximal. A corollary states that if a planar graph \(G\) with at least six vertices is \((3,3)\)-linked, then \(G\) is \(4\)-ordered.
Recommendations
- Planar 3-path graphs.
- Characterizing 3-connected planar graphs and graphic matroids
- On 3-simplicial vertices in planar graphs
- Connected spanning subgraphs of 3-connected planar graphs
- scientific article; zbMATH DE number 3918400
- A note on 3-connected cubic planar graphs
- scientific article; zbMATH DE number 1750097
- A direct decomposition of 3-connected planar graphs
- On 3^*-connected graphs
- The number of polyhedral (3-connected planar) graphs
Cited in
(7)- Characterization of \((m, n)\)-linked planar graphs
- The lune-free link graphs with 10-vertices
- Linkage for the diamond and the path with four vertices
- 3-Connected Cores In Random Planar Graphs
- 3-connected Planar Graph Isomorphism is in Log-space
- scientific article; zbMATH DE number 2217711 (Why is no real title available?)
- Linkages and removable paths avoiding vertices
This page was built for publication: (3,3)-linked planar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2519842)
