Pages that link to "Item:Q2866459"
From MaRDI portal
The following pages link to Rainbow connection in sparse graphs (Q2866459):
Displaying 16 items.
- Sufficient conditions for 2-rainbow connected graphs (Q298982) (← links)
- A note on the minimum size of \(k\)-rainbow-connected graphs (Q397136) (← links)
- Conflict-free connections of graphs (Q1656907) (← links)
- On minimally rainbow \(k\)-connected graphs (Q1941399) (← links)
- Minimum degree and size conditions for the proper connection number of graphs (Q2010690) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Rainbow connection number and graph operations (Q2399294) (← links)
- Proper connection and size of graphs (Q2401802) (← links)
- Rainbow connection for some families of hypergraphs (Q2449162) (← links)
- Proper rainbow connection number of graphs (Q2656335) (← links)
- Rainbow vertex connection number of dense and sparse graphs. (Q2828968) (← links)
- Smallest \(k\)-rainbow connected graphs for large \(k\) (Q2869375) (← links)
- Graphs with rainbow connection number two (Q3089355) (← links)
- Bounds for the rainbow connection number of graphs (Q3089362) (← links)
- Loose edge-connection of graphs (Q6166663) (← links)