...
首页> 外文期刊>Discrete Applied Mathematics >Distance-hereditary comparability graphs
【24h】

Distance-hereditary comparability graphs

机译:距离-遗传可比性图

获取原文
获取原文并翻译 | 示例
           

摘要

In this paper, we study the class of distance-hereditary comparability graphs, that is, those graphs which admit a transitive orientation and are completely decomposable with respect to the split decomposition.We provide a characterization based on a restricted number of forbidden subgraphs.We also provide further characterizations and one of them, based on the split decomposition, is used to devise a recognizing algorithm working in linear time.Finally, we show how to build distance-hereditary comparability graphs.
机译:在本文中,我们研究了距离遗传可比性图的类别,即那些具有传递方向且对于分裂分解完全可分解的图。我们基于有限数量的禁止子图提供了特征。还提供了进一步的表征,其中之一是基于拆分分解的,用于设计一种在线性时间内工作的识别算法。最后,我们展示了如何构建距离遗传的可比性图。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号