Rainbow vertex-connection and graph products
From MaRDI portal
Publication:5739599
DOI10.1080/00207160.2015.1047356zbMath1342.05046OpenAlexW1796130836MaRDI QIDQ5739599
Fengnan Yanling, Chengfu Ye, Yaping Mao, Zhao Wang
Publication date: 19 July 2016
Published in: International Journal of Computer Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/00207160.2015.1047356
Cartesian productstrong productdirect productlexicographic productrainbow vertex-connection numbervertex-colouring
Coloring of graphs and hypergraphs (05C15) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)
Related Items (3)
Proper connection number of graph products ⋮ The vertex-rainbow connection number of some graph operations ⋮ Rainbow connectivity of Moore cages of girth 6
Cites Work
- Unnamed Item
- Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees
- Rainbow connection number of graph power and graph products
- The complexity of determining the rainbow vertex-connection of a graph
- Convex sets in lexicographic products of graphs
- A note on the connectivity of Kronecker products of graphs
- The multi-tree approach to reliability in distributed networks
- Reliable broadcasting in product networks
- Rainbow connections of graphs: a survey
- Connectivity of strong products of graphs
- Path-connectivity of lexicographic product graphs
- On the rainbow vertex-connection
- On the rainbow connection of Cartesian products and their subgraphs
- The rainbow connectivity of a graph
- Bounds for the rainbow connection number of graphs
- ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
- Game coloring the Cartesian product of graphs
- Rainbow Connection in Graphs with Minimum Degree Three
- Isomorphic components of Kronecker product of bipartite graphs
- The Number of Independent Sets in a Grid Graph
- Hardness and Algorithms for Rainbow Connectivity
- Small cycle double covers of products I: Lexicographic product with paths and cycles
This page was built for publication: Rainbow vertex-connection and graph products
