On decomposition of the Cartesian product of directed cycles into cycles of equal lengths (Q2012066): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/j.dam.2017.05.017 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2730131490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some observations on the oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Oberwolfach problem and factors of uniform odd length cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposing Complete Graphs Into Cycles of Length 2P / rank
 
Normal rank
Property / cites work
 
Property / cites work: Decomposition of circulant digraphs with two jumps into cycles of equal lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the directed Oberwolfach problem with equal cycle lengths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3691761 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When the cartesian product of directed cycles is Hamiltonian / rank
 
Normal rank

Latest revision as of 04:14, 14 July 2024

scientific article
Language Label Description Also known as
English
On decomposition of the Cartesian product of directed cycles into cycles of equal lengths
scientific article

    Statements

    On decomposition of the Cartesian product of directed cycles into cycles of equal lengths (English)
    0 references
    27 July 2017
    0 references
    graph decomposition
    0 references
    Cartesian product of cycles
    0 references
    Oberwolfach problem
    0 references
    directed cycle decomposition
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references
    0 references