Pages that link to "Item:Q383747"
From MaRDI portal
The following pages link to The rainbow connection number of 2-connected graphs (Q383747):
Displaying 23 items.
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- Sufficient conditions for 2-rainbow connected graphs (Q298982) (← links)
- Rainbow connection number and independence number of a graph (Q343733) (← links)
- Tight upper bound of the rainbow vertex-connection number for 2-connected graphs (Q400500) (← links)
- Rainbow connection of graphs with diameter 2 (Q408184) (← links)
- Rainbow connection number and connectivity (Q426778) (← links)
- Rainbow connection in oriented graphs (Q477332) (← links)
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (Q482191) (← links)
- Rainbow connection number and the number of blocks (Q489352) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Strong rainbow connection in digraphs (Q1701123) (← links)
- Rainbow connections in digraphs (Q1752466) (← links)
- A sharp upper bound for the rainbow 2-connection number of a 2-connected graph (Q1942665) (← links)
- The hitting time of rainbow connection number two (Q1953346) (← links)
- Upper bounding rainbow connection number by forest number (Q2138952) (← links)
- The vertex-rainbow connection number of some graph operations (Q2227111) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Rainbow connection number, bridges and radius (Q2637724) (← links)
- Rainbow Connection Numbers for Undirected Double-Loop Networks (Q2942464) (← links)
- Graphs with rainbow connection number two (Q3089355) (← links)
- Revised rainbow vertex-connection number of 2-connected graphs (Q3175395) (← links)
- (Q5367789) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
