scientific article; zbMATH DE number 979131

From MaRDI portal
Publication:4332941

zbMath0863.05064MaRDI QIDQ4332941

Walter D. Wallis

Publication date: 18 February 1997


Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.



Related Items

Perfect 1-Factorizations of a Family of Cayley Graphs, A new neighborhood structure for round robin scheduling problems, Minimization of rest mismatches in round robin tournaments, Graph factors and factorization: 1985--2003: a survey, Randomly orthogonal factorizations with constraints in bipartite networks, One-factorisations of complete graphs arising from ovals in finite planes, Cubic factorizations, Orthogonally Resolvable Cycle Decompositions, Switching in one-factorisations of complete graphs, Orthogonally resolvable matching designs, Perfect one-factorizations arising from the Lee metric, Latin hexahedra and related combinatorial structures, Explicit Baranyai partitions for quadruples, Part I: Quadrupling constructions, A multi-round generalization of the traveling tournament problem and its application to Japanese baseball, There are 3155 nonisomorphic perfect one‐factorizations of K16, An improved recursive construction for disjoint Steiner quadruple systems, Uniform Lie algebras and uniformly colored graphs, On minimum sets of 1-factors covering a complete multipartite graph, Global constraints for round robin tournament scheduling., \(f\)-factors in bipartite (\(mf\))-graphs, Efficient, local and symmetric Markov chains that generate one-factorizations, Ladder orderings of pairs and RAID performance., Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations, Grooming for two-period optical networks, \(k\) -factors in regular graphs, Nilpotent 1-factorizations of the complete graph, Cryptosystems involving one-factorizations of graphs, Semi-perfect 1-factorizations of the hypercube, Rainbow and orthogonal paths in factorizations ofKn, 1-factorizations of complete multigraphs arising from finite geometry, Orthogonal (g, f)-factorizations in networks, New families of atomic Latin squares and perfect 1-factorisations., Symmetric 1-factorizations of the complete graph, Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations, Abelian 1-factorizations in infinite graphs, Developing an algorithm for triad design, One-factorizations of complete graphs with vertex-regular automorphism groups, Factorization of \(K_{n,n}\) into \((0,j)\)-prisms, \(k\)-pyramidal one-factorizations, Recoloring subgraphs of \(K_{2n}\) for sports scheduling, Large sets with multiplicity, Symmetric Hamilton cycle decompositions of complete graphs minus a 1-factor, There are 1,132,835,421,602,062,347 nonisomorphic one-factorizations ofK14, Small regular graphs of girth 7, PERFECT 1-FACTORISATIONS OF, A new large \(N\) expansion for general matrix-tensor models, An application of Tutte's theorem to 1-factorization of regular graphs of high degree, Spanning cubic graph designs, On circular--linear one-factorizations of the complete graph, Edge-disjoint Hamilton cycles in random graphs, Decompositions of line graphs of complete graphs into paths and cycles, On \((g,f)\)-uniform graphs, A quantitative approach to perfect one-factorizations of complete bipartite graphs, \((g, f)\)-factorizations randomly orthogonal to a subgraph in graphs, On the convergence of the mild random walk algorithm to generate random one-factorizations of complete graphs, A family of perfect factorisations of complete bipartite graphs, Randomly orthogonal \((g,f)\)-factorizations in graphs, Factorization of de Bruijn digraphs by cycle-rooted trees