Injective edge coloring of graphs with maximum degree 5
From MaRDI portal
Publication:6157424
DOI10.1016/J.DAM.2023.03.022zbMATH Open1512.05150OpenAlexW4360801383WikidataQ122178739 ScholiaQ122178739MaRDI QIDQ6157424FDOQ6157424
Authors: Junlei Zhu 
Publication date: 11 May 2023
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2023.03.022
Recommendations
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Induced and weak induced arboricities
- List star edge coloring of sparse graphs
- List injective edge-coloring of subcubic 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
- Note on injective edge-coloring of graphs
- Injective edge coloring of planar graphs
- Injective edge-coloring of graphs with small weight
- Injective edge coloring for graphs with small edge weight
Cited In (12)
- Injective colorings of graphs with low average degree
- 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 graphs with given maximum degree
- Edge colorings of planar graphs with maximum degree five.
- Injective edge coloring of sparse graphs with maximum degree 5
- Injective edge-coloring of subcubic graphs
- Injective edge coloring of some standard graph products
- Injective edge coloring for graphs with small edge weight
- On injective edge-coloring of graphs with maximum degree 4
- Injective edge coloring of sparse graphs
This page was built for publication: Injective edge coloring of graphs with maximum degree 5
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6157424)
