Approximate realizations for outerplanaric degree sequences

DOI10.1007/978-3-031-63021-7_8MaRDI QIDQ7021104zbMATH OpenFDO

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

Publication date 28 February 2025

Full work available at URL https://doi.org/10.1007/978-3-031-63021-7_8

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68Rxx) Algorithms in computer science (68Wxx)

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
• Characterizations of outerplanar graphs
• 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?)
• Minimum dominating cycles in 2-trees
• On a conjecture on maximal planar sequences
• On Certain Polyhedra
• On dominating sets of maximal outerplanar graphs
• 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.
• Planar bipartite biregular degree sequences
• Sequences Characterizing k-Trees
• Stack and queue number of 2-trees
• The book thickness of a graph

Cited in

(2)

• On key parameters affecting the realizability of degree sequences (invited paper)
• Sparse graphic degree sequences have planar realizations

This page was built for publication: Approximate realizations for outerplanaric degree sequences

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