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 条

[1] Sizes of graphs with induced subgraphs of large maximum degree
Erdos, P
Reid, TJ
Schelp, R
Staton, W
DISCRETE MATHEMATICS, 1996, 158 (1-3) : 283 - 286
[2] Bipartite subgraphs of graphs with maximum degree three
Bylka, SA
Idzik, A
Komar, J
GRAPHS AND COMBINATORICS, 1999, 15 (02) : 129 - 136
[3] Bipartite Subgraphs of Graphs with Maximum Degree Three
Stanisław Bylka
Adam Idzik
Jan Komar
Graphs and Combinatorics, 1999, 15 : 129 - 136
[4] Disjoint subgraphs of large maximum degree
Pikhurko, O
Thomason, A
DISCRETE MATHEMATICS, 2002, 248 (1-3) : 125 - 141
[5] The overfull conjecture on graphs of odd order and large minimum degree
Shan, Songling
JOURNAL OF GRAPH THEORY, 2024, 106 (02) : 322 - 351
[6] Large induced subgraphs with equated maximum degree
Caro, Y.
Yuster, R.
DISCRETE MATHEMATICS, 2010, 310 (04) : 742 - 747
[7] Overfull conjecture for graphs with high minimum degree
Plantholt, M
JOURNAL OF GRAPH THEORY, 2004, 47 (02) : 73 - 80
[8] Large induced subgraphs of random graphs with given degree sequences
Southwell, Angus
Wormald, Nick
RANDOM STRUCTURES & ALGORITHMS, 2024,
[9] Paths and cycles in random subgraphs of graphs with large minimum degree
Ehard, Stefan
Joos, Felix
ELECTRONIC JOURNAL OF COMBINATORICS, 2018, 25 (02):
[10] On decomposing graphs of large minimum degree into locally irregular subgraphs
Przybylo, Jakub
ELECTRONIC JOURNAL OF COMBINATORICS, 2016, 23 (02):

← 1 2 3 4 5 →