HOW TO FIND OVERFULL SUBGRAPHS IN GRAPHS WITH LARGE MAXIMUM DEGREE

被引：12
|
作者：
NIESSEN, T
机构：
[1] RWTH Aachen, 52056 Aachen
来源：
DISCRETE APPLIED MATHEMATICS | 1994年 / 51卷 / 1-2期
关键词：
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 条
  • [31] LARGE PLANAR GRAPHS WITH GIVEN DIAMETER AND MAXIMUM DEGREE
    FELLOWS, M
    HELL, P
    SEYFFARTH, K
    DISCRETE APPLIED MATHEMATICS, 1995, 61 (02) : 133 - 153
  • [32] Hamiltonian Cycles in Critical Graphs with Large Maximum Degree
    Luo, Rong
    Miao, Zhengke
    Zhao, Yue
    GRAPHS AND COMBINATORICS, 2016, 32 (05) : 2019 - 2028
  • [33] Hamiltonian Cycles in Critical Graphs with Large Maximum Degree
    Rong Luo
    Zhengke Miao
    Yue Zhao
    Graphs and Combinatorics, 2016, 32 : 2019 - 2028
  • [34] Testing subgraphs in large graphs
    Alon, N
    42ND ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2001, : 434 - 441
  • [35] Testing subgraphs in large graphs
    Alon, N
    RANDOM STRUCTURES & ALGORITHMS, 2002, 21 (3-4) : 359 - 370
  • [36] How randomized search heuristics find maximum cliques in planar graphs
    Storch, Tobias
    GECCO 2006: GENETIC AND EVOLUTIONARY COMPUTATION CONFERENCE, VOL 1 AND 2, 2006, : 567 - 574
  • [37] Approximating Bounded Degree Maximum Spanning Subgraphs
    Feng, Wangsen
    Ma, Hao
    Zhang, Bei
    Wang, Hanpin
    OPERATIONS RESEARCH AND ITS APPLICATIONS, PROCEEDINGS, 2009, 10 : 83 - +
  • [38] The maximum number of complete subgraphs in a graph with given maximum degree
    Cutler, Jonathan
    Radcliffe, A. J.
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 2014, 104 : 60 - 71
  • [39] THE CHROMATIC INDEX OF GRAPHS WITH LARGE MAXIMUM DEGREE, WHERE THE NUMBER OF VERTICES OF MAXIMUM DEGREE IS RELATIVELY SMALL
    CHETWYND, AG
    HILTON, AJW
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1990, 48 (01) : 45 - 66
  • [40] A note on large graphs of diameter two and given maximum degree
    McKay, BD
    Miller, M
    Siran, J
    JOURNAL OF COMBINATORIAL THEORY SERIES B, 1998, 74 (01) : 110 - 118
12345