Reductions of (v₃) configurations

Publication date 8 May 2005

Graph algorithms (graph-theoretic aspects) (05C85) Graph theory (including graph drawing) in computer science (68R10) Graph representations (geometric and intersection representations, etc.) (05C62)

Abstract: Cubic bipartite graphs with girth at least 6 correspond to symmetric combinatorial (v_3) configurations. In 1887 V. Martinetti described a simple reduction method which enables one to reduce each combinatorial (v_3) configuration to one from the infinite set of so-called irreducible configurations. The aim of this paper is to show that a slightly extended set of reductions enables one to reduce each combinatorial (v_3) configuration either to the Fano configuration or to the Pappus configuration.

This page was built for publication: Reductions of (v_3) configurations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6475482)