Complexity and algorithms for injective edge coloring of graphs

An injective k-edge-coloring of a graph G=(V,E) is an assignment ω:E→{1,2,…,k} of colors to the edges of G such that any two edges e and f receive distinct colors if there exists an edge g=xy different from e and f such that e is incident on x and f is incident on y. The minimum value of k for which...

Celý popis

Podrobná bibliografia

Vydané v:	Theoretical computer science Ročník 968; s. 114010
Hlavní autori:	Priyamvada, Panda, B.S.
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 11.08.2023
Predmet:	Injective edge coloring Linear time algorithm NP-complete Linear time algorithm Injective edge coloring NP-complete
ISSN:	0304-3975, 1879-2294
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!