Rainbow connection and graph products

DOI10.1007/S00373-013-1295-YzbMATH Open1291.05064OpenAlexW1979923107MaRDI QIDQ2014711FDOQ2014711

Authors: T. Gologranc, Gašper Mekiš, Iztok Peterin 

Publication date: 16 June 2014

Published in: Graphs and Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00373-013-1295-y

Recommendations

• Rainbow connection in graphs
• Rainbow connection in brick product graphs
• (Strong) rainbow connection number of three classes of graphs
• Rainbow vertex-connection and graph products
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

zbMATH Keywords

direct productstrong productlexicographic product(strong) rainbow connection number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40) Graph operations (line graphs, products, etc.) (05C76)

Cites Work

• On rainbow connection
• Handbook of product graphs
• The rainbow connectivity of a graph
• Rainbow connection in graphs
• Title not available (Why is that?)
• Hardness and algorithms for rainbow connection
• The rainbow connection of a graph is (at most) reciprocal to its minimum degree
• The Kronecker Product of Graphs
• Rainbow connection in graphs with minimum degree three
• A note on the connectivity of Kronecker products of graphs
• Game coloring the Cartesian product of graphs
• Title not available (Why is that?)
• Rainbow generalizations of Ramsey theory: A survey
• Bounds for the rainbow connection number of graphs
• On the connectivity of the direct product of graphs
• ON THE EDGE-CONNECTIVITY OF CARTESIAN PRODUCT GRAPHS
• Connectivity of strong products of graphs
• Isomorphic components of Kronecker product of bipartite graphs
• Small cycle double covers of products I: Lexicographic product with paths and cycles
• Convex sets in lexicographic products of graphs
• On the rainbow connection of Cartesian products and their subgraphs
• Title not available (Why is that?)
• Intervals and convex sets in strong product of graphs

Cited In (16)

• Rainbow connection number and graph operations
• The rainbow connection number of the power graph of a finite group
• On the rainbow connection of Cartesian products and their subgraphs
• Edge-transitive lexicographic and Cartesian products
• Rainbow connection in modified brick product graphs
• Rainbow connection in brick product graphs
• (Strong) rainbow connection on the splitting of 3-path
• (Strong) rainbow connection number of three classes of graphs
• Rainbow connection number of comb product of graphs
• The vertex-rainbow connection number of some graph operations
• Rainbow connection number of generalized composition
• Rainbow connection number of graph power and graph products
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths
• Rainbow connection of the join of two paths.
• Rainbow connection number of corona product of graphs
• Rainbow 2-connectivity of edge-comb product of a cycle and a Hamiltonian graph

This page was built for publication: Rainbow connection and graph products

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2014711)