scientific article; zbMATH DE number 866665

MaRDI QIDQ4873684zbMATH OpenFDO

Authors Gary MacGillivray, Jørgen Bang-Jensen

Publication date 17 April 1996

zbMATH Keywords

colourscomplexity of the \(H\)-colouring problemdigraph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10)

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 30749
• Hereditarily hard \(H\)-colouring problems

Cited in

(17)

• Polynomial graph-colorings
• Graph homomorphisms with infinite targets
• Recolouring reflexive digraphs
• Hereditarily hard \(H\)-colouring problems
• The \(C_{k}\)-extended graft construction
• The recognition of bound quivers using edge-coloured homomorphisms
• On homomorphisms to edge-coloured cycles
• The Complexity of Colouring by Semicomplete Digraphs
• scientific article; zbMATH DE number 30749 (Why is no real title available?)
• Acyclic Homomorphisms and Circular Colorings of Digraphs
• On the complexity of digraph colourings and vertex arboricity
• The complexity of arc-colorings for directed hypergraphs
• Digraph coloring and distance to acyclicity
• On the complexity of colouring by superdigraphs of bipartite graphs
• The complexity of colouring by locally semicomplete digraphs
• \(H\)-coloring degree-bounded (acyclic) digraphs
• 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 Q4873684)