The following pages link to (Q5279726):
Displaying 13 items.
- Coloring graphs to produce properly colored walks (Q1684944) (← links)
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- (Strong) total proper connection of some digraphs (Q2045035) (← links)
- Proper-walk connection of Hamiltonian digraphs (Q2141233) (← links)
- Optimal proper connection of graphs (Q2192984) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- Note on directed proper connection number of a random graph (Q2279590) (← links)
- Graphs with (strong) proper connection numbers \(m - 3\) and \(m - 4\) (Q2698135) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5920180) (← links)
- (Strong) proper vertex connection of some digraphs (Q6096379) (← links)
- Some results on (strong) total proper connection number of some digraphs (Q6611051) (← links)
