The plane-width of graphs
From MaRDI portal
Publication:3096959
DOI10.1002/jgt.20554zbMath1232.05144arXiv0812.4346OpenAlexW3103770313MaRDI QIDQ3096959
Martin Milanič, Paul Medvedev, Marcin Kaminski
Publication date: 15 November 2011
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/0812.4346
circular chromatic numberchromatic numberrealization of a graphplane-widthpacking non-overlapping unit discs
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Distance in graphs (05C12) Graph representations (geometric and intersection representations, etc.) (05C62) Euclidean analytic geometry (51N20)
Related Items
Minimal classes of graphs of unbounded clique-width defined by finitely many forbidden induced subgraphs ⋮ Dilation coefficient, plane-width, and resolution coefficient of graphs ⋮ On the Plane-Width of Graphs
Cites Work
- Realizability of graphs
- Distinct distances in graph drawings
- Small universal covers for sets of unit diameter
- Minimal diameter of certain sets in the plane
- Dense packings of congruent circles in a circle
- New sets with large Borsuk numbers
- On extremal finite packings
- The minimum diameter octagon with unit-length sides: Vincze's wife's octagon is suboptimal
- A counterexample to Borsuk’s conjecture
- Graph Theory and Probability
- Star chromatic number
- Geometrical Extrema Suggested by a Lemma of Besicovitch
- Covering a Three-Dimensional set with Sets of Smaller Diameter
- The chromatic number of random graphs
- Circular chromatic number: A survey
