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

Gary MacGillivray

doi:10.1137/0404035

journal article Aug 01, 1991

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

Gary MacGillivray

SIAM Journal on Discrete Mathematics Vol. 4 No. 3 pp. 397-408 · Society for Industrial & Applied Mathematics (SIAM)

View at Publisher Save 10.1137/0404035

Topics

No keywords indexed for this article. Browse by subject →

References

11

[1]

Albertson M. Congr. Numer. (1985)

[2]

10.1016/0166-218x(90)90017-7

[3]

10.1137/0401029

[4]

10.1002/jgt.3190110402

[5]

Bondy J. A. (1976) 10.1007/978-1-349-03521-2

[6]

10.1002/jgt.3190110111

[7]

10.1007/bf02122553

[8]

10.1016/0095-8956(90)90132-j

[9]

10.1016/s0019-9958(81)90226-6

[10]

10.1016/0012-365x(78)90062-6

[11]

10.1016/0304-3975(82)90129-3

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

On the complexity of colouring by superdigraphs of bipartite graphs

Jørgen Bang-Jensen, Pavol Hell · 1992

Discrete Mathematics

Metrics

14

Citations

11

References

Details

Published: Aug 01, 1991
Vol/Issue: 4(3)
Pages: 397-408

Authors

G

Gary MacGillivray

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

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

You May Also Like