Abstract

A graph G is prime orientable if it is possible to orient its edges in such a way that the resulting oriented graph is prime, i.e., indecomposable under modular decomposition. We characterize prime orientable graphs.

Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call