Polycyclic configurations

Authors:
M. Boben;T. Pisanski
Affiliations:
Univerza v Ljubljani, IMFM, Jadranska 19, 1000, Ljubljana, Slovenia;Univerza v Ljubljani, IMFM, Jadranska 19, 1000, Ljubljana, Slovenia
Venue:
European Journal of Combinatorics
Year:
2003

Citing 3
Cited 4

Topological graph theory

Topological graph theory
Computational algebraic geometry of projective configurations

Journal of Symbolic Computation
Weekly flag-transitive configurations and half-arc-transitive graphs

European Journal of Combinatorics

The genus of the GRAY graph is 7

European Journal of Combinatorics - Special issue: Topological graph theory II
Musings on an example of Danzer's

European Journal of Combinatorics
On the computational complexity of degenerate unit distance representations of graphs

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Locally arc-transitive graphs of valence {3,4} with trivial edge kernel

Journal of Algebraic Combinatorics: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

Polycyclic configurations constitute a generalization of the well-known class of cyclic configurations. They admit a concise description via voltage graphs over cyclic groups. Polycyclic (v k ) configurations are considered for k = 2, 3, 4. The structure of polycyclic configurations can be used in some cases to generate a rotational straight-line drawing of such configurations in the Euclidean plane.