(3,3)-linked planar graphs

DOI10.1016/J.DISC.2007.09.013MaRDI QIDQ2519842zbMATH OpenOpenAlexFDO

Authors Ryuichi Mori

Publication date 27 January 2009

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2007.09.013

zbMATH Keywords

(3,3)-linkedplanar graphtriangulation

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10)

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

Cites work

• 4-connected maximal planar graphs are 4-ordered
• Graph minors and linkages

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)