Pushing vertices to make graphs irregular

DOI10.46298/DMTCS.14963MaRDI QIDQ7257267zbMATH OpenFDO

Authors Julien Bensmail, Clara Marcille, Mano Orenga

Publication date 4 June 2026

Published in Discrete Mathematics and Theoretical Computer Science. DMTCS (Search for Journal in Brave)

Full work available at URL https://doi.org/10.46298/DMTCS.14963

zbMATH Keywords

1-2-3 conjectureproper labellingpushing vertices

Mathematics Subject Classification ID

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

Cites work

• A simplified NP-complete satisfiability problem
• A solution to the 1-2-3 conjecture
• Edge weights and vertex colours
• Highly irregular graphs
• On decomposing regular graphs into locally irregular subgraphs
• On the complexity of vertex-coloring edge-weightings
• Planar Formulae and Their Uses
• The 3-flow conjecture, factors modulo k, and the 1-2-3-conjecture
• Vertex-coloring edge-weightings of graphs

This page was built for publication: Pushing vertices to make graphs irregular

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