14 citations · 34 across the 9 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DM2009★ 2 cited
Acyclic Edge coloring of Planar Graphs
Manu Basavaraju, L. Sunil Chandran
An edge coloring of a graph is a proper edge coloring such that there are no bichromatic cycles. The \emph{acyclic chromatic index} of a graph is the minimum number k suc…
cs.DS2009
Algorithm for Finding -Vertex Out-trees and its Application to -Internal Out-branching Problem
Nathann Cohen, Fedor V. Fomin, Gregory Gutin +3
An out-tree is an oriented tree with only one vertex of in-degree zero. A vertex of is internal if its out-degree is positive. We design randomized and deterministic al…