Switching in one-factorisations of complete graphs
zbMATH Open1300.05254MaRDI QIDQ405262FDOQ405262
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
File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)
Recommendations
- scientific article; zbMATH DE number 3912422
- On one-factorizations of the complete graph
- scientific article
- 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
switchinggroup divisible designatomic Latin squareHamiltonian Latin squareone-factorisationperfect one-factorisation
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)
Cites Work
- Practical graph isomorphism. II.
- The CRC handbook of combinatorial designs
- The theory and application of latin bitrades: A survey
- How not to prove the Alon-Tarsi conjecture
- Title not available (Why is that?)
- Generating uniformly distributed random latin squares
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- Atomic Latin squares of order eleven
- There are 526,915,620 nonisomorphic one‐factorizations of K12
- Title not available (Why is that?)
- Switching codes and designs
- The cycle switching graph of the Steiner triple systems of order 19 is connected
- Atomic Latin squares based on cyclotomic orthomorphisms
- \(k\)-cycle free one-factorizations of complete graphs
- On the number of 1-factorizations of the complete graph
- Perfect factorisations of bipartite graphs and Latin squares without proper subrectangles
- Mappings of Latin squares
- New families of atomic Latin squares and perfect 1-factorisations.
- Intersection of perfect 1-factorizations of complete graphs
- On triple systems and strongly regular graphs
- Symmetries that latin squares inherit from 1‐factorizations
- Title not available (Why is that?)
- Title not available (Why is that?)
- Cycle switches in Latin squares
- Properties of the Steiner triple systems of order 19
Cited In (10)
- Parity of transversals of Latin squares
- Efficient, local and symmetric Markov chains that generate one-factorizations
- Enumeration of Latin squares with conjugate symmetry
- One-factorisations of complete graphs arising from ovals in finite planes
- PERFECT 1-FACTORISATIONS OF
- On one test for the switching separability of graphs modulo \(q\)
- Perfect one-factorizations arising from the Lee metric
- Parity of sets of mutually orthogonal Latin squares
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Latin squares with a unique intercalate
Uses Software
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)
