.png){kind=icon}
返回
Orientations without forbidden patterns on three vertices
.png){kind=icon}
OA
AI
DOI：10.1016/j.amc.2024.128912.png)
.png){kind=icon}
.png){kind=icon}
分享.png){kind=icon}
收藏
摘要
En 中文
Given a set F of oriented graphs, a graph G is a Forb e (F) -graph if it admits an F -free orientation. Skrien showed that proper -circular arc graphs, nested interval graphs and comparability graphs, correspond to Forb e (F) -graph classes for some set F of orientations of P 3 . Building on these results, we exhibit the list of all Forb e (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.
Keyword:
Forbidden subgraph characterization
Generalized colouring
Forbe(F)-graph
Graph homomorphism
AI总结
对已上传原文的论文进行重点信息的提取，主要内容包括：简要概述、研究摘要、背景介绍、关键亮点、图文解析、展望与总结。
期刊
IF:
3.4
论文数:
2.3W
被引数:
3.3W
机构
.png){kind=icon}
