Dilation coefficient, plane-width, and resolution coefficient of graphs
From MaRDI portal
Publication:1950340
DOI10.1007/s00605-013-0482-5zbMath1378.05140arXiv1001.0330OpenAlexW2003717906MaRDI QIDQ1950340
Arjana Žitnik, Martin Milanič, Tomaž Pisanski
Publication date: 13 May 2013
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1001.0330
bandwidthcircular chromatic numberchromatic numbergraph drawinggraph representationdilation coefficientplane-widthresolution coefficient
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- MAX-CUT and MAX-BISECTION are NP-hard on unit disk graphs
- Minimal diameter of certain sets in the plane
- Unit disk graph recognition is NP-hard
- On extremal finite packings
- On the Plane-Width of Graphs
- ALL GENERALIZED PETERSEN GRAPHS ARE UNIT-DISTANCE GRAPHS
- The plane-width of graphs
- Automatic Domain Partitioning in Three Dimensions
- Star chromatic number
- Geometrical Extrema Suggested by a Lemma of Besicovitch
- Circular chromatic number: A survey
- Models and approximation algorithms for channel assignment in radio networks
This page was built for publication: Dilation coefficient, plane-width, and resolution coefficient of graphs