Graphs with vertex rainbow connection number two

DOI10.1007/s11425-014-4905-0zbMath1321.05088OpenAlexW2254297765MaRDI QIDQ498122

Zai Ping Lu, Yingbin Ma

Publication date: 25 September 2015

Published in: Science China. Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s11425-014-4905-0

zbMATH Keywords

clique numbervertex-coloringvertex rainbow connection number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Coloring of graphs and hypergraphs (05C15) Connectivity (05C40)

Related Items (2)

Total rainbow connection number and complementary graph ⋮ The vertex-rainbow connection number of some graph operations

Cites Work

• Unnamed Item
• The complexity of determining the rainbow vertex-connection of a graph
• Rainbow connections of graphs: a survey
• Rainbow connection number of dense graphs
• Nordhaus-Gaddum-type theorem for the rainbow vertex-connection number of a graph
• Graphs with rainbow connection number two
• 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: Graphs with vertex rainbow connection number two