An algorithm for the characterization of the nonplanarity of a maximal graphical partition

DOI10.1007/BF02576115zbMath0632.05023OpenAlexW2017049906MaRDI QIDQ1095148

B. George

Publication date: 1986

Published in: Calcolo (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02576115

zbMATH Keywords

algorithmtestingplanarityEuler maximal sequences

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Planar graphs; geometric and topological aspects of graph theory (05C10) Software, source code, etc. for problems pertaining to combinatorics (05-04)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the existence and connectivity of a class of maximal planar graphs
• Un metodo canonico di riduzione e costruzione relativo a grafi planari massimali
• On graphical partitions and planarity
• Some analogues of Eberhard's theorem on convex polytopes
• On the planarity of regular incidence sequences
• Numbers of cubic graphs
• On a conjecture on maximal planar sequences
• Efficient Planarity Testing
• On Planar Graphical Degree Sequences
• On the connectivity of maximal planar graphs

This page was built for publication: An algorithm for the characterization of the nonplanarity of a maximal graphical partition