One-factorizations of the complete graph—A survey
From MaRDI portal
Publication:3714114
DOI10.1002/jgt.3190090104zbMath0587.05049OpenAlexW2149102431WikidataQ114236096 ScholiaQ114236096MaRDI QIDQ3714114
Eric Mendelsohn, Alexander Rosa
Publication date: 1985
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190090104
Extremal problems in graph theory (05C35) Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Related Items
The lines of \(PG(4, 2)\) are the points on a quintic in \(PG(9, 2)\), Construction of a class of loops via graphs., Perfect 1-Factorizations of a Family of Cayley Graphs, Partial triple systems and edge colourings, Some models of graphs for scheduling sports competitions, Mininal linear spaces, Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\), Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\), Graph factors and factorization: 1985--2003: a survey, The Existence of a Subsquare Free Latin Square of Side 12, One-factorisations of complete graphs arising from ovals in finite planes, On transitive one-factorizations of arc-transitive graphs, Cubic factorizations, Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles, Perfect one-factorizations arising from the Lee metric, A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes, Latin hexahedra and related combinatorial structures, Probabilistic existence of large sets of designs, There are 3155 nonisomorphic perfect one‐factorizations of K16, Round robin tournaments and three index assignments, On combinatorial designs with subdesigns, Resolvability of infinite designs, The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\), Efficient, local and symmetric Markov chains that generate one-factorizations, Number of 1-factorizations of regular high-degree graphs, Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations, Isomorphism of strong starters in cyclic groups, The existence of non-trivial hyperfactorizations of \(K_{2n}\), The spectrum of maximal sets of one-factors, One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane, Optimal partitions for triples, On a class of completable partial edge-colourings, Two orthogonal 4-cycle-free one-factorizations of complete graphs, The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class, On the perfect one-factorization conjecture, Round robin scheduling -- a survey, Cryptosystems involving one-factorizations of graphs, Rainbow and orthogonal paths in factorizations ofKn, A Hill-Climbing Algorithm for the Construction of One-Factorizations and Room Squares, A Dirac Type Condition for Properly Coloured Paths and Cycles, A wide-ranging computational comparison of high-performance graph colouring algorithms, Construction of orthogonal starters and corollaries, Abelian 1-factorizations of the complete graph, On the structure of uniform one-factorizations from starters in finite fields, Symmetric 1-factorizations of the complete graph, Unextendible product bases and 1-factorization of complete graphs, Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations, On the application of graph colouring techniques in round-robin sports scheduling, Abelian 1-factorizations in infinite graphs, One-factorizations of complete graphs with vertex-regular automorphism groups, A constrained sports scheduling problem, A perfect one-factorization of \(K_{36}\), \(k\)-pyramidal one-factorizations, One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders, Orthogonal starters in finite abelian groups, The structure of the symmetry groups of perfect 1-factorizations of \(K_ 2n\), Balanced tournament designs and related topics, Spanning cubic graph designs, On circular--linear one-factorizations of the complete graph, On the Enumeration of One-Factorizations of Complete Graphs Containing Prescribed Automorphism Groups, Three-class association schemes, Total colorings of equibipartite graphs, Anti-Ramsey colorings in several rounds, Scheduling the Italian football league: an ILP-based approach, One–factorizations of complete graphs with regular automorphism groups, On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs, Loops, regular permutation sets and colourings of directed graphs., Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs, On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On 1-factorizability of Cayley graphs
- Sequencings and starters
- On Quadruple Systems
- Constructing timetables for sport competitions
- Scheduling in Sports
- On Edge-Colorability of Cartesian Products of Graphs*
- Regular Graphs of High Degree are 1-Factorizable
- An Existence Theorem for Room Squares*
- A tournament problem
