Hardness result for the total rainbow k-connection of graphs

Wenjing Li; Xueliang Li; Di Wu

doi:10.1016/j.amc.2017.01.068

ScienceGate Book Chapters

JOURNAL ARTICLE

Hardness result for the total rainbow k-connection of graphs

Wenjing Li Xueliang Li Di Wu

Year: 2017 Journal: Applied Mathematics and Computation Vol: 305 Pages: 27-31 Publisher: Elsevier BV

DOI: 10.1016/j.amc.2017.01.068

Get Full-Text PDF Get Analytical Report

Keywords:

Combinatorics Total coloring Rainbow Mathematics Vertex (graph theory) Bound graph Graph Complete coloring Discrete mathematics Edge coloring Disjoint sets Integer (computer science) Connectivity Graph power Computer science Line graph Physics

Metrics

Cited By

0.59

FWCI (Field Weighted Citation Impact)

Refs

0.69

Citation Normalized Percentile

Is in top 1%

Is in top 10%

Citation History

Topics

Graph Labeling and Dimension Problems

Physical Sciences → Computer Science → Computational Theory and Mathematics

Advanced Graph Theory Research

Physical Sciences → Computer Science → Computational Theory and Mathematics

Limits and Structures in Graph Theory

Physical Sciences → Mathematics → Discrete Mathematics and Combinatorics

Hardness result for the total rainbow k-connection of graphs

Metrics

Citation History

Topics

Related Documents

Hardness results for total rainbow connection of graphs

Rainbow Vertex Connection Numbers and Total Rainbow Connection Numbers of Middle and Total Graphs

Graphs with small total rainbow connection number

On total rainbow k -connected graphs

Total rainbow connection numbers of some special graphs