Paths and Trails in Edge-Colored Graphs (Q5458574): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Paths and Trails in Edge-Colored Graphs / 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: Q4539516 / 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: The number of 2-edge-colored complete graphs with unique Hamiltonian alternating cycle / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3786318 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Hamiltonian circuits determining the order of chromosomes / 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: The directed subgraph homeomorphism problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3138921 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster scaling algorithms for general graph matching problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4834366 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating cycles in edge-partitioned graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the Computational Complexity of Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Alternating paths in edge-colored complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526776 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Finding paths in graphs avoiding forbidden transitions / 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
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on alternating cycles in edge-coloured graphs / rank
 
Normal rank

Latest revision as of 21:23, 27 June 2024

scientific article; zbMATH DE number 5263952
Language Label Description Also known as
English
Paths and Trails in Edge-Colored Graphs
scientific article; zbMATH DE number 5263952

    Statements

    Paths and Trails in Edge-Colored Graphs (English)
    0 references
    15 April 2008
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Edge colored graphs
    0 references
    connectivity
    0 references
    properly edge-colored paths
    0 references
    trails and cycles
    0 references
    0 references