scientific article; zbMATH DE number 7696790

DOI10.11845/sxjz.2020129bzbMath1524.05113MaRDI QIDQ6162646

Unnamed Author, Jian Xi Li, Jian-Bo Lu

Publication date: 15 June 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

sparse graphstrong edge-coloring\(K_{2,3}\)-minor free graph

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Unnamed Item
• A stronger bound for the strong chromatic index (extended abstract)
• The strong chromatic index of a cubic graph is at most 10
• A bound on the strong chromatic index of a graph
• Strong chromatic index of graphs with maximum degree four
• On strong edge-coloring of graphs with maximum degree 4
• Colouring graphs with sparse neighbourhoods: bounds and applications
• Strong edge-colorings of sparse graphs with large maximum degree
• On strong edge-colouring of subcubic graphs
• Strong edge-colouring and induced matchings
• Strong edge-coloring for jellyfish graphs
• Induced matchings in cubic graphs

This page was built for publication: