Orientations without forbidden patterns on three vertices

Santiago Guzmán-Pro and César Hernández-Cruz

Applied Mathematics and Computation, 2024, vol. 480, issue C

Abstract: Given a set F of oriented graphs, a graph G is a Forbe(F)-graph if it admits an F-free orientation. Skrien showed that proper-circular arc graphs, nested interval graphs and comparability graphs, correspond to Forbe(F)-graph classes for some set F of orientations of P3. Building on these results, we exhibit the list of all Forbe(F)-graph classes when F is a set of oriented graphs on three vertices. Structural characterizations for these classes are provided, except for the so-called perfectly-orientable graphs and the transitive-perfectly-orientable graphs, which remain as open problems.

Keywords: Forbidden subgraph characterization; Generalized colouring; Forbe(F)-graph; Graph homomorphism (search for similar items in EconPapers)
Date: 2024
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0096300324003734
Full text for ScienceDirect subscribers only

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:eee:apmaco:v:480:y:2024:i:c:s0096300324003734

DOI: 10.1016/j.amc.2024.128912

Access Statistics for this article

Applied Mathematics and Computation is currently edited by Theodore Simos

More articles in Applied Mathematics and Computation from Elsevier
Bibliographic data for series maintained by Catherine Liu ().