Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
From MaRDI portal
Publication:4625139
DOI10.1007/978-3-319-73915-1_39zbMath1504.05240arXiv1708.05152OpenAlexW2962868526MaRDI QIDQ4625139
Publication date: 20 February 2019
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1708.05152
Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12)
Related Items
Harmonic functions of polynomial growth on infinite penny graphs, On arrangements of orthogonal circles, Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count, Discrete harmonic functions on infinite penny graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Densities of minor-closed graph families
- On the maximum number of edges in quasi-planar graphs
- New bounds on the maximum number of edges in \(k\)-quasi-planar graphs
- Colorings and orientations of graphs
- Graphs drawn with few crossings per edge
- On the independence number of minimum distance graphs
- Quasi-planar graphs have a linear number of edges
- A short list color proof of Grötzsch's theorem
- A not 3-choosable planar graph without 3-cycles
- Combinatorial Properties of Triangle-Free Rectangle Arrangements and the Squarability Problem
- Realization of Simply Connected Polygonal Linkages and Recognition of Unit Disk Contact Trees
- 3-Choosability of Triangle-Free Planar Graphs with Constraints on 4-Cycles
- Combinatorics and Geometry of Finite and Infinite Squaregraphs
- Contact Graphs of Circular Arcs
- On Triangle Contact Graphs
- Triangle-Free Penny Graphs: Degeneracy, Choosability, and Edge Count
- On the Density of Maximal 1-Planar Graphs
- Rectangular layouts and contact graphs
- Representing graphs by disks and balls (a survey of recognition-complexity results)
- Contact graphs of line segments are NP-complete
