The Tight Bound for the Strong Chromatic Indices of Claw-Free Subcubic Graphs

Let G be a graph and k a positive integer. A strong k -edge-coloring of G is a mapping ϕ : E ( G ) → { 1 , 2 , ⋯ , k } such that for any two edges e and e ′ that are either adjacent to each other or adjacent to a common edge, ϕ ( e ) ≠ ϕ ( e ′ ) . The strong chromatic index of G , denoted as χ s ′ (...

Full description

Saved in:

Bibliographic Details
Published in:	Graphs and combinatorics Vol. 39; no. 3; p. 58
Main Authors:	Lin, Yuquan, Lin, Wensong
Format:	Journal Article
Language:	English
Published:	Tokyo Springer Japan 01.05.2023 Springer Nature B.V
Subjects:	Algorithms Combinatorial analysis Combinatorics Engineering Design Graph coloring Graphs Integers Mathematics Mathematics and Statistics Original Paper Polynomials Upper bounds Subcubic graph Strong chromatic index Strong edge coloring Claw-free graph
ISSN:	0911-0119, 1435-5914
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!