Partial and perfect path covers of cographs

被引：0
|
作者：
机构：
来源：
Discrete Appl Math | / 1-3卷 / 143-153期
关键词：
D O I：
暂无
中图分类号：
学科分类号：
摘要：
引用
收藏
相关论文
共 50 条
  • [1] Partial and perfect path covers of cographs
    Kirkpatrick, DG
    Reddy, KM
    Rangan, CP
    Srinivasan, A
    DISCRETE APPLIED MATHEMATICS, 1998, 89 (1-3) : 143 - 153
  • [2] PERFECT PATH DOUBLE COVERS OF GRAPHS
    BONDY, JA
    JOURNAL OF GRAPH THEORY, 1990, 14 (02) : 259 - 272
  • [3] Perfect Italian domination in cographs
    Banerjee, S.
    Henning, Michael A.
    Pradhan, D.
    APPLIED MATHEMATICS AND COMPUTATION, 2021, 391
  • [4] On eulerian and regular perfect path double covers of graphs
    Seyffarth, K
    Wang, CD
    DISCRETE MATHEMATICS, 2005, 293 (1-3) : 237 - 250
  • [5] PERFECT PATH DOUBLE COVERS IN EVERY SIMPLE GRAPH
    LI, H
    JOURNAL OF GRAPH THEORY, 1990, 14 (06) : 645 - 650
  • [6] PACKINGS AND PERFECT PATH DOUBLE COVERS OF MAXIMAL PLANAR GRAPHS
    SEYFFARTH, K
    DISCRETE MATHEMATICS, 1993, 117 (1-3) : 183 - 195
  • [7] Cycle transversals in perfect graphs and cographs
    Brandstaedt, Andreas
    Brito, Synara
    Klein, Sulamita
    Nogueira, Loana Tito
    Protti, Fabio
    THEORETICAL COMPUTER SCIENCE, 2013, 469 : 15 - 23
  • [8] Perfect Italian domination on some generalizations of cographs
    Paul, Kaustav
    Pandey, Arti
    COMPUTATIONAL & APPLIED MATHEMATICS, 2024, 43 (06):
  • [9] AN OPTIMAL PATH COVER ALGORITHM FOR COGRAPHS
    LIN, R
    OLARIU, S
    PRUESSE, G
    COMPUTERS & MATHEMATICS WITH APPLICATIONS, 1995, 30 (08) : 75 - 83
  • [10] THE PATH WIDTH AND TREE WIDTH OF COGRAPHS
    BODLAENDER, HL
    MOHRING, RH
    LECTURE NOTES IN COMPUTER SCIENCE, 1990, 447 : 301 - 309
12345