3-colorable planar graphs have an intersection segment representation using 3 slopes

DOI10.1007/978-3-030-30786-8_27OpenAlexW2972810546MaRDI QIDQ2301556

Daniel Gonçalves

Publication date: 24 February 2020

Full work available at URL: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02407838/file/3DIR_Jul19_lncs.pdf

zbMATH Keywords

planar graphssegment intersections

Mathematics Subject Classification ID

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

Related Items (4)

Finding geometric representations of apex graphs is NP-hard ⋮ Enumeration of corner polyhedra and 3-connected Schnyder labelings ⋮ Finding geometric representations of apex graphs is \textsf{NP}-hard ⋮ Not all planar graphs are in PURE-4-DIR

This page was built for publication: 3-colorable planar graphs have an intersection segment representation using 3 slopes