Pages that link to "Item:Q1727736"
From MaRDI portal
The following pages link to On conflict-free connection of graphs (Q1727736):
Displaying 12 items.
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- On the \(k\)-component independence number of a tree (Q2045314) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Conflict-free connection number of random graphs (Q2192106) (← links)
- Hardness results for three kinds of colored connections of graphs (Q2202016) (← links)
- Monochromatic disconnection of graphs (Q2208356) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Strong conflict-free connection of graphs (Q2284053) (← 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)
