output
20072026
most citedAcyclic edge-coloring using entropy compression

92 citations

researchers with a paper here
collaborating institutions
Showing 2013 · math.COShow all

1 paper · 2 filters

math.CO2013

Decomposition into two trees with orientation constraints

Olivier Durand de Gevigney

We prove that deciding whether the edge set of a graph can be partitionned into two spanning trees with orientation constraints is NP-complete. If P NP then this disproves a…