Spanning cubic graph designs

Peter Adams,Hayri Ardal,Ján Maňuch,Vũ Dình Hòa,Moshe Rosenfeld,Ladislav Stacho

doi:10.1016/j.disc.2008.07.031

Spanning cubic graph designs

Peter Adams, Hayri Ardal + Show 4 more

https://doi.org/10.1016/j.disc.2008.07.031

Copy DOI

Journal: Discrete Mathematics	Publication Date: Aug 30, 2008
Citations: 13	License type: elsevier-specific: oa user license

Affiliation: University of Queensland, Simon Fraser University, Hanoi National University of Education, University of Washington Tacoma

#Cubic Graphs Of Order #Families Of Cubic Graphs + Show 8 more

Abstract
Full-Text PDF
Similar Papers

Abstract

Graph designs are natural extensions of BIBDs (balanced incomplete block designs). In this paper we explore spanning cubic graph designs and develop tools for constructing some of them. We show that K 16 can be decomposed into each of the 4060 connected cubic graphs of order 16, and into precisely 144 of the 147 disconnected cubic graphs of order 16. We also identify some infinite families of cubic graphs of order 6 n + 4 that decompose K 6 n + 4 .

Full Text