Maximal connected cographs in distance-hereditary graphs

被引：0
|
作者：
McKee, TA [1 ]
机构：
[1] Wright State Univ, Dept Math & Stat, Dayton, OH 45435 USA
来源：
UTILITAS MATHEMATICA | 2000年 / 57卷
关键词：
D O I：
暂无
中图分类号：
O29 [应用数学];
学科分类号：
070104 ;
摘要：
A graph is distance-hereditary if the distance between two vertices in every connected induced subgraph always equals their distance in the full graph. Recent work by F. Nicolai implies that being distance-hereditary is equivalent to having a certain tree structure defined in terms of the maximal complement-reducible (cograph) subgraphs, paralleling the characterization of chordal graphs by clique trees. Several characterizations are given for a sense of 'strongly distance-hereditary graphs' that parallels strongly chordal graphs.
引用
收藏
页码：73 / 80
页数：8
相关论文
共 50 条
  • [21] The Hamiltonian problem on distance-hereditary graphs
    Hsieh, SY
    Ho, CW
    Hsu, TS
    Ko, MT
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 508 - 524
  • [22] Eccentricity function in distance-hereditary graphs
    Dragan, Feodor F.
    Guarnera, Heather M.
    [J]. THEORETICAL COMPUTER SCIENCE, 2020, 833 : 26 - 40
  • [23] Distance-hereditary embeddings of circulant graphs
    Martínez, C
    Beivide, R
    Gutierrez, J
    Izu, C
    [J]. ITCC 2003: INTERNATIONAL CONFERENCE ON INFORMATION TECHNOLOGY: COMPUTERS AND COMMUNICATIONS, PROCEEDINGS, 2003, : 320 - 324
  • [24] Reconstruction Algorithms for Permutation Graphs and Distance-Hereditary Graphs
    Kiyomi, Masashi
    Saitoh, Toshiki
    Uehara, Ryuhei
    [J]. IEICE TRANSACTIONS ON INFORMATION AND SYSTEMS, 2013, E96D (03) : 426 - 432
  • [25] The Weisfeiler–Leman Dimension of Distance-Hereditary Graphs
    Alexander L. Gavrilyuk
    Roman Nedela
    Ilia Ponomarenko
    [J]. Graphs and Combinatorics, 2023, 39
  • [26] Distance-hereditary graphs are clique-perfect
    Lee, CM
    Chang, MS
    [J]. DISCRETE APPLIED MATHEMATICS, 2006, 154 (03) : 525 - 536
  • [27] Hamilton cycles in almost distance-hereditary graphs
    Chen, Bing
    Ning, Bo
    [J]. OPEN MATHEMATICS, 2016, 14 : 19 - 28
  • [28] On the geodetic iteration number of distance-hereditary graphs
    Dourado, Mitre C.
    Oliveira, Rodolfo A.
    Protti, Fabio
    Rautenbach, Dieter
    [J]. DISCRETE MATHEMATICS, 2016, 339 (02) : 489 - 498
  • [29] Hamiltonian cycle problem on distance-hereditary graphs
    Hung, RW
    Wu, SC
    Chang, MS
    [J]. JOURNAL OF INFORMATION SCIENCE AND ENGINEERING, 2003, 19 (05) : 827 - 838
  • [30] Which distance-hereditary graphs are cover-incomparability graphs?
    Maxova, Jana
    Turzik, Daniel
    [J]. DISCRETE APPLIED MATHEMATICS, 2013, 161 (13-14) : 2095 - 2100
12345