# On degree-colorings of multigraphs

Source: [On degree-colorings of multigraphs](<https://www.sota2.com/research/paper/68fa537d1e209131ce983cb8>)

Collection index: [llms.txt](<https://www.sota2.com/research/llms.txt>)

Data updated: 2025-10-25T12:29:12.764Z

Authors: Mark K. Goldberg

Published: 2016-12-25T23:22:14.000Z

## Abstract

A notion of degree-coloring is introduced; it captures some, but not all properties of standard edge-coloring. We conjecture that the smallest number of colors needed for degree-coloring of a multigraph $G$ \[the degree-coloring index $\\tau(G)$\] equals $\\max\\{\\Delta, \\omega\\}$, where $\\Delta$ and $\\omega$ are the maximum vertex degree in $G$ and the multigraph density, respectively. We prove that the conjecture holds iff $\\tau(G)$ is a monotone function on the set of multigraphs.

## Recorded benchmark results

A research result applies to its stated dataset, split, metric and evaluation configuration. Compare like-for-like settings, preserve the metric's unit and direction, and distinguish paper-reported results from independent reproduction. The best result recorded here is not a claim of exhaustive, current global coverage.

## Original sources and implementation

[Original paper](<https://arxiv.org/abs/1612.08306>)

[PDF](<https://arxiv.org/pdf/1612.08306.pdf>)
