Optimizing regular edge labelings

DOI10.1007/978-3-642-18469-7_11MaRDI QIDQ3073665zbMATH OpenOpenAlexWikidataFDO

Authors Kevin Buchin, Bettina Speckmann, Sander Verdonschot

Publication date 11 February 2011

Published in Graph Drawing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18469-7_11

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Enumeration in graph theory (05C30)

Recommendations

• Regular edge labeling of 4-connected plane graphs and its applications in graph drawing problems
• On the number of regular edge labelings
• Rectangular dualization and rectangular dissections
• Rectangular duals of planar graphs
• Transformations among rectangular partitions

Cited in

(4)

• On the number of regular edge labelings
• Combinatorics of rectangulations: old and new bijections
• Optimal identification of sets of edges using 2-factors
• Efficient enumeration of transversal edge-partitions

This page was built for publication: Optimizing regular edge labelings

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