Strong chromatic index of sparse graphs with maximum degree 4

DOI10.1216/RMJ.2025.55.101MaRDI QIDQ6977131zbMATH OpenFDO

Authors Jiacong Fu, Jianbo Lv, Xiangwen Li

Publication date 30 May 2025

Published in Rocky Mountain Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://projecteuclid.org/journals/rocky-mountain-journal-of-mathematics/volume-55/issue-1/STRONG-CHROMATIC-INDEX-OF-SPARSE-GRAPHS-WITH-MAXIMUM-DEGREE-4/10.1216/rmj.2025.55.101.full

zbMATH Keywords

maximum average degreesparse graphstrong chromatic indexstrong edge-coloring

Mathematics Subject Classification ID

Vertex degrees (05C07) Coloring of graphs and hypergraphs (05C15) Extremal problems in graph theory (05C35) Density (toughness, etc.) (05C42)

Cites work

• A bound on the strong chromatic index of a graph
• A stronger bound for the strong chromatic index
• Colouring graphs with sparse neighbourhoods: bounds and applications
• scientific article; zbMATH DE number 3882451 (Why is no real title available?)
• scientific article; zbMATH DE number 3851125 (Why is no real title available?)
• Induced matchings in cubic graphs
• On Representatives of Subsets
• On strong edge-coloring of graphs with maximum degree 4
• On strong edge-colouring of subcubic graphs
• Problems and results in combinatorial analysis and graph theory
• Strong chromatic index of graphs with maximum degree four
• Strong edge colouring of subcubic graphs
• Strong edge-colorings of sparse graphs with large maximum degree
• The strong chromatic index of a cubic graph is at most 10

This page was built for publication: Strong chromatic index of sparse graphs with maximum degree 4

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6977131)