Pancomponented 2-factorizations of complete graphs (Q2568477): Difference between revisions

From MaRDI portal
Created claim: Wikidata QID (P12): Q114190808, #quickstatements; #temporary_batch_1710897659913
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Some observations on the oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Even cycle decompositions of complete graphs minus a 1‐factor / 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: On a generalization of the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4873725 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A generalization of the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The solution of the bipartite analogue of the Oberwolfach problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: The directed anti-Oberwolfach solution: Pancyclic 2-factorizations of complete directed graphs of odd order / rank
 
Normal rank
Property / cites work
 
Property / cites work: The anti-Oberwolfach solution: Pancyclic 2-factorizations of complete graphs. / rank
 
Normal rank

Latest revision as of 17:22, 10 June 2024

scientific article
Language Label Description Also known as
English
Pancomponented 2-factorizations of complete graphs
scientific article

    Statements

    Identifiers