位置：成果数据库 > 期刊 > 期刊详情页
The complexity of determining the rainbow vertex-connection of a graph
  • ISSN号：0304-3975
  • 期刊名称：Theoretical Computer Science
  • 时间：2011.8.8
  • 页码：4531-4535
  • 相关项目：顶点度的幂和的若干极值问题的研究
作者： Chen, Lily|Li, Xueliang|Shi, Yongtang|
同期刊论文项目
顶点度的幂和的若干极值问题的研究
期刊论文 15 著作 1
同项目期刊论文
The minimal size of a graph with generalized connectivity κ_3 =2
Notes on ‘‘A proof for a conjecture on the Randi? index of graphs with diameter’&r
随机图的广义3-连通度
Complete Solution to a Conjecture on the Fourth Maximal Energy Tree
Complete solution to a problem on the maximal energy of unicyclic bipartite graphs
On the diameter and inverse degree
On a Relation Between Randic Index and Algebraic Connectivity
The extremal matching energy of bicyclic graphs
On the rainbow vertex-connection
Note on the HOMO-LUMO index of graphs
Rainbow Connection in 3-Connected Graphs
Solution to a conjecture on the maximal energy of bipartite bicyclic graphs
Complete solution to a conjecture on the maximal energy of unicyclic graphs