Complexity and algorithms for injective edge coloring of graphs

DOI10.1016/J.TCS.2023.114010MaRDI QIDQ6132966zbMATH OpenOpenAlexFDO

Authors Priyamvada, B. S. Panda

Publication date 21 July 2023

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.tcs.2023.114010

zbMATH Keywords

NP-completelinear time algorithminjective edge coloring

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• A review of tree convex sets test
• Complexity and algorithms for injective edge-coloring in graphs
• Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
• Exact square coloring of certain classes of graphs: complexity and algorithms
• Induced and weak induced arboricities
• Injective coloring of some subclasses of bipartite graphs and chordal graphs
• Injective edge coloring of graphs
• Injective edge coloring of sparse graphs
• Injective edge-coloring of graphs with given maximum degree
• Injective edge-coloring of subcubic graphs
• List injective edge-coloring of subcubic graphs
• Note on the perfect EIC-graphs
• On Injective Colourings of Chordal Graphs
• On the complexity of injective colorings and its generalizations
• On the injective chromatic number of graphs

Cited in

(1)

• Note on injective edge-coloring of graphs

This page was built for publication: Complexity and algorithms for injective edge coloring of graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6132966)