|
|
The acyclic chromatic index of planar graphs without 4-, 6-cycles and intersecting triangles |
Yuehua BU1,2, Qi JIA1, Hongguo ZHU1( ) |
1. College of Mathematics and Computer Science, Zhejiang Normal University, Jinhua 321004, China 2. Xingzhi College, Zhejiang Normal University, Jinhua 321004, China |
|
|
Abstract A proper edge k-coloring is a mapping such that any two adjacent edges receive different colors. A proper edge k-coloring of G is called acyclic if there are no bichromatic cycles in G. The acyclic chromatic index of G, denoted by , is the smallest integer k such that G is acyclically edge k-colorable. In this paper, we show that if G is a plane graph without 4-, 6-cycles and intersecting 3-cycles, , then .
|
Keywords
Acyclic edge coloring
plane graph
cycle
|
Corresponding Author(s):
Hongguo ZHU
|
Online First Date: 18 June 2024
Issue Date: 01 July 2024
|
|
1 |
N Alon, C McDiarmid, B Reed. Acyclic coloring of graphs. Random Structures Algorithms 1991; 2(3): 277–288
|
2 |
M Basavaraju, L S Chandran, N Cohen, F Havet, T Mülle. Acyclic edge-coloring of planar graphs. SIAM J Discrete Math 2011; 25(2): 463–478
|
3 |
P M S Fialho, B N B de Lima, A Procacci. A new bound on the acyclic edge chromatic number. Discrete Math 2020; 343(11): 112037
|
4 |
J Fiamčík. The acyclic chromatic class of a graph. Math. Slovaca 1978; 28(2): 139–145
|
5 |
J F Hou, G Z Liu, J L Wu. Acyclic edge coloring of planar graphs without small cycles. Graphs Combin 2012; 28(2): 215–226
|
6 |
J F Hou, W T Wang, X R Zhang. Acyclic edge coloring of planar graphs with girth at least 5. Discrete Appl Math 2013; 161(18): 2958–2967
|
7 |
D Hudák, F Kardoš, B Lužar, R Soták, R Škrekovski. Acyclic edge coloring of planar graphs with ∆ colors. Discrete Appl Math 2012; 160(9): 1356–1368
|
8 |
L KirousisJ Livieratos. The acyclic chromatic index is less than the double of the max degree. 2022, arXiv: 1901.07856v7
|
9 |
M MolloyB Reed. Further algorithmic aspects of the local lemma, In: STOC ’98 (Dallas, TX). New York: ACM, 1999, 524−529
|
10 |
Q J Shu, Y Chen, S G Han, G H Lin, E Miyano, A Zhang. Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles. Theoret Comput Sci 2021; 882: 77–108
|
11 |
Q J Shu, W F Wang, Y Q Wang. Acyclic edge coloring of planar graphs without 5-cycles. Discrete Appl Math 2012; 160(7/8): 1211–1223
|
12 |
Q J Shu, W F Wang, Y Q Wang. Acyclic chromatic indices of planar graphs with girth at least 4. J Graph Theory 2013; 73(4): 386–399
|
13 |
T Wang, Y Q Zhang. Further result on acyclic chromatic index of planar graphs. Discrete Appl Math 2016; 201: 228–247
|
14 |
W F Wang, Q J Shu, K Wang, P Wang. Acyclic chromatic indices of planar graphs with large girth. Discrete Appl Math 2011; 159(12): 1239–1253
|
15 |
W F Wang, Q J Shu, Y Q Wang. A new upper bound on the acyclic chromatic indices of planar graphs. European J Combin 2013; 34(2): 338–354
|
16 |
W F Wang, Q J Shu, Y Q Wang. Acyclic edge coloring of planar graphs without 4-cycles. J Comb Optim 2013; 25(4): 562–586
|
17 |
Y Q Wang, Q J Shu. Acyclic edge coloring of planar graphs. J Jiangsu Norm Univ (Nat Sci Ed) 2014; 32(3): 22–26
|
18 |
Y Q Wang, Q J Shu, W F Wang. The acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 4-cycle. Discrete Appl Math 2013; 161(16/17): 2687–2694
|
19 |
Y Q Wang, Q J Shu, J L Wu, W W Zhang. Acyclic edge coloring of planar graphs without a 3-cycle adjacent to a 6-cycle. J Comb Optim 2014; 28(3): 692–715
|
20 |
Y Q Wang, P Sheng. Improved upper bound for acyclic chromatic index of planar graphs without 4-cycles. J Comb Optim 2014; 27(3): 519–529
|
21 |
D Z Xie, Y Q Wu. Acyclic edge coloring of planar graphs without adjacent triangles. J Math Res Appl 2012; 32(4): 407–414
|
|
Viewed |
|
|
|
Full text
|
|
|
|
|
Abstract
|
|
|
|
|
Cited |
|
|
|
|
|
Shared |
|
|
|
|
|
Discussed |
|
|
|
|