Pages that link to "Item:Q1656907"
From MaRDI portal
The following pages link to Conflict-free connections of graphs (Q1656907):
Displaying 19 items.
- On conflict-free connection of graphs (Q1727736) (← links)
- Graphs with conflict-free connection number two (Q1756118) (← links)
- Odd connection and odd vertex-connection of graphs (Q1800421) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- From colourful to rainbow paths in graphs: colouring the vertices (Q2051888) (← links)
- Conflict-free connection number and size of graphs (Q2051890) (← 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)
- Conflict-free vertex connection number at most 3 and size of graphs (Q2227116) (← links)
- Conflict-free vertex-connections of graphs (Q2282464) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- The conflict-free vertex-connection number and degree conditions of graphs (Q2676761) (← links)
- Maximum value of conflict-free vertex-connection number of graphs (Q4554541) (← 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)
- Loose edge-connection of graphs (Q6166663) (← links)
- A survey on conflict-free connection coloring of graphs (Q6497946) (← links)
