The spectrum problem for the Petersen graph

DOI<link itemprop=identifier href="https://doi.org/10.1002/(SICI)1097-0118(199606)22:2<175::AID-JGT8>3.0.CO;2-K" /><175::AID-JGT8>3.0.CO;2-K 10.1002/(SICI)1097-0118(199606)22:2<175::AID-JGT8>3.0.CO;2-KzbMath0852.05072OpenAlexW4244744775MaRDI QIDQ4888110

Darryn E. Bryant, Peter J. Adams

Publication date: 23 July 1996

Full work available at URL: https://doi.org/10.1002/(sici)1097-0118(199606)22:2<175::aid-jgt8>3.0.co;2-k

zbMATH Keywords

spectrum problemPetersen graphdecompositon

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (4)

Petersen graph decompositions of complete multipartite graphs ⋮ A survey on the existence ofG-Designs ⋮ \(\alpha\)-labelings of a class of generalized Petersen graphs ⋮ The spectrum problem for the connected cubic graphs of order 10

This page was built for publication: The spectrum problem for the Petersen graph