Oriented list colouring of undirected graphs.
Attila SaliGábor SimonyiPublished in: Contemporary Trends in Discrete Mathematics (1997)
Keyphrases
- undirected graph
- approximation algorithms
- directed acyclic graph
- directed graph
- disjoint paths
- spanning tree
- connected components
- minimum cost
- positive integer
- graph structure
- complex networks
- random graphs
- strongly connected
- vertex set
- objective function
- graphical models
- markov models
- undirected graphical models
- average degree
- special case