Skip to main content
Conference ProceedingsOPEN ACCESS

Triangle-free penny graphs: Degeneracy, Choosability, and edge count

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 10692 LNCS 506-513
DOI: 10.1007/978-3-319-73915-1_39
3Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.

This article is free to access.

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.

Cite

CITATION STYLE

APA

Eppstein, D. (2018). Triangle-free penny graphs: Degeneracy, Choosability, and edge count. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10692 LNCS, pp. 506–513). Springer Verlag. https://doi.org/10.1007/978-3-319-73915-1_39

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free