Pages that link to "Item:Q5894828"
From MaRDI portal
The following pages link to On orthogonal double covers of graphs (Q5894828):
Displaying 26 items.
- Cyclic orthogonal double covers of 4-regular circulant graphs (Q409350) (← links)
- On defining sets of full designs (Q710602) (← links)
- Orthogonal double covers of circulant graphs by corona product of certain infinite graph classes (Q828935) (← links)
- Orthogonal double covers of complete graphs by caterpillars of diameter 5 (Q879946) (← links)
- Cartesian product of two symmetric starter vectors of orthogonal double covers (Q896101) (← links)
- General symmetric starter of orthogonal double covers of complete bipartite graph (Q925408) (← links)
- Super-simple, pan-orientable and pan-decomposable GDDs with block size 4 (Q966044) (← links)
- Orthogonal double covers of Cayley graphs (Q967367) (← links)
- Super-simple, pan-orientable, and pan-decomposable BIBDs with block size 4 and related structures (Q968218) (← links)
- Orthogonal covers by multiplication graphs (Q1026106) (← links)
- Orthogonal double covers of \(K_{n,n}\) by small graphs. (Q1428552) (← links)
- Super-simple (\(v\),\,5,\,2)-designs. (Q1428553) (← links)
- New type of coding problem motivated by database theory (Q1885817) (← links)
- Super-simple twofold Steiner pentagon systems (Q1926041) (← links)
- On Cartesian products of orthogonal double covers (Q1950009) (← links)
- A complete classification of 5-regular circulant graphs that allow cyclic orthogonal double covers (Q2038877) (← links)
- Super-simple pairwise balanced designs with block sizes 3 and 4 (Q2374179) (← links)
- More orthogonal double covers of complete graphs by Hamiltonian paths (Q2427509) (← links)
- Super-simple Steiner pentagon systems (Q2476264) (← links)
- Coding Theory Motivated by Relational Databases (Q3092324) (← links)
- Partitions with certain intersection properties (Q3100729) (← links)
- Self-orthogonal decompositions of graphs into matchings (Q3439401) (← links)
- TWO-FOLD FACTORIZATION OF THE COMPLETE BIPARTITE GRAPHS BY INFINITE GRAPH CLASSES (Q4639464) (← links)
- (Q5076255) (← links)
- ON THE ONE EDGE ALGORITHM FOR THE ORTHOGONAL DOUBLE COVERS (Q5151278) (← links)
- The novel generally described graphs for cyclic orthogonal double covers of some circulants (Q6059285) (← links)
