Drawing cubic graphs with at most five slopes

János Pach, Balázs Keszegh
2008
Article

Résumé

We show that every graph G with maximum degree three has a straight-line drawing in the plane using edges of at most five different slopes. Moreover, if G is connected and has at least one vertex of degree less than three, then four directions suffice.

Source officielle

https://infoscience.epfl.ch/record/129258?ln=fr

À propos de ce résultat

Cette page est générée automatiquement et peut contenir des informations qui ne sont pas correctes, complètes, à jour ou pertinentes par rapport à votre recherche. Il en va de même pour toutes les autres pages de ce site. Veillez à vérifier les informations auprès des sources officielles de l'EPFL.

Drawing cubic graphs with at most five slopes

A full characterization of invariant embeddability of unimodular planar graphs

Discovering Influencers in Opinion Formation Over Social Graphs

Better Trees for Santa Claus

A full characterization of invariant embeddability of unimodular planar graphs

Better Trees for Santa Claus

Discovering Influencers in Opinion Formation Over Social Graphs