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

DOI10.1002/JCD.997zbMATH Open0992.05058OpenAlexW1999310616WikidataQ114236262 ScholiaQ114236262MaRDI QIDQ4534384FDOQ4534384

Authors:

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

one-factorizationconiccomplete multigraph

Mathematics Subject Classification ID

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

Cites Work

• 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)\)
• Constructing indecomposable 1-factorizations of the complete multigraph

Cited In (5)

• One-factorisations of complete graphs arising from ovals in finite planes
• One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders
• On circular--linear one-factorizations of the complete graph
• Indecomposable 1-factorizations of the complete multigraph \(\lambda K_{2n}\) for every \(\lambda \leq 2n\)
• One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane

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

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