Pages that link to "Item:Q427574"
From MaRDI portal
The following pages link to Polynomial algorithm for sharp upper bound of rainbow connection number of maximal outerplanar graphs (Q427574):
Displayed 5 items.
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Strong rainbow connection numbers of toroidal meshes (Q4554570) (← links)
- An integer program and new lower bounds for computing the strong rainbow connection numbers of graphs (Q6065850) (← links)
- On the general position numbers of maximal outerplane graphs (Q6090821) (← links)