Pages that link to "Item:Q408184"
From MaRDI portal
The following pages link to Rainbow connection of graphs with diameter 2 (Q408184):
Displaying 15 items.
- Rainbow connections for outerplanar graphs with diameter 2 and 3 (Q279540) (← links)
- Rainbow connection number of amalgamation of some graphs (Q322063) (← links)
- Rainbow connection number of graphs with diameter 3 (Q503673) (← links)
- Algorithm on rainbow connection for maximal outerplanar graphs (Q517025) (← links)
- Tight Nordhaus-Gaddum-type upper bound for total-rainbow connection number of graphs (Q681264) (← links)
- Proper connection numbers of complementary graphs (Q723592) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Total rainbow connection numbers of some special graphs (Q2279465) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- Rainbow connection for some families of hypergraphs (Q2449162) (← links)
