Primarily orientable graphs
Combinatorics
2020-12-14 v1
Abstract
A graph is primarily 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 primarily orientable graphs.
Cite
@article{arxiv.2012.06101,
title = {Primarily orientable graphs},
author = {Houmem Belkhechine},
journal= {arXiv preprint arXiv:2012.06101},
year = {2020}
}