Rainbow connectivity and rainbow criticality on graph classes

DOI10.1016/j.dam.2021.04.017zbMath1502.05112OpenAlexW3157143338MaRDI QIDQ2091815

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

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

pathscyclesconnectivitygraph operationscoloring of graphscoloring of hypergraphs

Mathematics Subject Classification ID

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

Cites Work

• Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
• Hardness and algorithms for rainbow connection
• Rainbow connections of graphs: a survey
• Rainbow Colouring of Split and Threshold Graphs
• Bounds for the rainbow connection number of graphs
• Rainbow connection in graphs
• Rainbow Connection of Random Regular Graphs
• Rainbow Connection in Graphs with Minimum Degree Three
• Decompositions into spanning rainbow structures
• Unnamed Item

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