Making graphs irregular through irregularising walks

DOI10.1016/J.TCS.2026.115773MaRDI QIDQ6851432zbMATH OpenFDO

Authors Julien Bensmail, Romain Bourneuf, Paul Colinot, Samuel Humeau, Timothée Martinod

Publication date 27 February 2026

Published in Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/J.TCS.2026.115773

zbMATH Keywords

1-2-3 conjecturepathwalkgraph irregularity

Mathematics Subject Classification ID

Theory of computing (68Qxx)

Cites work

• scientific article; zbMATH DE number 3694608 (Why is no real title available?)
• A solution to the 1-2-3 conjecture
• Clique-width: on the price of generality
• Edge weights and vertex colours
• Intractability of clique-width parameterizations
• On minimizing the maximum color for the 1-2-3 conjecture
• On proper labellings of graphs with minimum label sum
• On the complexity of vertex-coloring edge-weightings
• Parameterized algorithms
• The Planar Hamiltonian Circuit Problem is NP-Complete
• Vertex-coloring edge-weightings of graphs

Cited in

(1)

• Some remarks and results on the standard (2,2)-conjecture

This page was built for publication: Making graphs irregular through irregularising walks

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