Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
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 (2n-( n),2n-D-2) edges.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.