On orthogonal double covers of graphs (Q5894828): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1023/a:1016546402248 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W1529827858 / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 10:21, 30 July 2024

scientific article; zbMATH DE number 1801776
Language Label Description Also known as
English
On orthogonal double covers of graphs
scientific article; zbMATH DE number 1801776

    Statements

    On orthogonal double covers of graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    17 September 2002
    0 references
    An orthogonal double cover (ODC) of the complete graph \(K_n\) is a collection of \(n\) spanning subgraphs (pages) of \(K_n\) such that they cover every edge of the complete graph precisely twice and the intersection of every two pages contains exactly one edge. If all the pages are isomorphic to some graph \(G\), then \(K_n\) has an ODC by \(G\). This paper is a thorough survey of results on ODCs. Some generalizations of the problem are also covered. The list of references contains 67 items.
    0 references
    orthogonal double covers
    0 references
    graph decompositions
    0 references
    self-orthogonal factorization
    0 references

    Identifiers