Sparse graphic degree sequences have planar realizations

DOI10.4230/LIPICS.MFCS.2024.18MaRDI QIDQ7241016zbMATH OpenFDO

Authors Amotz Bar-Noy, Toni Böhnlein, David Peleg, Yingli Ran, Dror Rawitz

Publication date 12 May 2026

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://doi.org/10.4230/LIPICS.MFCS.2024.18

zbMATH Keywords

degree sequencesgraph algorithmsgraph realizationplanar graphs

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A characterization of the degree sequences of 2-trees
• A remark on the existence of finite graphs
• An unresolved conjecture on nonmaximal planar graphical sequences
• Approximate realizations for outerplanaric degree sequences
• Graphic sequences of trees and a problem of Frobenius
• scientific article; zbMATH DE number 3169205 (Why is no real title available?)
• scientific article; zbMATH DE number 3811626 (Why is no real title available?)
• scientific article; zbMATH DE number 3743297 (Why is no real title available?)
• scientific article; zbMATH DE number 3752901 (Why is no real title available?)
• On a conjecture on maximal planar sequences
• On Certain Polyhedra
• On Planar Graphical Degree Sequences
• On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
• On the degree sequences of maximal outerplanar graphs.
• On the existence of N‐connected graphs with prescribed degrees (n ≧ 2)
• Planar bipartite biregular degree sequences
• The book thickness of a graph
• Vertex degrees in outerplanar graphs

Cited in

(1)

• Degree realization by bipartite cactus graphs

This page was built for publication: Sparse graphic degree sequences have planar realizations

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