The \(k\)-proper index of graphs

DOI10.1016/j.amc.2016.10.025zbMath1411.05085arXiv1601.03503OpenAlexW2963397244MaRDI QIDQ1734744

Lin Chen, Jinfeng Liu, Xue Liang Li

Publication date: 27 March 2019

Published in: Applied Mathematics and Computation (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1601.03503

zbMATH Keywords

coloring of graphs\(k\)-proper indexcharacterization of graphs

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Some upper bounds for the 3-proper index of graphs ⋮ The \((k,\ell )\)-proper index of graphs

Cites Work

• Unnamed Item
• Unnamed Item
• The 3-rainbow index and connected dominating sets
• Characterizations of graphs having large proper connection numbers
• Note on the upper bound of the rainbow index of a graph
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• Proper connection of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• On rainbow connection
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Graphs with 3-rainbow index \(n-1\) and \(n-2\)
• Graphs with 4-rainbow index 3 and \(n-1\)
• Note on the hardness of rainbow connections for planar and line graphs
• Proper connection with many colors
• The (strong) rainbow connection numbers of Cayley graphs on abelian groups
• Some upper bounds for 3-rainbow index of graphs
• Rainbow trees in graphs and generalized connectivity
• Rainbow connection in graphs
• A solution to a conjecture on the rainbow connection number
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• Hardness and Algorithms for Rainbow Connectivity

This page was built for publication: The \(k\)-proper index of graphs