A New Approach for Contact Graph Representations and Its Applications

DOI10.1007/978-3-319-21840-3_14zbMath1444.68140OpenAlexW1659804208MaRDI QIDQ3449814

Hsu-Chun Yen, Yi-Jun Chang

Publication date: 30 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-21840-3_14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62) Parameterized complexity, tractability and kernelization (68Q27)

Related Items (1)

Area-universal drawings of biconnected outerplane graphs

Cites Work

• Unnamed Item
• Fundamentals of parameterized complexity
• Straight line triangle representations
• Barycentric systems and stretchability
• Optimal polygonal representation of planar graphs
• The monadic second-order logic of graphs. I: Recognizable sets of finite graphs
• Table Cartograms
• Strongly-Connected Outerplanar Graphs with Proper Touching Triangle Representations
• On Touching Triangle Graphs
• Touching Triangle Representations for 3-Connected Planar Graphs
• Computing cartograms with optimal complexity

This page was built for publication: A New Approach for Contact Graph Representations and Its Applications