The following pages link to (Q5501833):
Displaying 6 items.
- Improved approximation algorithms for path vertex covers in regular graphs (Q2006949) (← links)
- Degree tolerant coloring of graph (Q2061289) (← links)
- Improper interval edge colorings of graphs (Q2235270) (← links)
- Minimum \(k\)-path vertex cover (Q2275922) (← links)
- Splitting Planar Graphs of Girth 6 into Two Linear Forests with Short Paths (Q4978291) (← links)
- Distributed deterministic edge coloring using bounded neighborhood independence (Q5920296) (← links)