Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Create a new EntitySchema
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Note on the vertex-rainbow index of a graph

From MaRDI portal
Publication:2048994
Jump to:navigation, search

DOI10.1007/s40840-021-01092-0zbMath1473.05099OpenAlexW3135786273MaRDI QIDQ2048994

Xiaoyan Zhang, Yan Zhao, Fengwei Li

Publication date: 24 August 2021

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

Full work available at URL: https://doi.org/10.1007/s40840-021-01092-0


zbMATH Keywords

vertex-rainbow indexvertex-rainbow coloring


Mathematics Subject Classification ID

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


Related Items (2)

Some results on the 3-total-rainbow index ⋮ A survey on rainbow (vertex-)index of graphs



Cites Work

  • Unnamed Item
  • Unnamed Item
  • Tight upper bound of the rainbow vertex-connection number for 2-connected graphs
  • The vertex-rainbow index of a graph
  • On rainbow connection
  • Spanning trees in graphs of minimum degree 4 or 5
  • On total rainbow \(k\)-connected graphs
  • Rainbow connections of graphs: a survey
  • Rainbow connection number and graph operations
  • The rainbow connectivity of a graph
  • Rainbow trees in graphs and generalized connectivity
  • Spanning Trees with Many Leaves
  • Rainbow connection in graphs
  • The rainbow connection of a graph is (at most) reciprocal to its minimum degree




This page was built for publication: Note on the vertex-rainbow index of a graph

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:2048994&oldid=14528497"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 19:40.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki