Acyclic orientations of complete bipartite graphs

https://doi.org/10.1016/0012-365X(94)00222-5Get rights and content
Under an Elsevier user license
open archive

Abstract

For a complete bipartite graph, the number of dependent edges in an acyclic orientation can be any integer from n−1 to e, where n and e are the number of vertices and edges in the graph.

Keywords

Bipartite graph
Acyclic orientation

Cited by (0)

Research supported in part by NSA/MSP Grant MDA904-90-H-4011.