Spanning trees with at most k leaves in K::1, 4::-free graphs

Aung Kyaw. Spanning trees with at most k leaves in K::1, 4::-free graphs. Discrete Mathematics, 311(20):2135-2142, 2011. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.