One‐factorizations of complete multigraphs and quadrics in PG(n,q)

DOI10.1002/JCD.997zbMath0992.05058OpenAlexW1999310616WikidataQ114236262 ScholiaQ114236262MaRDI QIDQ4534384

No author found.

Publication date: 30 August 2002

Published in: Journal of Combinatorial Designs (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/jcd.997

zbMATH Keywords

conicone-factorizationcomplete multigraph

Mathematics Subject Classification ID

Combinatorial aspects of finite geometries (05B25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (5)

One-factorisations of complete graphs arising from ovals in finite planes ⋮ One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane ⋮ Indecomposable 1‐factorizations of the complete multigraph for every ⋮ One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders ⋮ On circular--linear one-factorizations of the complete graph

Cites Work

• Constructing indecomposable 1-factorizations of the complete multigraph
• 1-factorizations of complete multigraphs arising from finite geometry
• One-factorizations of complete multigraphs arising from maximal \((k;n)\)-arcs in PG\((2,2^h)\)

This page was built for publication: One‐factorizations of complete multigraphs and quadrics in PG(n,q)