Answers are grounded in this paper and cite their sources.
This research demonstrates that planar graphs with Ore-degree up to 7 have strong chromatic index of 13, suggesting improved edge-coloring methods.
A strong edge-coloring of a graph G is a coloring of edges of G such that every color class forms an induced matching. The strong chromatic index is the minimum number of colors needed to color the graph. The Ore-degree $θ(G)$ of a graph G is the maximum sum of degrees of adjacent vertices. We show that every planar graph G with θ(G)≤ 7 has strong chromatic index at most $13$. This settles a conjecture of Chen et al in the planar case. We use a discharging method, and apply Combinatorial Nullstellensatz to show reducible configurations. We provide an algorithm to allow Combinatorial Nullstellansatz extracting coefficients from large polynomials.
No takes yet. Share an insight, caveat, or question.
Nelson et al. (2025) studied this question.
Synapse has enriched 8 closely related papers on similar clinical questions. Consider them for comparative context: