scientific article; zbMATH DE number 979131
From MaRDI portal
Publication:4332941
zbMATH Open0863.05064MaRDI QIDQ4332941FDOQ4332941
Authors: Walter D. Wallis 
Publication date: 18 February 1997
Title of this publication is not available (Why is that?)
Recommendations
- A CONSTRUCTION OF ONE-FACTORIZATION
- One-factors and \(k\)-factors
- scientific article
- scientific article; zbMATH DE number 1899890
- scientific article; zbMATH DE number 17509
- scientific article; zbMATH DE number 4055660
- One-Wayness Equivalent to General Factoring
- On one-factorizations of replacement products
- On one method of factorization of polynomials
- Structural Information and Communication Complexity
perfect matchingsasymptotic enumerationSteiner triple systemsSteiner quadruple systemsedge-colouringone-factorizationslatin squarestournament designround-robin tournamentsstartersone-fators
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Triple systems (05B07)
Cited In (63)
- A family of perfect factorisations of complete bipartite graphs
- Spanning cubic graph designs
- A CONSTRUCTION OF ONE-FACTORIZATION
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations
- Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor
- Orthogonal (g, f)-factorizations in networks
- Efficient, local and symmetric Markov chains that generate one-factorizations
- Factorization of de Bruijn digraphs by cycle-rooted trees
- Nilpotent 1-factorizations of the complete graph
- On \((g,f)\)-uniform graphs
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations
- One-factorisations of complete graphs arising from ovals in finite planes
- Semi-perfect 1-factorizations of the hypercube
- One-factorizations of regular graphs of order 12
- \(k\) -factors in regular graphs
- A multi-round generalization of the traveling tournament problem and its application to Japanese baseball
- Symmetric 1-factorizations of the complete graph
- A quantitative approach to perfect one-factorizations of complete bipartite graphs
- Abelian 1-factorizations in infinite graphs
- There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14
- Minimization of rest mismatches in round robin tournaments
- Title not available (Why is that?)
- Developing an algorithm for triad design
- PERFECT 1-FACTORISATIONS OF
- Ladder orderings of pairs and RAID performance.
- On circular--linear one-factorizations of the complete graph
- \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs
- \(k\)-pyramidal one-factorizations
- Switching in one-factorisations of complete graphs
- Perfect 1-Factorizations of a Family of Cayley Graphs
- Rainbow and orthogonal paths in factorizations of \(K_n\)
- Cryptosystems involving one-factorizations of graphs
- Randomly orthogonal factorizations with constraints in bipartite networks
- One-factorizations of complete graphs with vertex-regular automorphism groups
- New families of atomic Latin squares and perfect 1-factorisations.
- Global constraints for round robin tournament scheduling.
- Randomly orthogonal \((g,f)\)-factorizations in graphs
- Edge-disjoint Hamilton cycles in random graphs
- On minimum sets of 1-factors covering a complete multipartite graph
- Large sets with multiplicity
- Grooming for two-period optical networks
- Small regular graphs of girth 7
- Perfect one-factorizations arising from the Lee metric
- Orthogonally resolvable matching designs
- A new neighborhood structure for round robin scheduling problems
- Graph factors and factorization: 1985--2003: a survey
- A new large \(N\) expansion for general matrix-tensor models
- Recoloring subgraphs of \(K_{2n}\) for sports scheduling
- Cubic factorizations
- An application of Tutte's theorem to 1-factorization of regular graphs of high degree
- Factorization of \(K_{n,n}\) into \((0,j)\)-prisms
- Uniform Lie algebras and uniformly colored graphs
- Title not available (Why is that?)
- 1-factorizations of complete multigraphs arising from finite geometry
- Decompositions of line graphs of complete graphs into paths and cycles
- Orthogonally Resolvable Cycle Decompositions
- \(f\)-factors in bipartite (\(mf\))-graphs
- Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions
- On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs
- Title not available (Why is that?)
- There are 3155 nonisomorphic perfect one‐factorizations of K16
- An improved recursive construction for disjoint Steiner quadruple systems
- Latin hexahedra and related combinatorial structures
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4332941)
