User:Jan Winnicki/Maximum internal spanning tree

This is not a Wikipedia article: It is an individual user's work-in-progress page, and may be incomplete and/or unreliable. For guidance on developing this draft, see Wikipedia:So you made a userspace draft.

Find sources: Google (books · news · scholar · free images · WP refs) · FENS · JSTOR · TWL
Easy tools: Citation bot (help) | Advanced: Fix bare URLs
This page was last edited by Cydebot (talk | contribs) 6 years ago. (Update timer)

Finished writing a draft article? Are you ready to request an experienced editor review it for possible inclusion in Wikipedia? Submit your draft for review!

Given a connected, undirected graph, a maximum internal spanning tree (MaxIST) of that graph is a spanning tree that maximizes the number of internal vertices among all of its spanning trees.

References

External links

www.example.com