Answers are grounded in this paper and cite their sources.
Given a set F of digraphs, we say a graph G is a F ‐ graph (resp., F *‐ graph ) if it has an orientation (resp., acyclic orientation) that has no induced subdigraphs isomorphic to any of the digraphs in F . It is proved that all the classes of graphs mentioned in the title are F ‐graphs or F *‐graphs for subsets F of a set of three digraphs.
No takes yet. Share an insight, caveat, or question.
Dale Skrien (1982) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: