scientific article; zbMATH DE number 30749

MaRDI QIDQ3987041zbMATH OpenFDO

Authors Gary MacGillivray, Jørgen Bang-Jensen

Publication date 28 June 1992

zbMATH Keywords

colouringcomplexitydirected graphs

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Recommendations

• The effect of two cycles on the complexity of colourings by directed graphs
• The Complexity of Colouring by Semicomplete Digraphs
• scientific article; zbMATH DE number 866665
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs

Cited in

(10)

• On the complexity of H-coloring
• Polynomial graph-colorings
• Graph homomorphisms with infinite targets
• On homomorphisms to edge-coloured cycles
• The Complexity of Colouring by Semicomplete Digraphs
• On the Complexity of Colouring by Vertex-Transitive and Arc-Transitive Digraphs
• scientific article; zbMATH DE number 866665 (Why is no real title available?)
• Polynomial graph-colorings
• A graph theoretic proof of the complexity of colouring by a local tournament with at least two directed cycles
• The effect of two cycles on the complexity of colourings by directed graphs

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3987041)