Kotzig Factorizations: Existence and Computational Results

DOI10.1016/S0304-0208(08)73492-3MaRDI QIDQ4745850zbMATH OpenOpenAlexFDO

Authors Charles J. Colbourn, Eric Mendelsohn

Publication date 1982

Published in Theory and Practice of Combinatorics - A collection of articles honoring Anton Kotzig on the occasion of his sixtieth birthday (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/s0304-0208(08)73492-3

zbMATH Keywords

1-factorizationHamiltonian decompositionHowell designsKirkman triple systemsnear 1-factorroom squares

Mathematics Subject Classification ID

Orthogonal arrays, Latin squares, Room squares (05B15) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Cited in

(7)

• Edge-disjoint rainbow trees in properly coloured complete graphs
• Balanced tournament designs and related topics
• The construction of Kotzig factorizations
• A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares
• Starter labelling of \(k\)-windmill graphs with small defects
• Rainbow structures in locally bounded colorings of graphs
• Linearly many rainbow trees in properly edge-coloured complete graphs

This page was built for publication: Kotzig Factorizations: Existence and Computational Results

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