scientific article
From MaRDI portal
Publication:3972517
zbMath0752.05038MaRDI QIDQ3972517
Markus Fulmek, Herbert Fleischner
Publication date: 25 June 1992
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (8)
Some algorithmic results for finding compatible spanning circuits in edge-colored graphs ⋮ Nowhere‐zero 3‐flows in products of graphs ⋮ Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three ⋮ Linear amortized time enumeration algorithms for compatible Euler trails in edge-colored graphs ⋮ Compatible spanning circuits and forbidden induced subgraphs ⋮ Almost Eulerian compatible spanning circuits in edge-colored graphs ⋮ Compatible Eulerian circuits in Eulerian (di)graphs with generalized transition systems ⋮ Circular flows of nearly Eulerian graphs and vertex-splitting
This page was built for publication:
