On unavoidable digraphs in orientations of graphs

DOI10.1002/JGT.3190110402MaRDI QIDQ3791169zbMATH OpenOpenAlexFDO

Authors Stefan A. Burr, Gary S. Bloom

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

zbMATH Keywords

chromatic numberdigraph homomorphismsdirected graphsorientation

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20)

Recommendations

• scientific article; zbMATH DE number 4144029
• The chromatic number of oriented graphs
• Acyclic and oriented chromatic numbers of graphs
• Two results on the digraph chromatic number
• Oriented trees in digraphs

Cited in

(12)

• On the complexity of H-coloring
• On multiplicative graphs and the product conjecture
• On the forced unilateral orientation number of a graph
• Orientations of digraphs almost preserving diameter
• Oriented trees in digraphs
• Duality pairs and homomorphisms to oriented and unoriented cycles
• Every orientation of a 4-chromatic graph has a non-bipartite acyclic subgraph
• Path homomorphisms
• Unique games and games based on groups
• On the complexity of colouring by superdigraphs of bipartite graphs
• GMSNP and finite structures
• The effect of two cycles on the complexity of colourings by directed graphs

This page was built for publication: On unavoidable digraphs in orientations of graphs

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