Hamiltonian decomposition of lexicographic products of digraphs (Q1127876): Difference between revisions

From MaRDI portal
Importer (talk | contribs)
Created a new Item
 
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 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.1006/jctb.1998.1816 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2034445352 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3197858 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of lexicographic product / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of the complete directed graph into k-circuits / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of complete regular multipartite digraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Hamiltonian decomposition of \(K^*_{2m},2m\geq 8\) / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 13:38, 28 May 2024

scientific article
Language Label Description Also known as
English
Hamiltonian decomposition of lexicographic products of digraphs
scientific article

    Statements

    Hamiltonian decomposition of lexicographic products of digraphs (English)
    0 references
    0 references
    10 September 1998
    0 references
    We partially resolve a conjecture of Alspach, Bermond, and Sotteau by showing that the lexicographic product of two hamiltonian decomposable digraphs, the first of odd order, is itself hamiltonian decomposable in general.
    0 references
    0 references
    0 references
    0 references
    0 references
    hamiltonian decomposition
    0 references
    lexicographic product
    0 references
    0 references