Pages that link to "Item:Q4636339"
From MaRDI portal
The following pages link to Properly Colored Connectivity of Graphs (Q4636339):
Displaying 19 items.
- The \((k,\ell )\)-proper index of graphs (Q721930) (← links)
- On conflict-free connection of graphs (Q1727736) (← links)
- Conflict-free connection number and independence number of a graph (Q2025169) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- Matrix formulation of EISs of graphs and its application to WSN covering problems (Q2036024) (← links)
- Conflict-free connection of trees (Q2051900) (← links)
- Proper-walk connection of Hamiltonian digraphs (Q2141233) (← links)
- Two sufficient conditions for 2-connected graphs to have proper connection number 2 (Q2186294) (← 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)
- Matrix approach to formulate and search \(k\)-ESS of graphs using the STP theory (Q2240198) (← links)
- Extremal stretch of proper-walk coloring of graphs (Q2243237) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- On the total proper connection of graphs (Q2272614) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- (Strong) conflict-free connectivity: algorithm and complexity (Q2283032) (← links)
- Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles (Q5087858) (← links)
- (Strong) proper vertex connection of some digraphs (Q6096379) (← links)
