Square-contact representations of partial 2-trees and triconnected simply-nested graphs
From MaRDI portal
Publication:5136241
DOI10.4230/LIPICS.ISAAC.2017.24zbMATH Open1461.05146arXiv1710.00426MaRDI QIDQ5136241FDOQ5136241
Authors:
Publication date: 25 November 2020
Full work available at URL: https://arxiv.org/abs/1710.00426
Recommendations
Trees (05C05) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)
Cites Work
- Title not available (Why is that?)
- Square tilings with prescribed combinatorics
- Equilateral L-contact graphs
- Title not available (Why is that?)
- Contact representations of planar graphs with cubes
- Triangle contact representations and duality
- Finding Hamiltonian cycles in certain planar graphs
- Contact Graphs of Circular Arcs
- Contact graphs of line segments are NP-complete
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
Cited In (6)
- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
- Morphing Contact Representations of Graphs
- Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Morphing triangle contact representations of triangulations
Uses Software
This page was built for publication: Square-contact representations of partial 2-trees and triconnected simply-nested graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136241)
