Finding paths in graphs avoiding forbidden transitions (Q1861577): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4947393 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Eulerian graphs and related topics. Part 1, Volume 1 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On circuit decomposition of planar Eulerian graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible path-cycle-decompositions of plane graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compatible 2-factors / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5463512 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3707420 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Short Proof of the Factor Theorem for Finite Graphs / rank
 
Normal rank

Revision as of 13:23, 5 June 2024

scientific article
Language Label Description Also known as
English
Finding paths in graphs avoiding forbidden transitions
scientific article

    Statements

    Finding paths in graphs avoiding forbidden transitions (English)
    0 references
    0 references
    9 March 2003
    0 references
    0 references
    compatible path
    0 references
    transition
    0 references
    edge-colored graph
    0 references
    forbidden pairs
    0 references
    NP-completeness
    0 references
    linear time algorithm
    0 references
    transition graph
    0 references
    transition systems
    0 references