On unavoidable digraphs in orientations of graphs
From MaRDI portal
Publication:3791169
DOI10.1002/jgt.3190110402zbMath0647.05025OpenAlexW2125850735MaRDI QIDQ3791169
Publication date: 1987
Published in: Journal of Graph Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/jgt.3190110402
Related Items (6)
On the complexity of H-coloring ⋮ On multiplicative graphs and the product conjecture ⋮ The effect of two cycles on the complexity of colourings by directed graphs ⋮ Path homomorphisms ⋮ On the complexity of colouring by superdigraphs of bipartite graphs ⋮ Duality pairs and homomorphisms to oriented and unoriented cycles
This page was built for publication: On unavoidable digraphs in orientations of graphs
