Abstract
AbstractIn 1966, Gallai conjectured that for any simple, connected graph G having n vertices, there is a path‐decomposition of G having at most paths. In this article, we show that for any simple graph G having girth , there is a path‐decomposition of G having at most paths, where is the number of vertices of odd degree in G and is the number of nonisolated vertices of even degree in G.
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 callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
