Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

From MaRDI portal
Publication:1128998
Jump to:navigation, search

DOI10.1016/S0020-0190(98)00046-5zbMath0925.68337OpenAlexW2062419675MaRDI QIDQ1128998

Evangelos Kranakis, Jorge Urrutia, Jurek Czyzowicz

Publication date: 13 August 1998

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0020-0190(98)00046-5


zbMATH Keywords

ContactOrthogonalLine segmentsBipartitePlanar


Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10)


Related Items (8)

Contact Representations of Graphs in 3D ⋮ Drawings of planar graphs with few slopes and segments ⋮ Cooperative mobile guards in grids ⋮ \(B_0\)-VPG representation of AT-free outerplanar graphs ⋮ B0-VPG Representation of AT-free Outerplanar Graphs ⋮ Not all planar graphs are in PURE-4-DIR ⋮ Packing \([1, \Delta \)-factors in graphs of small degree] ⋮ Global Curve Simplification



Cites Work

  • A left-first search algorithm for planar graphs




This page was built for publication: A simple proof of the representation of bipartite planar graphs as the contact graphs of orthogonal straight line segments

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1128998&oldid=13180891"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 31 January 2024, at 03:24.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki