Injective edge-coloring of graphs with given maximum degree

DOI10.1016/j.ejc.2021.103355zbMath1466.05072arXiv2010.00429OpenAlexW3162029291WikidataQ114184729 ScholiaQ114184729MaRDI QIDQ2033899

Jingwei Xu, Andre Raspaud, Alexandr V. Kostochka

Publication date: 18 June 2021

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2010.00429

zbMATH Keywords

strong chromatic indexinjective chromatic index

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)

Related Items (14)

Injective edge coloring of generalized Petersen graphs ⋮ Injective edge coloring of some sparse graphs ⋮ Injective edge coloring for graphs with small edge weight ⋮ Injective edge coloring of power graphs and necklaces ⋮ Injective edge-coloring of subcubic graphs ⋮ Complexity and algorithms for injective edge coloring of graphs ⋮ Injective chromatic index of sparse graphs ⋮ Injective edge coloring of graphs with maximum degree 5 ⋮ Unnamed Item ⋮ List injective edge-coloring of subcubic graphs ⋮ Note on injective edge-coloring of graphs ⋮ Injective edge-coloring of graphs with small weight ⋮ Injective edge chromatic index of generalized Petersen graphs ⋮ Injective edge coloring of sparse graphs with maximum degree 5

Cites Work

• The strong chromatic index of \((3,\Delta)\)-bipartite graphs
• A note on the strong chromatic index of bipartite graphs
• The number of matchings in random regular graphs and bipartite graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Asymptotic lower bounds for Ramsey functions
• The asymptotic number of labeled graphs with given degree sequences
• Incidence and strong edge colorings of graphs
• Induced and weak induced arboricities
• On the injective chromatic number of graphs
• Optimal Vertex Partitions
• The Independence Ratio of Regular Graphs
• The strong chromatic index ofC4-free graphs
• Injective edge coloring of sparse graphs
• Injective edge coloring of graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Injective edge-coloring of graphs with given maximum degree