1 citations · 1 across the 4 of their papers we have counts for
1 paper · 2 filters
Mirko Petruševski, Riste Škrekovski
An odd graph is a finite graph all of whose vertices have odd degrees. Given graph G is decomposable into k odd subgraphs if its edge set can be partitioned into k subsets ea…