Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (Q4715273): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Cycles in bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5545296 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating Hamiltonian cycles / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetric designs and geometroids / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamilton circuits with many colours in properly edge-coloured complete graphs. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Hamiltonian cycles having adjacent lines different colours / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constructing a perfect matching is in random NC / rank
 
Normal rank

Revision as of 14:39, 24 May 2024

scientific article; zbMATH DE number 944204
Language Label Description Also known as
English
Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP
scientific article; zbMATH DE number 944204

    Statements

    Finding a Longest Alternating Cycle in a 2-edge-coloured Complete Graph is in RP (English)
    0 references
    0 references
    29 June 1997
    0 references
    complete graph
    0 references
    edge colouring
    0 references
    cycle
    0 references
    alternating cycle
    0 references
    randomly polynomial
    0 references
    exact matching
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references