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

From MaRDI portal
Added link to MaRDI item.
Set OpenAlex properties.
 
(2 intermediate revisions by 2 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
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
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1016/s0166-218x(02)00251-2 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2101752896 / rank
 
Normal rank

Latest revision as of 11:57, 30 July 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
    0 references