Supereulerian Graphs And Approximal Algorithm Of Channel Assignment With Constraints

In this paper,the main work is about spanning eulerian graphs and approximation algorithm for channel assignment with certain constraints.In section 2,the conjecture that every 2-connected biclaw-free graph G withδ(G)≥4 has a spanning eulerian subgraph H with maximum degreeΔ(H)≤4 in[3]is answered to the negative.In section 3,an approximation algorithm for channel assignment with certain constraints for so-called hexagon graphs is given.