Injective edge coloring of sparse graphs with maximum degree 5
From MaRDI portal
Publication:2111524
DOI10.1007/S10878-022-00972-WOpenAlexW4313655781WikidataQ123223568 ScholiaQ123223568MaRDI QIDQ2111524FDOQ2111524
Authors: Junlei Zhu, Yuehua Bu, Hongguo Zhu 
Publication date: 17 January 2023
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-022-00972-w
Recommendations
Extremal problems in graph theory (05C35) Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Cites Work
- Induced and weak induced arboricities
- 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
Cited In (10)
- Injective colorings of sparse 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
- Injective edge-coloring of graphs with given maximum degree
- 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 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)
