Injective edge coloring for graphs with small edge weight

DOI10.1007/s00373-022-02562-3zbMath1497.05094OpenAlexW4295602439WikidataQ114229594 ScholiaQ114229594MaRDI QIDQ2676764

Yanyan Li

Publication date: 28 September 2022

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-022-02562-3

zbMATH Keywords

edge weightinjective edge coloringinjective chromatic index

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Signed and weighted graphs (05C22)

Related Items (3)

Injective edge coloring of some sparse graphs ⋮ Injective chromatic index of sparse graphs ⋮ Injective edge coloring of graphs with maximum degree 5

Cites Work

• Induced and weak induced arboricities
• Note on the perfect EIC-graphs
• Complexity and algorithms for injective edge-coloring in graphs
• Injective edge-coloring of graphs with given maximum degree
• Injective edge coloring of generalized Petersen graphs
• Injective edge coloring of graphs

This page was built for publication: Injective edge coloring for graphs with small edge weight