scientific article; zbMATH DE number 6850320

MaRDI QIDQ4607888zbMATH OpenFDO

Authors Daniel Gonçalves, Lucas Isenmann, Claire Pennarun

Publication date 15 March 2018

Full work available at URL https://arxiv.org/abs/1707.08833, http://dl.acm.org/citation.cfm?id=3175278

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Graph representations (geometric and intersection representations, etc.) (05C62) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• On intersection representations of co-planar graphs
• On contact representations of directed planar graphs
• scientific article; zbMATH DE number 7683923
• Triangle-Free Planar Graphs and Segment Intersection Graphs
• scientific article; zbMATH DE number 1500690
• scientific article; zbMATH DE number 1019602
• scientific article; zbMATH DE number 475620
• PLANAR GRAPHS AND RELATED TOPICS
• On planar intersection graphs with forbidden subgraphs

Cited in

(36)

• On contact graphs of paths on a grid
• Topological inductive constructions for tight surface graphs
• Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
• Unit disk representations of embedded trees, outerplanar and multi-legged graphs
• Finding geometric representations of apex graphs is NP-hard
• Characterising circular-arc contact \(B_0\)-VPG graphs
• Subexponential algorithms for variants of the homomorphism problem in string graphs
• On grounded -graphs and their relatives
• Bounds on the bend number of split and cocomparability graphs
• Segment representations with small resolution
• scientific article; zbMATH DE number 1500690 (Why is no real title available?)
• scientific article; zbMATH DE number 1786520 (Why is no real title available?)
• The Liouville and the intersection properties are equivalent for planar graphs
• Not all planar graphs are in PURE-4-DIR
• Every planar graph is the intersection graph of segments in the plane (extended abstract)
• Homothetic triangle representations of planar graphs
• Shorter Labeling Schemes for Planar Graphs
• Computing maximum independent set on outerstring graphs and their relatives
• Optimality program in segment and string graphs
• scientific article; zbMATH DE number 7683923 (Why is no real title available?)
• \(B_0\)-VPG representation of AT-free outerplanar graphs
• Visibility representations of toroidal and Klein-bottle graphs
• Finding geometric representations of apex graphs is \textsf{NP}-hard
• Coloring triangle-free L-graphs with \(O (\log \log n)\) colors
• B0-VPG Representation of AT-free Outerplanar Graphs
• Recognizing geometric intersection graphs stabbed by a line
• Contact graphs of boxes with unidirectional contacts
• On tangencies among planar curves with an application to coloring L-shapes
• On tangencies among planar curves with an application to coloring L-shapes
• Dushnik-Miller dimension of stair contact complexes
• Coloring triangle-free L-graphs with O( n) colors
• 3-colorable planar graphs have an intersection segment representation using 3 slopes
• Compact distributed certification of geometric graph classes
• The bend number of cocomparability graphs
• Planar stories of graph drawings: algorithms and experiments
• CPG graphs: some structural and hardness results

This page was built for publication:

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