On the connectivity of maximal planar graphs
From MaRDI portal
Publication:4194992
DOI10.1002/jgt.3190020404zbMath0408.05036OpenAlexW2117726738MaRDI QIDQ4194992
S. Louis Hakimi, Edward F. 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
Related Items (7)
An algorithm for the characterization of the nonplanarity of a maximal graphical partition ⋮ The minimum number of 4-cycles in a maximal planar graph with small number of vertices ⋮ An unresolved conjecture on nonmaximal planar graphical sequences ⋮ On the existence and connectivity of a class of maximal planar graphs ⋮ Graphs and degree sequences. I ⋮ An upper bound on Wiener indices of maximal planar graphs ⋮ An $O ( ( n\log p )^2 )$ Algorithm for the Continuous p-Center Problem on a Tree
Cites Work
This page was built for publication: On the connectivity of maximal planar graphs
