1. The complexity of deciding whether a graph admits an orientation with fixed weak diameter;Bensmail;Discrete Math. Theor. Comput. Sci.,2016
2. Tournament games and positive tournaments;Fisher;J. Graph Theory,1995
3. Domination in planar graphs with small diameter;Goddard;J. Graph Theory,2002
4. Pushing vertices and orienting edges;Klostermeyer;Ars Combin.,1999
5. Analogs of cliques for oriented coloring;Klostermeyer;Discuss. Math. Graph Theory,2004