Orthogonal double covers of K_n,n by small graphs.
From MaRDI portal
Publication:1428552
DOI10.1016/S0166-218X(03)00269-5zbMATH Open1034.05039MaRDI QIDQ1428552FDOQ1428552
Authors: Ramadan El-Shanawany, Hans-Dietrich O. F. Gronau, Martin Grüttmüller
Publication date: 29 March 2004
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Orthogonal double covers of complete graphs by trees
- Orthogonal double covers of general graphs.
- On orthogonal double covers of graphs
- Minimum matrix representation of closure operations
- On minimum matrix representation of closure operations
- Self-orthogonal Hamilton path decompositions
- On orthogonal double covers of kn and a conjecture of chung and west
- Title not available (Why is that?)
- Orthogonal double covers of complete graphs by trees of small diameter
- On orthogonal double covers by trees
- Title not available (Why is that?)
- Two conjectures of Demetrovics, Füredi, and Katona, concerning partitions
- Title not available (Why is that?)
- A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
- Title not available (Why is that?)
Cited In (16)
- Title not available (Why is that?)
- Orthogonal double covers of complete bipartite graphs
- On orthogonal double covers of graphs
- Orthogonal double covers of Cayley graphs
- Two-fold factorization of the complete bipartite graphs by infinite graph classes
- Orthogonal double covers of general graphs.
- Constructions of quad-rooted double covers
- Orthogonal double covers of complete bipartite graphs by the union of a cycle and a star
- Cartesian product of two symmetric starter vectors of orthogonal double covers
- Suborthogonal double covers of the complete bipartite graphs by all bipartite subgraphs with five edges over finite groups
- On Cartesian products of orthogonal double covers
- A class of 2-colorable orthogonal double covers of complete graphs by Hamiltonian paths
- General symmetric starter of orthogonal double covers of complete bipartite graph
- On the one edge algorithm for the orthogonal double covers
- Title not available (Why is that?)
- Orthogonal double covers of complete bipartite graphs by paths and cycles
Uses Software
This page was built for publication: Orthogonal double covers of \(K_{n,n}\) by small graphs.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1428552)