Injective edge coloring of graphs
From MaRDI portal
Publication:5864435
DOI10.2298/FIL1919411CzbMATH Open1499.05206OpenAlexW3012156675WikidataQ114043024 ScholiaQ114043024MaRDI QIDQ5864435FDOQ5864435
Authors: Charles Dominic, J. P. Cruz, D. M. Cardoso, Jorge Orestes Cerdeira 
Publication date: 7 June 2022
Published in: Filomat (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.2298/fil1919411c
Cites Work
- The NP-Completeness of Edge-Coloring
- Title not available (Why is that?)
- NP completeness of finding the chromatic index of regular graphs
- On the injective chromatic number of graphs
- Injective coloring of planar graphs
- 3-consecutive edge coloring of a graph
- The NP-completeness of chromatic index in triangle free graphs with maximum vertex of degree 3
- Induced and weak induced arboricities
- Note on the perfect EIC-graphs
- List star edge-coloring of \(k\)-degenerate graphs and \(K_4\)-minor free graphs
Cited In (26)
- Injective edge chromatic index of generalized Petersen graphs
- Injective edge coloring of generalized Petersen graphs
- Injective coloring of complementary prism and generalized complementary prism graphs
- Injective chromatic index of sparse graphs
- Injective chromatic index of \(K_4\)-minor free graphs
- Injective edge chromatic number of sparse graphs
- Injective edge coloring of some sparse graphs
- Injective edge coloring of graphs with maximum degree 5
- Complexity and algorithms for injective edge-coloring in graphs
- Injective edge-coloring of graphs with given maximum degree
- Note on injective edge-coloring of graphs
- Injective edge coloring of sparse graphs with maximum degree 5
- The injective chromatic index of a claw-free subcubic graph is at most 6
- Injective edge-coloring of subcubic graphs
- Complexity and algorithms for injective edge coloring of graphs
- List injective edge-coloring of subcubic graphs
- Title not available (Why is that?)
- Injective edge coloring of some standard graph products
- Injective-edge-coloring of planar graphs with girth restriction
- Edge open packing: complexity, algorithmic aspects, and bounds
- Injective edge coloring for graphs with small edge weight
- Injective edge-coloring of claw-free subcubic graphs
- On injective edge-coloring of graphs with maximum degree 4
- Injective edge coloring of power graphs and necklaces
- Injective edge chromatic index of generalized Petersen graph \(P(ck,k)\)
- Injective edge-coloring of graphs with small weight
This page was built for publication: Injective edge coloring of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5864435)
