Strong edge-coloring of subcubic planar graphs
2017 ◽
Vol 09
(01)
◽
pp. 1750013
◽
A strong[Formula: see text]-edge-coloring of a graph [Formula: see text] is a mapping [Formula: see text]: [Formula: see text], such that [Formula: see text] for every pair of distinct edges at distance at most two. The strong chromatical index of a graph [Formula: see text] is the least integer [Formula: see text] such that [Formula: see text] has a strong-[Formula: see text]-edge-coloring, denoted by [Formula: see text]. In this paper, we prove [Formula: see text] for any subcubic planar graph with [Formula: see text] and [Formula: see text]-cycles are not adjacent to [Formula: see text]-cycles.
2020 ◽
Vol 12
(04)
◽
pp. 2050035
Keyword(s):
2019 ◽
Vol 11
(06)
◽
pp. 1950064
Keyword(s):
2020 ◽
Vol 36
(3)
◽
pp. 737-752
2012 ◽
Vol 04
(04)
◽
pp. 1250047
◽
1996 ◽
Vol 05
(06)
◽
pp. 877-883
◽
2020 ◽
Vol 12
(03)
◽
pp. 2050034