Pages that link to "Item:Q2202016"
From MaRDI portal
The following pages link to Hardness results for three kinds of colored connections of graphs (Q2202016):
Displaying 8 items.
- Rainbow monochromatic \(k\)-edge-connection colorings of graphs (Q2045397) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← links)
- Rainbow and monochromatic vertex-connection of random graphs (Q2087672) (← links)
- Monochromatic vertex-disconnection colorings of graphs (Q2147602) (← links)
- The proper 2-connection number and size of graphs (Q2166240) (← links)
- Conflict-free connection number of graphs with four bridges (Q6045132) (← links)
- (1, 2)-rainbow connection number at most 3 in connected dense graphs (Q6090318) (← links)
- Constraining MC-numbers by the connectivity of complement graphs (Q6177407) (← links)