位置：成果数据库 > 期刊 > 期刊详情页
Rainbow connection number of dense graphs
  • 期刊名称：Discuss. Math. Graph Theory
  • 时间：2013.9.9
  • 页码：603-611
  • 相关项目：图的彩虹连通性与树-连通性
作者： 李学良|Mengmeng Liu|Ingo Schiermeyer|
同期刊论文项目
图的彩虹连通性与树-连通性
期刊论文 69 著作 3
同项目期刊论文
A solution to a conjecture on two rainbow connection numbers of a graph
Rainbow Connection Number and Connectivity
The minimal size of a graph with generalized connectivity κ3 = 2*
On the strong rainbow connection number of a graph
Upper bound involving parameter sigma_2 for the rainbow connection number
On the rainbow k-connectivity of complete graphs
A sharp upper bound for the rainbow 2-connection number of a 2-connected graph
Long heterochromatic paths in heterochromatic triangle free graphs
Note on the Rainbow k-Connectivity of Regular Complete Bipartite Graphs
Rainbow connection numbers of line graphs
Solutions to Unsolved Problems on the Minimal Energies of Two Classes of Graphs
Conjugated Chemical Trees with Extremal Energy
Determining the Conjugated Trees with the Third- through the Sixth-Minimal Energies
The asymptotic behavior of the Estrada index for trees
Rainbow Connections of Graphs: A Survey
Rainbow Connection Number, Bridges and Radius
Nordhaus-Gaddum-Type Theorem for Rainbow Connection Number of Graphs
图的彩虹连通数与最小度和
Note on minimally d-rainbow connected graphs
The energy of random graphs
On the maximal energy tree with two maximum degree vertices
The asymptotic value of the Randic index for trees
A note on the maximal Estrada index of trees with a given bipartition
An approach to the problem of the maximal energy of bicyclic graphs
4-regular oriented graphs with optimum skew energy
The skew energy of random oriented graphs
New skew Laplacian energy of simple digraphs
Extremal matching energy of bicyclic graphs
Bicyclic graphs with maximal revised Szeged index
On a relation between Szeged and Wiener indices of bipartite graphs
Isomorphisms of directed P_3-graphs
The generalized 3-connectivity of Cartesian product graphs
The generalized connectivity of complete bipartite graphs
On the Maximal Energy Trees with One Maximum and One Second Maximum Degree Vertex
Upper Bounds for the Rainbow Connection Numbers of Line Graphs
The covering values for acyclic digraph games
Nordhaus-Gaddum-type Bounds for the Rainbow Vertex-connection Number of a Graph
Rainbow connection numbers of complementary graphs
Note on the hardness of rainbow connections ffor planar and line graphs
Rainbow connection number and the number of blocks
Solutions to conjectures on the (k,l)-rainbow index of complete graphs
Further hardness results on the rainbow vertex-connection number of graphs
Note on the generalized connectivity of graphs
On the generalized (edge-) connectivity of graphs
随机图的广义3-连通度
On extremal graphs with at least two internally disjoint Steiner trees connecting any three vertices
The generalized connectivity of complete equipartition 3-partite graphs
数据初始值对DF类IPS检验势的影响研究
初始条件对LLC检验局部渐近势的影响研究
Rainbow connection of graphs with diameter 2
Skew spectra of oriented bipartite graphs
The (strong) rainbow connection numbers of Cayley graphs on Abelian groups
The strong rainbow vertex-connection of graphs
Note on the hardness of generalized connectivity
Partitioning complete graphs by heterochromatic trees
The (revised) Szeged index and the Wiener index of a nonbipartite graph
面板数据单位根似然比检验研究