Cycles and paths in edge‐colored graphs with given degrees (Q3055905): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Q4358434 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast probabilistic algorithms for Hamiltonian circuits and matchings / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles and paths in edge-coloured multigraphs: A survey / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian problems in edge-colored complete graphs and eulerian cycles in edge-colored graphs : some complexity results / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Some Theorems on Abstract Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Characterization of edge-colored complete graphs with properly colored Hamilton paths / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5503350 / rank
 
Normal rank
Property / cites work
 
Property / cites work: DNA physical mapping and alternating Eulerian cycles in colored graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank

Latest revision as of 11:38, 3 July 2024

scientific article
Language Label Description Also known as
English
Cycles and paths in edge‐colored graphs with given degrees
scientific article

    Statements

    Identifiers

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