Pages that link to "Item:Q2283032"

The following pages link to (Strong) conflict-free connectivity: algorithm and complexity (Q2283032):

Displayed 6 items.

• On the \(k\)-component independence number of a tree (Q2045314) ‎ (← links)
• Conflict-free connection number of random graphs (Q2192106) ‎ (← links)
• Hardness results for three kinds of colored connections of graphs (Q2202016) ‎ (← 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)