scientific article; zbMATH DE number 3276424
From MaRDI portal
zbMath0173.26205MaRDI QIDQ5560917
Publication date: 1964
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Structured Codes of Graphs, Flat extensions of abstract polytopes, Constructing all minimum genus embeddings of, Edge coloring: a natural model for sports scheduling, Perfect 1-Factorizations of a Family of Cayley Graphs, Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\), Hamiltonian cycles and 1-factors in 5-regular graphs, When patrolmen become corrupted: monitoring a graph using faulty mobile robots, Cycles of quadratic Latin squares and antiperfect 1‐factorisations, Perfect one-factorizations arising from the Lee metric, Cycle double covers and the semi-Kotzig frame, A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes, Row‐Hamiltonian Latin squares and Falconer varieties, There are 3155 nonisomorphic perfect one‐factorizations of K16, Unifying some known infinite families of combinatorial 3-designs, Extending perfect matchings to Hamiltonian cycles in line graphs, Generalized arboricity of graphs with large girth, Dudeney's round table problem, Rooted complete minors in line graphs with a Kempe coloring, On the perfect one-factorization conjecture, Unnamed Item, Semi-perfect 1-factorizations of the hypercube, Symmetry groups of some perfect 1-factorizations of complete graphs, Symmetry groups of some perfect 1-factorizations of complete graphs, Cycle double covers and spanning minors. I, On the existence of automorphism free Steiner triple systems, Exklusive Graphen und Hamiltonsche Graphen n-ten Grades. I, Cycle double covers and spanning minors. II, Some basic properties of multiple Hamiltonian covers, On Hamilton Decompositions of Line Graphs of Non-Hamiltonian Graphs and Graphs without Separating Transitions, The structure of the symmetry groups of perfect 1-factorizations of \(K_ 2n\), Unnamed Item, Cycle codes of graphs and MDS array codes, Random regular tournaments, A quantitative approach to perfect one-factorizations of complete bipartite graphs, Vertex-transitive graphs that have no Hamilton decomposition
