Approximate realizations for outerplanaric degree sequences
From MaRDI portal
Publication:6655667
DOI10.1016/j.jcss.2024.103588MaRDI QIDQ6655667
Yingli Ran, Dror Rawitz, Amotz Bar-Noy, Toni Böhnlein, David Peleg
Publication date: 27 December 2024
Published in: Journal of Computer and System Sciences (Search for Journal in Brave)
Planar graphs; geometric and topological aspects of graph theory (05C10) Vertex degrees (05C07) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The book thickness of a graph
- An unresolved conjecture on nonmaximal planar graphical sequences
- Characterizations of outerplanar graphs
- The theory of regular graphs
- Planar bipartite biregular degree sequences
- Sur un nouvel invariant des graphes et un critère de planarité. (On a new graph invariant and a planarity criterion)
- On dominating sets of maximal outerplanar graphs
- A remark on the existence of finite graphs
- A Characterization of the degree sequences of 2-trees
- Sequences Characterizing k-Trees
- Graphic sequences of trees and a problem of Frobenius
- On Realizability of a Set of Integers as Degrees of the Vertices of a Linear Graph. I
- Minimum dominating cycles in 2-trees
- On a conjecture on maximal planar sequences
- On Planar Graphical Degree Sequences
- On Certain Polyhedra
- Stack and queue number of 2-trees
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 Q6655667)