| Graph decomposition into paths under length constraints (2008) | |||||||||||||
Abstract | |||||||||||||
| Given 2 integers a and b, we define an (a,b)-decomposition of a graph G =(V,E) as a partition of E into paths where the length of each path lies between a and b. In this definition paths are requested to be simple but not necessarily elementary. In other words an (a,b)-decomposition corresponds to a partition E1,...,Ek of E with a | |||||||||||||
Publication details | |||||||||||||
| |||||||||||||