Vertex Contact Representations of Paths on a Grid

DOI10.7155/jgaa.00380zbMath1328.05127OpenAlexW2396400610MaRDI QIDQ3460401

Stefan Felsner, Nieke Aerts

Publication date: 7 January 2016

Published in: Journal of Graph Algorithms and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7155/jgaa.00380

zbMATH Keywords

square gridinteriorly disjoint grid paths

Mathematics Subject Classification ID

Paths and cycles (05C38) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Density (toughness, etc.) (05C42)

Related Items (4)

CPG graphs: some structural and hardness results ⋮ VPG and EPG bend-numbers of Halin graphs ⋮ Characterising circular-arc contact \(B_0\)-VPG graphs ⋮ Sparse Graphs Are Near-Bipartite

This page was built for publication: Vertex Contact Representations of Paths on a Grid