Cai Leizhen

Leizhen Cai

Information about the author Leizhen Cai will soon be added to the site.
Found 3 papers in total
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k‐Way Cut Problem
Tight Approximation Ratio of a General Greedy Splitting Algorithm for the Minimum k‐Way Cut Problem
2011
For an edge‐weighted connected undirected graph, the minimum k ‐way cut...
Edge colouring line graphs of unicyclic graphs
Edge colouring line graphs of unicyclic graphs
1992
The chromatic index problem is known to be NP-complete, even for line graphs. In this...
NP-completeness of edge-colouring some restricted graphs
NP-completeness of edge-colouring some restricted graphs
1991
The problem of determining the chromatic index of a regular graph of fixed degree...
Papers per page: