Is there any polynomial upper bound for the universal labeling of graphs?

DOI10.1007/S10878-016-0107-8zbMath1386.05166arXiv1701.06685OpenAlexW3101837034MaRDI QIDQ1680487

Morteza Saghafian, Ali Dehghan, Arash Ahadi

Publication date: 16 November 2017

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1701.06685

zbMATH Keywords

regular graphstrees1-2-3-conjectureuniversal labelinguniversal labeling number

Mathematics Subject Classification ID

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

Related Items (5)

On the proper orientation number of chordal graphs ⋮ On the semi-proper orientations of graphs ⋮ Proper orientation, proper biorientation and semi-proper orientation numbers of graphs ⋮ On the in-out-proper orientations of graphs ⋮ On the proper arc labeling of directed graphs

Uses Software

• MathOverflow

Cites Work

• Unnamed Item
• Proper orientation of cacti
• Algorithmic complexity of proper labeling problems
• On the proper orientation number of bipartite graphs
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Edge weights and vertex colours
• The complexity of the proper orientation number
• The inapproximability for the (0,1)-additive number
• NP completeness of finding the chromatic index of regular graphs

This page was built for publication: Is there any polynomial upper bound for the universal labeling of graphs?