Digraph measures: Kelly decompositions, games, and orderings

We consider various well-known, equivalent complexity measures for graphs such as elimination orderings, <em>k</em>-trees and cops and robber games and study their natural translations to digraphs. We show that on digraphs the translations of these measures are also equivalent and induce...

पूर्ण विवरण

ग्रंथसूची विवरण
मुख्य लेखकों: Hunter, P, Kreutzer, S
स्वरूप: Journal article
भाषा:English
प्रकाशित: Elsevier 2008
विषय: