On a conjecture on maximal planar sequences

DOI10.1002/JGT.3190040405MaRDI QIDQ3889101zbMATH OpenOpenAlexWikidataFDO

Authors Stefano Fanelli

Publication date 1980

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

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

zbMATH Keywords

maximal planar sequencesnonincreasingSchmeichel-Hakimiconjecture

Mathematics Subject Classification ID

Graph theory (05C99)

Cited in

(9)

• 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
• Graphs and degree sequences. I
• Approximate realizations for outerplanaric degree sequences
• Degree realization by bipartite cactus graphs
• Approximate realizations for outerplanaric degree sequences
• On key parameters affecting the realizability of degree sequences (invited paper)
• Sparse graphic degree sequences have planar realizations
• Degree realization by bipartite cactus graphs

This page was built for publication: On a conjecture on maximal planar sequences

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