Pages that link to "Item:Q2350709"
From MaRDI portal
The following pages link to Note on the hardness of rainbow connections for planar and line graphs (Q2350709):
Displaying 17 items.
- The \((k,\ell)\)-rainbow index of random graphs (Q263013) (← links)
- Hardness results for total rainbow connection of graphs (Q274688) (← links)
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Acyclic and star coloring of \(P_4\)-reducible and \(P_4\)-sparse graphs (Q668443) (← links)
- Injective coloring of some graph operations (Q1659655) (← links)
- More on the colorful monochromatic connectivity (Q1684281) (← links)
- Proper connection number of graph products (Q1714046) (← links)
- The \(k\)-proper index of graphs (Q1734744) (← links)
- Rainbow connection numbers of Cayley digraphs on abelian groups (Q1739982) (← links)
- On total rainbow \(k\)-connected graphs (Q1739988) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- On the complexity of \(k\)-rainbow cycle colouring problems (Q2422742) (← links)
- The complexity of determining the vertex-rainbow index of graphs (Q2788724) (← links)
- On various (strong) rainbow connection numbers of graphs (Q5374232) (← links)
- A survey on rainbow (vertex-)index of graphs (Q6130217) (← links)