On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs

DOI10.1007/BF01202470zbMath0794.05104OpenAlexW1995158928WikidataQ114234018 ScholiaQ114234018MaRDI QIDQ1323492

Midori Kobayashi, Gisaku Nakamura

Publication date: 16 August 1994

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01202470

zbMATH Keywords

symmetry groupscomplete bipartite graph1-factorizationcomplete graph1-factors

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Related Items (2)

Graphs that admit square 1-factorizations are hamiltonian Cayley graphs ⋮ Free nilpotent and \(H\)-type Lie algebras. Combinatorial and orthogonal designs

Cites Work

• One-factorizations of the complete graph—A survey
• Unnamed Item

This page was built for publication: On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs