On the connectivity of maximal planar graphs

DOI10.1002/JGT.3190020404MaRDI QIDQ4194992zbMATH OpenOpenAlexFDO

Authors S. Louis Hakimi, E. Schmeichel

Publication date 1978

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

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

zbMATH Keywords

ConnectivityMaximal Planar Graphs

Mathematics Subject Classification ID

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

Cited in

(8)

• An algorithm for the characterization of the nonplanarity of a maximal graphical partition
• On the existence and connectivity of a class of maximal planar graphs
• An upper bound on Wiener indices of maximal planar graphs
• The minimum number of 4-cycles in a maximal planar graph with small number of vertices
• An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
• An unresolved conjecture on nonmaximal planar graphical sequences
• Graphs and degree sequences. I
• On the biplanarity of blowups

This page was built for publication: On the connectivity of maximal planar graphs

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