Finding paths in graphs avoiding forbidden transitions
type: Item
instance of: scholarly article
title: Finding paths in graphs avoiding forbidden transitions
zbMATH Open document ID: 1010.68099
DOI: 10.1016/S0166-218X(02)00251-2
author: Stefan Szeider
published in: Discrete Applied Mathematics
publication date: 2003-03-09T00:00:00Z
Mathematics Subject Classification ID: 68R10
zbMATH DE Number: 1878537
zbMATH Keywords: compatible path
zbMATH Keywords: transition
zbMATH Keywords: edge-colored graph
zbMATH Keywords: forbidden pairs
zbMATH Keywords: NP-completeness
zbMATH Keywords: linear time algorithm
zbMATH Keywords: transition graph
zbMATH Keywords: transition systems
MaRDI profile type: Publication
cites work: Alternating cycles and trails in \(2\)-edge-coloured complete multigraphs
cites work: Q4947393
cites work: Eulerian graphs and related topics. Part 1, Volume 1
cites work: On circuit decomposition of planar Eulerian graphs
cites work: Compatible path-cycle-decompositions of plane graphs
cites work: Q4198056
cites work: Compatible 2-factors
cites work: Q5463512
cites work: Q3707420
cites work: A Short Proof of the Factor Theorem for Finite Graphs
full work available at URL: s0166-218x(02)00251-2
OpenAlex ID: W2101752896
description: scientific article; zbMATH DE number 1878537