Nearly Planar Graphs and {\lambda}-flat Graphs - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Preprints, Working Papers, ... Year : 2013

Nearly Planar Graphs and {\lambda}-flat Graphs


A graph G is {\xi}-nearly planar if it can be embedded in the sphere so that each of its edges is crossed at most {\xi} times. The family of {\xi}-nearly planar graphs is widely extending the notion of planarity. We introduce an alternative parameterized graph family extending the notion of planarity, the {\lambda}-flat graphs, this time defined as powers of plane graphs in regard to a novel notion of distance, the wall-by-wall distance. We show that the two parameterized graph classes are parametrically equivalent.

Dates and versions

lirmm-00904543 , version 1 (14-11-2013)


  • HAL Id : lirmm-00904543 , version 1
  • ARXIV : 1311.0137


Alexander Grigoriev, Athanassios Koutsonas, Dimitrios M. Thilikos. Nearly Planar Graphs and {\lambda}-flat Graphs. 2013. ⟨lirmm-00904543⟩
122 View
0 Download



Gmail Mastodon Facebook X LinkedIn More