Some upper bounds for the 3-proper index of graphs

DOI10.1007/s40840-016-0404-5zbMath1406.05017arXiv1603.07840OpenAlexW2963739863MaRDI QIDQ1714011

Hong Chang, Zhongmei Qin, Xue Liang Li

Publication date: 31 January 2019

Published in: Bulletin of the Malaysian Mathematical Sciences Society. Second Series (Search for Journal in Brave)

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

zbMATH Keywords

edge-coloringear-decompositiondominating setproper tree3-proper index

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (1)

The \((k,\ell )\)-proper index of graphs

Cites Work

• 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
• Proper connection of graphs
• Proper connection number and connected dominating sets
• Proper connection number of random graphs
• The \(k\)-proper index of graphs
• Rainbow connections of graphs: a survey
• The 3-rainbow index of a graph
• Graphs with 3-rainbow index \(n-1\) and \(n-2\)
• Rainbow trees in graphs and generalized connectivity
• Rainbow connection in graphs
• Connected Domination and Spanning Trees with Many Leaves

This page was built for publication: Some upper bounds for the 3-proper index of graphs