Eulerian Circuits with No Monochromatic Transitions in Edge-Colored Digraphs with all Vertices of Outdegree Three.
James M. CarraherStephen G. HartkePublished in: SIAM J. Discret. Math. (2017)
Keyphrases
- undirected graph
- weighted graph
- directed graph
- disjoint paths
- vertex set
- analog circuits
- edge weights
- edge detection
- directed acyclic graph
- edge information
- markov models
- approximation algorithms
- minimum cost
- random graphs
- high speed
- social networks
- level set method
- graph structure
- edge map
- low power
- equivalence classes
- edge detector
- partial differential equations
- analog vlsi
- directed edges