Complexity and algorithms for injective edge coloring of graphs
From MaRDI portal
Publication:6132966
DOI10.1016/J.TCS.2023.114010OpenAlexW4380880169MaRDI QIDQ6132966FDOQ6132966
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
Cites Work
- A review of tree convex sets test
- On the injective chromatic number of graphs
- On the complexity of injective colorings and its generalizations
- On Injective Colourings of Chordal Graphs
- Exact square coloring of certain classes of graphs: complexity and algorithms
- Induced and weak induced arboricities
- List injective edge-coloring of subcubic graphs
- Note on the perfect EIC-graphs
- Complexity and algorithms for injective edge-coloring in graphs
- Injective edge coloring of sparse graphs
- Injective edge coloring of graphs
- Injective edge-coloring of graphs with given maximum degree
- Injective edge-coloring of subcubic graphs
- Complexity and algorithms for neighbor-sum-2-distinguishing \(\{1,3\}\)-edge-weighting of graphs
- Injective coloring of some subclasses of bipartite graphs and chordal graphs
Cited In (1)
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)
