Zobrazeno 1 - 2
of 2
pro vyhledávání: '"METIS-237578"'
Autor:
Bonsma, P.S.
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::f8d0547d9a28bb94a1229f531c2b4a8f
https://research.utwente.nl/en/publications/spanning-trees-with-many-leaves-new-extremal-results-and-an-improved-fpt-algorithm(52a33dc4-a6e4-4b67-af65-29a969cba8c2).html
https://research.utwente.nl/en/publications/spanning-trees-with-many-leaves-new-extremal-results-and-an-improved-fpt-algorithm(52a33dc4-a6e4-4b67-af65-29a969cba8c2).html
We present two lower bounds for the maximum number of leaves in a spanning tree of a graph. For connected graphs without triangles, with minimum degree at least three, we show that a spanning tree with at least (n+4)/3 leaves exists, where n is the n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=dris___00893::0250eace2a21d1667323450da84177bd