HOW TO FIND OVERFULL SUBGRAPHS IN GRAPHS WITH LARGE MAXIMUM DEGREE

被引:12
|
作者
NIESSEN, T
机构
[1] RWTH Aachen, 52056 Aachen
关键词
D O I
10.1016/0166-218X(94)90101-5
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
The existence of an overfull subgraph of a simple graph implies chi' = DELTA + 1, where chi' denotes the chromatic index and DELTA the maximum degree. A fast algorithm for finding overfull subgraphs of simple graphs with 2DELTA greater-than-or-equal-to Absolute value of V is presented.
引用
收藏
页码:117 / 125
页数:9
相关论文
共 50 条
  • [41] The classification of f-coloring of graphs with large maximum degree
    Cai, Jiansheng
    Yan, Guiying
    Zhang, Xia
    APPLIED MATHEMATICS AND COMPUTATION, 2017, 313 : 119 - 121
  • [42] Randomly colouring graphs with girth five and large maximum degree
    Lau, LC
    Molloy, M
    LATIN 2006: THEORETICAL INFORMATICS, 2006, 3887 : 665 - 676
  • [43] THE TOTAL CHROMATIC NUMBER OF GRAPHS HAVING LARGE MAXIMUM DEGREE
    HILTON, AJW
    HIND, HR
    DISCRETE MATHEMATICS, 1993, 117 (1-3) : 127 - 140
  • [44] Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs
    Axenovich, Maria
    Tompkins, Casey
    Weber, Lea
    JOURNAL OF GRAPH THEORY, 2021, 97 (01) : 34 - 46
  • [45] Large planar subgraphs in dense graphs
    Kühn, D
    Osthus, D
    Taraz, A
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2005, 95 (02) : 263 - 282
  • [46] Certifying Induced Subgraphs in Large Graphs
    Meyer, Ulrich
    Tran, Hung
    Tsakalidis, Konstantinos
    Journal of Graph Algorithms and Applications, 2024, 28 (03) : 49 - 68
  • [47] COMPLETE SUBGRAPHS WITH LARGE DEGREE SUMS
    FAUDREE, RJ
    JOURNAL OF GRAPH THEORY, 1992, 16 (04) : 327 - 334
  • [48] Topological Subgraphs in Graphs of Large Girth
    W. Mader
    Combinatorica, 1998, 18 : 405 - 412
  • [49] The number of graphs with large forbidden subgraphs
    Bollobas, Bela
    Nikiforov, Vladimir
    EUROPEAN JOURNAL OF COMBINATORICS, 2010, 31 (08) : 1964 - 1968
  • [50] Small subgraphs with large average degree
    Janzer, Oliver
    Sudakov, Benny
    Tomon, Istvan
    PROCEEDINGS OF THE 2023 ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, SODA, 2023, : 2345 - 2353