Amalgamated Factorizations of Complete Graphs

DOI10.1017/S0963548300001127zbMath0812.05047OpenAlexW2052309571WikidataQ114116562 ScholiaQ114116562MaRDI QIDQ4305317

J. Keith Dugdale, Anthony J. W. Hilton

Publication date: 13 September 1994

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1017/s0963548300001127

zbMATH Keywords

factorizationsedge-coloured graphsrecoverable embeddings

Mathematics Subject Classification ID

Planar graphs; geometric and topological aspects of graph theory (05C10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Coloring of graphs and hypergraphs (05C15)

Related Items

Fractional latin squares, simplex algebras, and generalized quotients ⋮ A Fast Algorithm for Computing a Nearly Equitable Edge Coloring with Balanced Conditions

Cites Work

• Hamiltonian decompositions of complete graphs
• Hamiltonian decompositions of complete regular s-partite graphs
• Amalgamations of almost regular edge-colourings of simple graphs
• Generalized latin rectangles I: Construction and decomposition
• Generalized latin rectangles. II: Embedding
• Outline symmetric Latin squares
• On embedding incomplete symmetric Latin squares
• Embedding Incomplete Latin Squares
• The reconstruction of latin squares with applications to school timetabling and to experimental design
• School Timetables
• The Solution of a Timetabling Problem
• A Combinatorial Theorem with an Application to Latin Rectangles