Introduction to majority additive coloring

DOI10.1016/J.AMC.2025.129613MaRDI QIDQ6917251zbMATH OpenFDO

Authors Mateusz Kamyczura

Publication date 14 October 2025

Published in Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.AMC.2025.129613

Mathematics Subject Classification ID

Combinatorics (05-XX) Graph theory (05Cxx) Extremal combinatorics (05Dxx)

Cites work

• A solution to the 1-2-3 conjecture
• Additive coloring of planar graphs
• An Alon-Tarsi style theorem for additive colorings
• Edge weights and vertex colours
• scientific article; zbMATH DE number 1540669 (Why is no real title available?)
• scientific article; zbMATH DE number 3243267 (Why is no real title available?)
• Lucky labelings of graphs
• Majority colourings of digraphs
• Majority edge-colorings of graphs
• On generalised majority edge-colourings of graphs
• The probabilistic method. With an appendix on the life and work of Paul Erdős.
• Upper bounds on distance vertex irregularity strength of some families of graphs

This page was built for publication: Introduction to majority additive coloring

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