Regular graphs are universally 3-edge-weightable

MaRDI QIDQ7216550arXivFDO

Authors Kecai Deng

Publication date 2026

Published in arXiv

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

arXiv classification

math.CO

This page was built for publication: Regular graphs are universally 3-edge-weightable

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