Rainbow connectivity and rainbow criticality on graph classes

DOI10.1016/J.DAM.2021.04.017MaRDI QIDQ2091815zbMATH OpenOpenAlexFDO

Authors Aleffer Rocha, Sheila M. Almeida, Leandro M. Zatesko

Publication date 2 November 2022

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2021.04.017

zbMATH Keywords

pathsconnectivitycyclesgraph operationscoloring of graphscoloring of hypergraphs

Mathematics Subject Classification ID

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

Recommendations

• Rainbow connection in graphs
• Rainbow connection in brick product graphs
• Rainbow connection numbers of middle and total graphs
• The rainbow 2-connectivity of Cartesian products of 2-connected graphs and paths

Cites work

• Bounds for the rainbow connection number of graphs
• Decompositions into spanning rainbow structures
• Hardness and algorithms for rainbow connection
• IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12--14, 2011
• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• Rainbow Colouring of Split and Threshold Graphs
• Rainbow connection in graphs
• Rainbow connection in graphs with minimum degree three
• Rainbow connection of random regular graphs

Cited in

(2)

• An Algebraic Characterization of Rainbow Connectivity
• Total-rainbow connection and forbidden subgraphs

This page was built for publication: Rainbow connectivity and rainbow criticality on graph classes

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