Pages that link to "Item:Q2284053"
From MaRDI portal
The following pages link to Strong conflict-free connection of graphs (Q2284053):
Displaying 6 items.
- Conflict-free connections of graphs (Q1656907) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Some results on strong conflict-free connection number of graphs (Q5025141) (← links)
- Conflict-free (vertex)-connection numbers of graphs with small diameters (Q5109070) (← links)
- Conflict-free connection number of graphs with four bridges (Q6045132) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)