Definition:Spanning Subgraph
Jump to navigation
Jump to search
The validity of the material on this page is questionable.
Should it not also be specified that $G$ should be connected, and so should such a subgraph?
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
Definition
Let $G$ be a graph.
A spanning subgraph for $G$ is a subgraph of $G$ which contains every vertex of $G$.
This is also called a factor of $G$.
Should it not also be specified that $G$ should be connected, and so should such a subgraph?
You can help $\mathsf{Pr} \infty \mathsf{fWiki}$ by resolving the issues.
To discuss this proof in more detail, feel free to use the talk page.
If you are able to fix this page, then when you have done so you can remove this instance of {{Questionable}} from the code.
If you would welcome a second opinion as to whether your correction is correct, add a call to {{Proofread}} the page (see the proofread template for usage).