Switching in one-factorisations of complete graphs

MaRDI QIDQ405262zbMATHFDO

Authors Petteri Kaski, André de Souza Medeiros, Patric R. J. Östergård, Ian M. Wanless

Publication date 4 September 2014

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL http://www.combinatorics.org/ojs/index.php/eljc/article/view/v21i2p49

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

switchinggroup divisible designatomic Latin squareHamiltonian Latin squareone-factorisationperfect one-factorisation

Mathematics Subject Classification ID

Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Orthogonal arrays, Latin squares, Room squares (05B15) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph designs and isomorphic decomposition (05C51)

Recommendations

• scientific article; zbMATH DE number 3912422
• On one-factorizations of the complete graph
• scientific article; zbMATH DE number 124525
• scientific article; zbMATH DE number 6843209
• One-factorizations of the complete graph—A survey
• scientific article; zbMATH DE number 17815
• On the number of 1-factorizations of a complete graph
• On switching classes of graphs
• Factorizations of complete graphs into cycles and 1-factors
• scientific article; zbMATH DE number 894695

Cites work

• scientific article; zbMATH DE number 3823850 (Why is no real title available?)
• scientific article; zbMATH DE number 979131 (Why is no real title available?)
• scientific article; zbMATH DE number 1404121 (Why is no real title available?)
• scientific article; zbMATH DE number 5239164 (Why is no real title available?)
• Atomic Latin squares based on cyclotomic orthomorphisms
• Atomic Latin squares of order eleven
• Cycle switches in Latin squares
• Generating uniformly distributed random latin squares
• How not to prove the Alon-Tarsi conjecture
• Intersection of perfect 1-factorizations of complete graphs
• Mappings of Latin squares
• New families of atomic Latin squares and perfect 1-factorisations.
• On the number of 1-factorizations of the complete graph
• On triple systems and strongly regular graphs
• Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
• Practical graph isomorphism. II.
• Properties of the Steiner triple systems of order 19
• Switching codes and designs
• Symmetries that latin squares inherit from 1‐factorizations
• The CRC handbook of combinatorial designs
• The cycle switching graph of the Steiner triple systems of order 19 is connected
• The theory and application of latin bitrades: A survey
• There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK₁₄
• There are 526,915,620 nonisomorphic one‐factorizations of K₁₂
• \(k\)-cycle free one-factorizations of complete graphs

Cited in

(10)

• Perfect 1-factorisations of \(K_{16}\)
• Latin squares with a unique intercalate
• Recoloring subgraphs of \(K_{2n}\) for sports scheduling
• Parity of sets of mutually orthogonal Latin squares
• Enumeration of Latin squares with conjugate symmetry
• Parity of transversals of Latin squares
• Perfect one-factorizations arising from the Lee metric
• Efficient, local and symmetric Markov chains that generate one-factorizations
• One-factorisations of complete graphs arising from ovals in finite planes
• On one test for the switching separability of graphs modulo \(q\)

Describes a project that uses

Uses Software

• nauty
• Traces

This page was built for publication: Switching in one-factorisations of complete graphs

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