1 votes 1 votes Let G be a simple graph in which every vertex has degree 3. Prove that G decomposes into claws iff G is bipartite. Graph Theory graph-theory discrete-mathematics + – Sammohan Ganguly asked Apr 15, 2018 Sammohan Ganguly 321 views answer comment Share Follow See all 0 reply Please log in or register to add a comment.
Best answer 1 votes 1 votes Your answer Kushagra Chatterjee answered Apr 15, 2018 selected Apr 15, 2018 by Sammohan Ganguly Kushagra Chatterjee comment Share Follow See all 0 reply Please log in or register to add a comment.