Orthogonal double covers of general graphs

Authors:
Sven Hartmann;Ulrike Schumacher
Affiliations:
Fachbereich Mathematik, Universität Rostock, 18051 Rostock, Germany;Fachbereich Mathematik, Universität Rostock, 18051 Rostock, Germany
Venue:
Discrete Applied Mathematics
Year:
2004

Citing 10
Cited 1

On minimum matrix representation of closure operations

Discrete Applied Mathematics
Two conjectures of Demetrovics, Furedi, and Katona, concerning partitions

Discrete Mathematics
Self-orthogonal Hamilton path decompositions

Discrete Mathematics - Special volume: Designs and Graphs
On a problem of Hering concerning orthogonal covers of Kn8

Journal of Combinatorial Theory Series A
On Orthogonal Double Covers of Graphs

Designs, Codes and Cryptography
Extremal Combinatorial Problems in Relational Data Base

FCT '81 Proceedings of the 1981 International FCT-Conference on Fundamentals of Computation Theory
SGDs with doubly transitive automorphism group

Journal of Graph Theory
Minimum matrix representation of closure operations

Discrete Applied Mathematics
Almost all cubic graphs are Hamiltonian

Random Structures & Algorithms
Almost all regular graphs are hamiltonian

Random Structures & Algorithms

Orthogonal double covers of Kn,n by small graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.04

Visualization

Abstract

Let H be a graph on n vertices and G a collection of n subgraphs of H, one for each vertex. Then G is an orthogonal double cover (ODC) of H if every edge of H occurs in exactly two members of G and any two members share an edge whenever the corresponding vertices are adjacent in H. ODCs of complete graphs have been widely studied in literature. In this paper we are concerned with ODCs of arbitrary graphs. In particular, we investigate the existence of ODCs whose members are isomorphic sets of independent edges.