Characterization of edge-colored complete graphs with properly colored Hamilton paths (Q3418198): Difference between revisions

From MaRDI portal
RedirectionBot (talk | contribs)
Changed an Item
ReferenceBot (talk | contribs)
Changed an Item
 
(2 intermediate revisions by 2 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.1002/jgt.20188 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W4231579672 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP / rank
 
Normal rank

Latest revision as of 13:37, 25 June 2024

scientific article
Language Label Description Also known as
English
Characterization of edge-colored complete graphs with properly colored Hamilton paths
scientific article

    Statements

    Characterization of edge-colored complete graphs with properly colored Hamilton paths (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    2 February 2007
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references