1 research outputs found

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

    Full text link
    We show that triangle-free penny graphs have degeneracy at most two, list coloring number (choosability) at most three, diameter D=Ω(n)D=\Omega(\sqrt n), and at most min(2nΩ(n),2nD2)\min\bigl(2n-\Omega(\sqrt n),2n-D-2\bigr) edges.Comment: 10 pages, 2 figures. To appear at the 25th International Symposium on Graph Drawing and Network Visualization (GD 2017
    corecore