作者: Sandip Das , Swathy Prabhu , Sagnik Sen
DOI: 10.1016/J.DISC.2018.04.001
关键词:
摘要: Abstract An oriented graph is a directed with no cycle of length one or two. The relative clique number an the cardinality largest subset X vertices such that each pair either adjacent connected by 2-path. It known planar at most 80. Here we improve upper bound to 32. We also prove 14 for triangle-free graphs. Furthermore, determine exact values families outerplanar graphs girth least g and + 2 all ≥ 3 . Moreover, study relation chromatic number, absolute maximum degree graph. show subcubic seven which weakly supports conjecture Sopena (JGT 1997).