Optimizing regular edge labelings

DOI10.1007/978-3-642-18469-7_11zbMATH Open1314.68220OpenAlexW2138241286WikidataQ59782303 ScholiaQ59782303MaRDI QIDQ3073665FDOQ3073665

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

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

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)

Cited In (3)

• On the number of regular edge labelings
• 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)