Injective edge coloring of sparse graphs with maximum degree 5
From MaRDI portal
(Redirected from Publication:2111524)
Recommendations
Cites work
- Complexity and algorithms for injective edge-coloring in graphs
- Induced and weak induced arboricities
- Injective edge coloring of graphs
- Injective edge coloring of planar graphs
- Injective edge coloring of sparse graphs
- Injective edge-coloring of graphs with given maximum degree
- List injective edge-coloring of subcubic graphs
- Note on injective edge-coloring of graphs
Cited in
(15)- Injective edge-coloring of graphs with given maximum degree
- Injective edge coloring for graphs with small edge weight
- Injective edge coloring of sparse graphs
- Injective edge coloring of some sparse graphs
- Injective chromatic index of sparse graphs
- Injective edge coloring of graphs with maximum degree 5
- Injective chromatic index of K₄-minor free graphs
- Injective edge chromatic number of sparse graphs
- On injective edge-coloring of graphs with maximum degree 4
- Injective edge coloring of sparse graphs
- Further results on injective edge coloring of graphs with maximum degree 5
- Injective edge chromatic index of sparse graphs
- Injective colorings of sparse graphs
- The injective chromatic index of planar graphs with maximum degree 4
- Some bounds on the injective edge chromatic number
This page was built for publication: Injective edge coloring of sparse graphs with maximum degree 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2111524)