Upper bounds of proper connection number of graphs-Reference-Cited by-同舟云学术

Upper bounds of proper connection number of graphs

Published:2016-07-07 Issue:1 Volume:34 Page:165-173
ISSN:1382-6905
Container-title:Journal of Combinatorial Optimization
language:en
Short-container-title:J Comb Optim

Author:

Huang Fei,Li Xueliang,Wang Shujing

Funder

NSFC

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-0056-2/fulltext.html

Reference21 articles.

1. Andrews E, Laforge E, Lumduanhom C, Zhang P. On proper-path colorings in graphs. J Combin Math Combin Comput

2. Andrews E, Laforge E, Lumduanhom C, Zhang P (2014) Proper-path colorings in graph operations. J Combin Math Combin Comput 90:75–95

3. Bondy JA, Murty USR (2008) Graph theory. Springer, New York

4. Borozan V, Fujita S, Gerek A, Magnant C, Manoussakis Y, Monteroa L, Tuza Zs (2012) Proper connection of graphs. Discrete Math 312(17):2550–2560

5. Chandran L, Das A, Rajendraprasad D, Varma N (2012) Rainbow connection number and connected dominating sets. J Graph Theory 71:206–218

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

1. Revisit the Coloring Problem of Gallai Graphs;Journal of the Operations Research Society of China;2023-11-11

2. Graphs with Strong Proper Connection Numbers and Large Cliques;Axioms;2023-04-03

3. Degree sums and proper connection number of graphs;Discrete Applied Mathematics;2022-11

4. The optimal proper connection number of a graph with given independence number;Discrete Optimization;2021-08

5. Two Sufficient Conditions for 2-Connected Graphs to Have Proper Connection Number 2;Bulletin of the Malaysian Mathematical Sciences Society;2019-12-06