共查询到20条相似文献,搜索用时 62 毫秒
1.
2.
Susan A. van Aardt Christoph Brause Alewyn P. Burger Marietjie Frick Arnfried Kemnitz Ingo Schiermeyer 《Discrete Mathematics》2017,340(11):2673-2677
An edge-coloured graph is called properly connected if any two vertices are connected by a path whose edges are properly coloured. The proper connection number of a connected graph denoted by , is the smallest number of colours that are needed in order to make properly connected. Our main result is the following: Let be a connected graph of order and . If , then except when and where and 相似文献
3.
4.
5.
6.
7.
8.
9.
10.
11.
Ernesto Estrada 《Linear algebra and its applications》2012,436(11):4317-4328
12.
13.
14.
15.
16.
17.
18.
19.
Aysel Erey 《Discrete Mathematics》2018,341(5):1419-1431