Square-contact representations of partial 2-trees and triconnected simply-nested graphs
From MaRDI portal
Publication:5136241
Recommendations
Cites work
- scientific article; zbMATH DE number 2182144 (Why is no real title available?)
- scientific article; zbMATH DE number 2123123 (Why is no real title available?)
- Contact Graphs of Circular Arcs
- Contact graphs of line segments are NP-complete
- Contact representations of planar graphs with cubes
- Equilateral L-contact graphs
- Finding Hamiltonian cycles in certain planar graphs
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
- Square tilings with prescribed combinatorics
- Triangle contact representations and duality
Cited in
(6)- Planar drawings with few slopes of Halin graphs and nested pseudotrees
- Combinatorial properties of triangle-free rectangle arrangements and the squarability problem
- Morphing triangle contact representations of triangulations
- Planar straight-line realizations of 2-trees with prescribed edge lengths
- Morphing Contact Representations of Graphs
- Testing the planar straight-line realizability of 2-trees with prescribed edge lengths
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)