Graph minor
Subgraph with contracted edges
Summary
In graph theory, an undirected graph H is called a minor of the graph G if H can be formed from G by deleting edges and vertices and by contracting edges.
Originally created by AxelBoldt
10/30/2003, 11:26:15 AM
Modified
4/27/2026, 6:41:39 AM
Recent revisions
[[Wikipedia:OABOT|Open access bot]]: hdl updated in citation with #oabot.
link (via [[WP:JWB]])
Fixed a series out of control.
/* Induced minors */ expand
/* Induced minors */ Add link for convenience
Added isbn. | [[:en:WP:UCB|Use this tool]]. [[:en:WP:DBUG|Report bugs]]. | #UCB_Gadget
ce
better paramater usage
[[Diameter (graph theory)]]
Reverted edit by [[Special:Contribs/666-Bandera Mouse|666-Bandera Mouse]] ([[User talk:666-Bandera Mouse|talk]]) to last version by Joriki
I bet you won't find a reliable source that says that this is easy to see :-)
Undid revision 1187752081 by [[Special:Contributions/Citation bot|Citation bot]] ([[User talk:Citation bot|talk]]) continued title breakage, no sign of efforts to fix the problem, continued addition of junk s2cids, no sign of efforts to fix the problem. Citation bot is a net negative to the project and should be stopped.
Alter: title. Add: s2cid, isbn. | [[:en:WP:UCB|Use this bot]]. [[:en:WP:DBUG|Report bugs]]. | Suggested by Headbomb | Linked from Wikipedia:WikiProject_Academic_Journals/Journals_cited_by_Wikipedia/Sandbox | #UCB_webform_linked 757/1304
cite repair;
[[Wikipedia:OABOT|Open access bot]]: doi updated in citation with #oabot.
[[Wikipedia:OABOT|Open access bot]]: doi updated in citation with #oabot.
sfn fix
repetitive
[[Wikipedia:OABOT|Open access bot]]: doi added to citation with #oabot.
