Nathann Cohen

most citedAcyclic Edge coloring of Planar Graphs

2 citations · 2 across the 1 of their papers we have counts for

collaborators

2 papers

cs.DM2009★ 2 cited

Acyclic Edge coloring of Planar Graphs

Manu Basavaraju, L. Sunil Chandran

An $a cy c l i c$ 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 $k$ -Vertex Out-trees and its Application to $k$ -Internal Out-branching Problem

Nathann Cohen, Fedor V. Fomin, Gregory Gutin +3

An out-tree $T$ is an oriented tree with only one vertex of in-degree zero. A vertex $x$ of $T$ is internal if its out-degree is positive. We design randomized and deterministic al…

Acyclic Edge coloring of Planar Graphs

Algorithm for Finding k-Vertex Out-trees and its Application to k-Internal Out-branching Problem

Algorithm for Finding $k$ -Vertex Out-trees and its Application to $k$ -Internal Out-branching Problem