Is there any polynomial upper bound for the universal labeling of graphs?-Reference-Cited by-同舟云学术

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

Published:2016-12-23 Issue:3 Volume:34 Page:760-770
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Ahadi Arash,Dehghan Ali,Saghafian Morteza

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computational Theory and Mathematics,Control and Optimization,Discrete Mathematics and Combinatorics,Computer Science Applications

Link

http://link.springer.com/article/10.1007/s10878-016-0107-8/fulltext.html

Reference11 articles.

1. Ahadi A, Dehghan A (2013) The complexity of the proper orientation number. Inf Process Lett 113(19–21):799–803

2. Ahadi A, Dehghan A (2016) The inapproximability for the (0,1)-additive number. Discrete Math Theor Comput Sci 17(3):217–226

3. Araujo J, Cohen N, de Rezende SF, Havet F, Moura PFS (2015) On the proper orientation number of bipartite graphs. Theor Comput Sci 566:59–75

4. Araujo J, Havet F, Linhares Sales C, Silva A (2016) Proper orientation of cacti. Theor Comput Sci 639:14–25

5. Dehghan A (2014) The universal labeling of graph. Mathoverflow. http://mathoverflow.net/questions/169045/the-universal-labeling-of-graph

Cited by 6 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Semi-proper orientations of dense graphs;Procedia Computer Science;2023

2. Proper orientation, proper biorientation and semi-proper orientation numbers of graphs;Journal of Combinatorial Optimization;2022-12-27

3. On the Proper Arc Labeling of Directed Graphs;Graphs and Combinatorics;2021-12-15

4. On the proper orientation number of chordal graphs;Theoretical Computer Science;2021-10

5. On the in–out–proper orientations of graphs;Discrete Applied Mathematics;2021-10