journal article Aug 01, 1991

On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs

Topics

No keywords indexed for this article. Browse by subject →

Cited By
14
Hereditarily hard H-colouring problems

Jørgen Bang-Jensen, Pavol Hell · 1995

Discrete Mathematics
Homomorphisms to oriented cycles

Pavol Hell, Huishan Zhou · 1993

Combinatorica
Discrete Mathematics
Metrics
14
Citations
11
References
Details
Published
Aug 01, 1991
Vol/Issue
4(3)
Pages
397-408
Cite This Article
Gary MacGillivray (1991). On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs. SIAM Journal on Discrete Mathematics, 4(3), 397-408. https://doi.org/10.1137/0404035
Related

You May Also Like

The Spectrum of the Corona of Two Graphs

S. Barik, S. Pati · 2007

117 citations

The PMU Placement Problem

Dennis J. Brueni, Lenwood S. Heath · 2005

108 citations

The Average Number of Stable Matchings

Boris Pittel · 1989

88 citations

On the Dimension of the Hull

Nicolas Sendrier · 1997

70 citations