Rainbow connectivity and rainbow criticality on graph classes
From MaRDI portal
Publication:2091815
DOI10.1016/J.DAM.2021.04.017zbMATH Open1502.05112OpenAlexW3157143338MaRDI QIDQ2091815FDOQ2091815
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
Recommendations
Coloring of graphs and hypergraphs (05C15) Paths and cycles (05C38) Connectivity (05C40) Hypergraphs (05C65) Graph operations (line graphs, products, etc.) (05C76)
Cites Work
- Rainbow connections of graphs: a survey
- Rainbow connection in graphs
- Hardness and algorithms for rainbow connection
- Note on the complexity of deciding the rainbow (vertex-) connectedness for bipartite graphs
- Rainbow connection in graphs with minimum degree three
- Rainbow Connection of Random Regular Graphs
- Bounds for the rainbow connection number of graphs
- Rainbow Colouring of Split and Threshold Graphs
- Decompositions into spanning rainbow structures
- IARCS annual conference on foundations of software technology and theoretical computer science (FSTTCS 2011), Mumbai, India, December 12--14, 2011
Cited In (2)
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)