Pages that link to "Item:Q1684944"
From MaRDI portal
The following pages link to Coloring graphs to produce properly colored walks (Q1684944):
Displaying 11 items.
- Conflict-free connections of graphs (Q1656907) (← links)
- Properly colored trails, paths, and bridges (Q1702827) (← links)
- Digraphs with proper connection number two (Q2034401) (← links)
- Proper-walk connection of Hamiltonian digraphs (Q2141233) (← links)
- A classification of edge-colored graphs based on properly colored walks (Q2192112) (← links)
- Extremal stretch of proper-walk coloring of graphs (Q2243237) (← links)
- Proper connection and proper-walk connection of digraphs (Q2245028) (← links)
- Distributions on graphs and walks (Q2780949) (← links)
- Green walks in a hypergraph (Q4236815) (← links)
- On the (di)graphs with (directed) proper connection number two (Q5918844) (← links)
- Proper‐walk connection number of graphs (Q6055386) (← links)