SUBDIVISIONS OF GRAPHS WITH LARGE MINIMUM DEGREE

被引：9
|
作者：
THOMASSEN, C
机构：
来源：
JOURNAL OF GRAPH THEORY | 1984年 / 8卷 / 01期
关键词：
D O I：
10.1002/jgt.3190080103
中图分类号：
O1 [数学];
学科分类号：
0701 ; 070101 ;
摘要：
引用
收藏
页码：23 / 28
页数：6
相关论文
共 50 条
  • [1] BALANCED SUBDIVISIONS OF A LARGE CLIQUE IN GRAPHS WITH HIGH AVERAGE DEGREE*
    Wang, Yan
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2023, 37 (02) : 1262 - 1274
  • [2] Nonseparating K4-subdivisions in graphs of minimum degree at least 4
    Kriesell, Matthias
    [J]. JOURNAL OF GRAPH THEORY, 2018, 89 (02) : 194 - 213
  • [3] Edge coloring graphs with large minimum degree
    Plantholt, Michael J.
    Shan, Songling
    [J]. JOURNAL OF GRAPH THEORY, 2023, 102 (04) : 611 - 632
  • [4] Extraconnectivity of graphs with large minimum degree and girth
    Balbuena, C
    Carmona, A
    Fabrega, J
    Fiol, MA
    [J]. DISCRETE MATHEMATICS, 1997, 167 : 85 - 100
  • [5] Contractible cycles in graphs with large minimum degree
    Egawa, Y
    [J]. DISCRETE MATHEMATICS, 1997, 171 (1-3) : 103 - 119
  • [6] Matching Cut in Graphs with Large Minimum Degree
    Chi-Yeh Chen
    Sun-Yuan Hsieh
    Hoang-Oanh Le
    Van Bang Le
    Sheng-Lung Peng
    [J]. Algorithmica, 2021, 83 : 1238 - 1255
  • [7] Matching Cut in Graphs with Large Minimum Degree
    Chen, Chi-Yeh
    Hsieh, Sun-Yuan
    Le, Hoang-Oanh
    Le, Van Bang
    Peng, Sheng-Lung
    [J]. ALGORITHMICA, 2021, 83 (05) : 1238 - 1255
  • [8] Matching Cut in Graphs with Large Minimum Degree
    Hsieh, Sun-Yuan
    Le, Hoang-Oanh
    Le, Van Bang
    Peng, Sheng-Lung
    [J]. COMPUTING AND COMBINATORICS, COCOON 2019, 2019, 11653 : 301 - 312
  • [9] Cycle lengths in graphs with large minimum degree
    Nikiforov, V
    Schelp, RH
    [J]. JOURNAL OF GRAPH THEORY, 2006, 52 (02) : 157 - 170
  • [10] Cliques in -free graphs of large minimum degree
    Gyarfas, Andras
    Sarkozy, Gabor N.
    [J]. PERIODICA MATHEMATICA HUNGARICA, 2017, 74 (01) : 73 - 78
12345