Pages that link to "Item:Q3714114"
From MaRDI portal
The following pages link to One-factorizations of the complete graph—A survey (Q3714114):
Displaying 50 items.
- Cubic factorizations (Q383761) (← links)
- A constrained sports scheduling problem (Q583097) (← links)
- A perfect one-factorization of \(K_{36}\) (Q584283) (← links)
- Round robin tournaments and three index assignments (Q633482) (← links)
- One-factorisations of complete graphs arising from hyperbolae in the Desarguesian affine plane (Q669615) (← links)
- On the application of graph colouring techniques in round-robin sports scheduling (Q709125) (← links)
- Abelian 1-factorizations in infinite graphs (Q709254) (← links)
- The structure of the symmetry groups of perfect 1-factorizations of \(K_ 2n\) (Q757437) (← links)
- Graph factors and factorization: 1985--2003: a survey (Q868347) (← links)
- On transitive one-factorizations of arc-transitive graphs (Q880010) (← links)
- On combinatorial designs with subdesigns (Q908920) (← links)
- The existence of restricted resolvable designs. I: (1,2)-factorizations of \(K_{2n}\) (Q914680) (← links)
- Symmetric 1-factorizations of the complete graph (Q976163) (← links)
- \(k\)-pyramidal one-factorizations (Q995770) (← links)
- Spanning cubic graph designs (Q1045074) (← links)
- Partial triple systems and edge colourings (Q1109776) (← links)
- Some models of graphs for scheduling sports competitions (Q1110456) (← links)
- Mininal linear spaces (Q1112037) (← links)
- Symmetry groups related to the construction of perfect one factorizations of \(K_{2n}\) (Q1113924) (← links)
- Perfect one-factorizations of \(K_{1332}\) and \(K_{6860}\) (Q1115886) (← links)
- Isomorphism of strong starters in cyclic groups (Q1175956) (← links)
- The existence of non-trivial hyperfactorizations of \(K_{2n}\) (Q1180405) (← links)
- The spectrum of maximal sets of one-factors (Q1184003) (← links)
- Optimal partitions for triples (Q1185896) (← links)
- On a class of completable partial edge-colourings (Q1186316) (← links)
- On the perfect one-factorization conjecture (Q1196999) (← links)
- Three-class association schemes (Q1296390) (← links)
- Total colorings of equibipartite graphs (Q1297471) (← links)
- Pseudo-one-factorizations of regular graphs of odd order. II: Products of graphs (Q1322199) (← links)
- On 4-semiregular 1-factorizations of complete graphs and complete bipartite graphs (Q1323492) (← links)
- The lines of \(PG(4, 2)\) are the points on a quintic in \(PG(9, 2)\) (Q1336452) (← links)
- One-factorisations of complete graphs arising from ovals in finite planes (Q1671774) (← links)
- Random subgraphs of properly edge-coloured complete graphs and long rainbow cycles (Q1686315) (← links)
- Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations (Q1727772) (← links)
- Two orthogonal 4-cycle-free one-factorizations of complete graphs (Q1741579) (← links)
- A wide-ranging computational comparison of high-performance graph colouring algorithms (Q1761113) (← links)
- Orthogonal starters in finite abelian groups (Q1812866) (← links)
- Balanced tournament designs and related topics (Q1823946) (← links)
- Anti-Ramsey colorings in several rounds (Q1850529) (← links)
- Spanning tree decompositions of complete graphs orthogonal to rotational 1-factorizations (Q2014215) (← links)
- A construction of \(\mathbb{F}_2 \)-linear cyclic, MDS codes (Q2194505) (← links)
- Probabilistic existence of large sets of designs (Q2194761) (← links)
- Efficient, local and symmetric Markov chains that generate one-factorizations (Q2216928) (← links)
- Number of 1-factorizations of regular high-degree graphs (Q2220965) (← links)
- The first families of highly symmetric Kirkman triple systems whose orders fill a congruence class (Q2243892) (← links)
- One-factorisations of complete graphs constructed in Desarguesian planes of certain odd square orders (Q2294105) (← links)
- On circular--linear one-factorizations of the complete graph (Q2329207) (← links)
- Loops, regular permutation sets and colourings of directed graphs. (Q2352469) (← links)
- Construction of a class of loops via graphs. (Q2380490) (← links)
- Resolvability of infinite designs (Q2434885) (← links)
