SPANNING GRAPHS WITHOUT ODD HOLES AND ANTIHOLES

被引：0
|
作者：
GURVICH, VA
TEMKIN, MA
UDALOV, VM
SHAPOVALOV, AV
机构：
来源：
DOKLADY AKADEMII NAUK | 1993年 / 329卷 / 04期
关键词：
D O I：
暂无
中图分类号：
O [数理科学和化学]; P [天文学、地球科学]; Q [生物科学]; N [自然科学总论];
学科分类号：
07 ; 0710 ; 09 ;
摘要：
引用
收藏
页码：411 / 415
页数：5
相关论文
共 50 条
  • [1] Detecting Holes and Antiholes in Graphs
    Stavros D. Nikolopoulos
    Leonidas Palios
    Algorithmica, 2007, 47 : 119 - 138
  • [2] Detecting holes and antiholes in graphs
    Nikolopoulos, Stavros D.
    Palios, Leonidas
    ALGORITHMICA, 2007, 47 (02) : 119 - 138
  • [3] On the chromatic number of graphs of odd girth without longer odd holes
    Wang, Hongyang
    DISCRETE APPLIED MATHEMATICS, 2024, 342 : 227 - 230
  • [4] Spanning trees in graphs without large bipartite holes
    Han, Jie
    Hu, Jie
    Ping, Lidan
    Wang, Guanghui
    Wang, Yi
    Yang, Donglei
    COMBINATORICS PROBABILITY AND COMPUTING, 2024, 33 (03) : 270 - 285
  • [5] Graphs without odd holes, parachutes or proper wheels:: a generalization of Meyniel graphs and of line graphs of bipartite graphs
    Conforti, M
    Cornuéjols, G
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2003, 87 (02) : 300 - 330
  • [6] Optimal Independent Spanning Trees on Odd Graphs
    Jong-Seok Kim
    Hyeong-Ok Lee
    Eddie Cheng
    László Lipták
    The Journal of Supercomputing, 2011, 56 : 212 - 225
  • [7] CHORDLESS PATHS, ODD HOLES, AND KERNELS IN GRAPHS WITHOUT M-OBSTRUCTIONS
    GAVRIL, F
    LAREDO, VT
    DEWERRA, D
    JOURNAL OF ALGORITHMS, 1994, 17 (02) : 207 - 221
  • [8] Optimal Independent Spanning Trees on Odd Graphs
    Kim, Jong-Seok
    Lee, Hyeong-Ok
    Cheng, Eddie
    Liptak, Laszl
    JOURNAL OF SUPERCOMPUTING, 2011, 56 (02): : 212 - 225
  • [9] Graphs with girth 9 and without longer odd holes are 3-colourable
    Wang, Yan
    Wu, Rong
    JOURNAL OF GRAPH THEORY, 2024, 106 (04) : 871 - 886
  • [10] On coloring of graphs of girth 2l + 1 without longer odd holes
    Wu, Di
    Xu, Baogang
    Xu, Yian
    arXiv, 2022,
12345