Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
From MaRDI portal
Publication:427574
Recommendations
Cites work
- scientific article; zbMATH DE number 1080085 (Why is no real title available?)
- scientific article; zbMATH DE number 3259770 (Why is no real title available?)
- scientific article; zbMATH DE number 3399275 (Why is no real title available?)
- Hardness and Algorithms for Rainbow Connectivity
- Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs
- Rainbow connection in graphs
- Rainbow connection in graphs with minimum degree three
- Rainbow connection number and connected dominating sets
Cited in
(6)- scientific article; zbMATH DE number 6719578 (Why is no real title available?)
- Rainbow connections for outerplanar graphs with diameter 2 and 3
- Strong rainbow connection numbers of toroidal meshes
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs
- On the general position numbers of maximal outerplane graphs
- Algorithm on rainbow connection for maximal outerplanar graphs
This page was built for publication: Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q427574)