A coloring algorithm for 4K1-free line graphs

被引：5

作者：

Fraser, Dallas J. ^{[1
]}

Hamel, Angele M. ^{[1
]}

Hoang, Chinh T. ^{[1
]}

Maffray, Frederic ^{[2
]}

机构：

[1] Wilfrid Laurier Univ, Dept Phys & Comp Sci, Waterloo, ON, Canada

[2] Univ Grenoble Alpes, CNRS, Lab G SCOP, Grenoble, France

来源：

DISCRETE APPLIED MATHEMATICS | 2018年 / 234卷

基金：

加拿大自然科学与工程研究理事会;

关键词：

Graph coloring; Claw; K-5 \ e; Line-graph;

D O I：

10.1016/j.dam.2017.06.006

中图分类号：

O29 [应用数学];

学科分类号：

070104 ;

摘要：

Given a family F of graphs, let Free(F) be the class of graphs that do not contain any member of as an induced subgraph. When F is a set of four-vertex graphs the complexity of the vertex coloring problem in Free(F) is known, with three exceptions: F = {claw, 4K(1)}, = {claw, 4K(1), co-diamond}, and F = {C-4, 4K(1)}. In this paper, we study the coloring problem for Free(claw, 4K(1)). We solve the vertex coloring problem for a subclass of Free(claw, 4K(1)) which contains the class of 4K(1)-free line graphs. (C) 2017 Elsevier B.V. All rights reserved.

引用

页码：76 / 85

页数：10

共 50 条

[1] An algorithm on strong edge coloring of K4-minor free graphs
Van Bommel, M.F.
Wang, Ping
Journal of Combinatorial Mathematics and Combinatorial Computing, 2021, 116 : 303 - 314
[2] COLORING PERFECT (K4-E)-FREE GRAPHS
TUCKER, A
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 42 (03) : 313 - 318
[3] Coloring (4K1,C4,C6)-free graphs
Penev, Irena
DISCRETE MATHEMATICS, 2023, 346 (11)
[4] (p, k)-coloring problems in line graphs
Demange, M
Ekim, T
de Werra, D
THEORETICAL COMPUTER SCIENCE, 2005, 349 (03) : 462 - 474
[5] A REDUCTION PROCEDURE FOR COLORING PERFECT K4-FREE GRAPHS
TUCKER, A
JOURNAL OF COMBINATORIAL THEORY SERIES B, 1987, 43 (02) : 151 - 172
[6] An On-line Competitive Algorithm for Coloring P8-free Bipartite Graphs
Micek, Piotr
Wiechert, Veit
ALGORITHMS AND COMPUTATION, ISAAC 2014, 2014, 8889 : 516 - 527
[7] Edge DP-Coloring in K4-Minor Free Graphs and Planar Graphs
He, Jingxiang
Han, Ming
AXIOMS, 2024, 13 (06)
[8] (k, 1)-coloring of sparse graphs
Borodin, O. V.
Ivanova, A. O.
Montassier, M.
Raspaud, A.
DISCRETE MATHEMATICS, 2012, 312 (06) : 1128 - 1135
[9] Coloring of (P6, dart, K4)-free graphs
Hong, Xia
Xu, Baogang
DISCRETE APPLIED MATHEMATICS, 2025, 365 : 223 - 230
[10] On r-hued coloring of K4-minor free graphs
Song, Huimin
Fan, Suohai
Chen, Ye
Sun, Lei
Lai, Hong-Jian
DISCRETE MATHEMATICS, 2014, 315 : 47 - 52

← 1 2 3 4 5 →