The following pages link to (Q3178806):
Displaying 7 items.
- Simple proofs of results on paths representing all colors in proper vertex-colorings (Q879947) (← links)
- Upper bounds of proper connection number of graphs (Q2410035) (← links)
- On proper-path colorings in graphs (Q2829346) (← links)
- Properly colored paths and cycles in complete graphs (Q2887147) (← links)
- List coloring under some graph operations (Q5059492) (← links)
- Proper Coloring Distance in Edge-Colored Cartesian Products of Complete Graphs and Cycles (Q5087858) (← links)
- Proper colorability of segment intersection graphs (Q6168981) (← links)