Abstract
AbstractIn the study of decompositions of graphs into paths and cycles, the following questions have arisen: Is it true that every graph G has a smallest path (resp. path‐cycle) decomposition P such that every odd vertex of G is the endpoint of exactly one path of P? This note gives a negative answer to both questions.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Paper version not known
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
