Planar graphs have 1-string representations

DOI10.1007/S00454-009-9196-9MaRDI QIDQ2380780zbMATH OpenOpenAlexFDO

Authors J. Chalopin, Daniel Gonçalves, Pascal Ochem

Publication date 12 April 2010

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-009-9196-9

zbMATH Keywords

planar graphsstrings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62)

Cites work

• scientific article; zbMATH DE number 1341903 (Why is no real title available?)
• scientific article; zbMATH DE number 739017 (Why is no real title available?)
• A theorem on graphs
• Edge partition of planar sraphs into two outerplanar graphs
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Intersection graphs of curves in the plane
• On grid intersection graphs
• Representations by contact and intersection of segments
• Triangle-Free Planar Graphs and Segment Intersection Graphs

Cited in

(8)

• An infinite sequence of non-realizable weavings
• Finding geometric representations of apex graphs is NP-hard
• scientific article; zbMATH DE number 6381690 (Why is no real title available?)
• Order-preserving 1-string representations of planar graphs
• Maximum independent set on \(B_1\)-VPG graphs
• Unit disk representations of embedded trees, outerplanar and multi-legged graphs
• Shorter Labeling Schemes for Planar Graphs
• Finding geometric representations of apex graphs is \textsf{NP}-hard

This page was built for publication: Planar graphs have 1-string representations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2380780)