Pages that link to "Item:Q2857035"
From MaRDI portal
The following pages link to Rainbow connection number of dense graphs (Q2857035):
Displayed 18 items.
- Finite families of forbidden subgraphs for rainbow connection in graphs (Q297932) (← links)
- Sufficient conditions for 2-rainbow connected graphs (Q298982) (← links)
- On forbidden subgraphs and rainbow connection in graphs with minimum degree 2 (Q482191) (← links)
- Graphs with vertex rainbow connection number two (Q498122) (← links)
- Rainbow connection in some digraphs (Q503612) (← links)
- Erdős-Gallai-type results for colorful monochromatic connectivity of a graph (Q512870) (← links)
- Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2 (Q898171) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- Some extremal results on the colorful monochromatic vertex-connectivity of a graph (Q1752632) (← links)
- Rainbow connections of graphs: a survey (Q1938889) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Rainbow connection and forbidden subgraphs (Q2346333) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Graphs with small total rainbow connection number (Q2405975) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- The rainbow connection number of the power graph of a finite group (Q2631090) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)