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.
Official URL: https://doi.org/10.1007/978-3-319-73915-1_39
AbstractWe 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.
Actions (login required)
|