Hamilton decompositions of complete graphs with a 3-factor leave. (Q1428535): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decomposition of Cayley graphs of degree 4 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5650698 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian decompositions of complete regular s-partite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nondisconnecting disentanglements of amalgamated 2-factorizations of complete multipartite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton decompositions of complete multipartite graphs with any 2‐factor leave / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Solution of a Timetabling Problem / rank
 
Normal rank

Latest revision as of 16:31, 6 June 2024

scientific article
Language Label Description Also known as
English
Hamilton decompositions of complete graphs with a 3-factor leave.
scientific article

    Statements

    Hamilton decompositions of complete graphs with a 3-factor leave. (English)
    0 references
    0 references
    0 references
    29 March 2004
    0 references
    0 references
    Hamilton cycles
    0 references
    Complete graph
    0 references
    Amalgamation
    0 references
    Graph homomorphism
    0 references