On (strong) proper vertex-connection of graphs

DOI10.1007/s40840-015-0271-5zbMath1387.05089arXiv1505.04986OpenAlexW1862075246MaRDI QIDQ1695612

Yan Zhao, Hui Jiang, Yingying Zhang, Xue Liang Li

Publication date: 7 February 2018

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/1505.04986

zbMATH Keywords

vertex-coloringproper vertex-connectionstrong proper vertex-connection

Mathematics Subject Classification ID

Paths and cycles (05C38) Structural characterization of families of graphs (05C75) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (7)

Some results on the total proper \(k\)-connection number ⋮ On radio connection number of graphs ⋮ The conflict-free vertex-connection number and degree conditions of graphs ⋮ Conflict-free vertex connection number at most 3 and size of graphs ⋮ On the total proper connection of graphs ⋮ (Strong) total proper connection of some digraphs ⋮ On the (di)graphs with (directed) proper connection number two

Cites Work

• Unnamed Item
• Unnamed Item
• Characterizations of graphs having large proper connection numbers
• Proper connection of graphs
• The complexity of determining the rainbow vertex-connection of a graph
• Rainbow connections of graphs: a survey
• Rainbow vertex \(k\)-connection in graphs
• On the rainbow vertex-connection
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The strong rainbow vertex-connection of graphs

This page was built for publication: On (strong) proper vertex-connection of graphs