The Complexity of Colouring by Semicomplete Digraphs

Jørgen Bang-Jensen; Pavol Hell; Gary MacGillivray

doi:10.1137/0401029

journal article Aug 01, 1988

The Complexity of Colouring by Semicomplete Digraphs

Jørgen Bang-Jensen Pavol Hell Gary MacGillivray

SIAM Journal on Discrete Mathematics Vol. 1 No. 3 pp. 281-298 · Society for Industrial & Applied Mathematics (SIAM)

View at Publisher Save 10.1137/0401029

Topics

No keywords indexed for this article. Browse by subject →

References

8

[1]

Albertson M. Congr. Numer. (1985)

[2]

10.1002/jgt.3190110402

[3]

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

[4]

Garey Michael R. (1979)

[5]

10.1007/bf02122553

[6]

On the complexity of the general coloring problem

H.A. Maurer, J.H. Sudborough, E. Welzl

Information and Control 10.1016/s0019-9958(81)90226-6

[7]

Moon John W. (1968)

[8]

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

Cited By

56

Hereditarily hard H-colouring problems

Jørgen Bang-Jensen, Pavol Hell · 1995

Discrete Mathematics

Polynomial graph-colorings

Wolfgang Gutjahr, Emo Welzl · 1992

Discrete Applied Mathematics

On the complexity of colouring by superdigraphs of bipartite graphs

Jørgen Bang-Jensen, Pavol Hell · 1992

Discrete Mathematics

The effect of two cycles on the complexity of colourings by directed graphs

Jørgen Bang-Jensen, Pavol Hell · 1990

Discrete Applied Mathematics

Metrics

56

Citations

8

References

Details

Published: Aug 01, 1988
Vol/Issue: 1(3)
Pages: 281-298

Authors

Cite This Article

Jørgen Bang-Jensen, Pavol Hell, Gary MacGillivray (1988). The Complexity of Colouring by Semicomplete Digraphs. SIAM Journal on Discrete Mathematics, 1(3), 281-298. https://doi.org/10.1137/0401029

The Complexity of Colouring by Semicomplete Digraphs

You May Also Like