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 ′ (...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Graphs and combinatorics Ročník 39; číslo 3; s. 58
Hlavní autori:	Lin, Yuquan, Lin, Wensong
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Tokyo Springer Japan 01.05.2023 Springer Nature B.V
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!