Rainbow vertex-connection and forbidden subgraphs

DOI10.7151/DMGT.2004zbMath1377.05067arXiv1602.00922OpenAlexW2964123936MaRDI QIDQ1692637

Jingshu Zhang, Wen-Jing Li, Xue Liang Li

Publication date: 10 January 2018

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

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

zbMATH Keywords

rainbow vertex-connectionforbidden sub-graphsvertex-rainbow path

Mathematics Subject Classification ID

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

Related Items (2)

Rainbow vertex-connection number on a small-world Farey graph ⋮ 3-rainbow index and forbidden subgraphs

Cites Work

• Unnamed Item
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
• The complexity of determining the rainbow vertex-connection of a graph
• Dominating cliques in \(P_ 5\)-free graphs
• Rainbow connections of graphs: a survey
• Rainbow connection and forbidden subgraphs
• On the rainbow vertex-connection
• Rainbow connection in graphs
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree

This page was built for publication: Rainbow vertex-connection and forbidden subgraphs