scientific article; zbMATH DE number 866665
From MaRDI portal
Publication:4873684
zbMATH Open0840.05022MaRDI QIDQ4873684FDOQ4873684
Authors: Gary MacGillivray, Jørgen Bang-Jensen
Publication date: 17 April 1996
Title of this publication is not available (Why is that?)
Recommendations
Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Coloring of graphs and hypergraphs (05C15)
Cited In (15)
- The Complexity of Colouring by Semicomplete Digraphs
- Graph homomorphisms with infinite targets
- On homomorphisms to edge-coloured cycles
- Recolouring reflexive digraphs
- Acyclic Homomorphisms and Circular Colorings of Digraphs
- The \(C_{k}\)-extended graft construction
- Digraph coloring and distance to acyclicity
- \(H\)-coloring degree-bounded (acyclic) digraphs
- On the complexity of colouring by superdigraphs of bipartite graphs
- The effect of two cycles on the complexity of colourings by directed graphs
- On the complexity of digraph colourings and vertex arboricity
- The complexity of colouring by locally semicomplete digraphs
- The recognition of bound quivers using edge-coloured homomorphisms
- The complexity of arc-colorings for directed hypergraphs
- Hereditarily hard \(H\)-colouring problems
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)