Login / Signup
A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles.
Gary MacGillivray
Jacobus Swarts
Jørgen Bang-Jensen
Published in:
Contributions Discret. Math. (2011)
Keyphrases
</>
graph theoretic
graph theory
bayesian network structure learning
hamiltonian path
computational cost
decision problems
random graphs