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

Full description

Bibliographic Details

Published in:	Theoretical computer science Vol. 968; p. 114010
Main Authors:	Priyamvada, Panda, B.S.
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 11.08.2023
Subjects:	Injective edge coloring Linear time algorithm NP-complete Linear time algorithm Injective edge coloring NP-complete
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!