research
∙
08/05/2022
Approximation algorithms for covering vertices by long paths
Given a graph, the general problem to cover the maximum number of vertic...
share
research
∙
05/13/2020
Acyclic edge coloring conjecture is true on planar graphs without intersecting triangles
An acyclic edge coloring of a graph G is a proper edge coloring such tha...
research
∙
10/03/2019
