Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count.

Eppstein, David (2017) Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count. In: Graph Drawing and Network Visualization. GD 2017, September 25-27 , pp. 506-516(Official URL: https://doi.org/10.1007/978-3-319-73915-1_39).

Full text not available from this repository.

Abstract

We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D=Ω(n‾√), and at most min(2n−Ω(n‾√),2n−D−2)edges.

Item Type: Conference Paper
Classifications: P Styles > P.540 Planar
Z Theory > Z.250 Geometry
Z Theory > Z.750 Topology
URI: http://gdea.informatik.uni-koeln.de/id/eprint/1627

Actions (login required)

View Item View Item