PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (210)
Orphanage
Unclass'd (1)
Unproven (472)
Corrections (37)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very low Entry average rating: No information on entry rating
minor (of a graph) (Definition)

A graph $ H$ is a minor of $ G$, written $ G \succ H$ or $ H \prec G$, if it is a subgraph of a graph obtained from $ G$ by a sequence of edge-contractions.

Adapted with permission of the author from Modern Graph Theory by Béla Bollobás, published by Springer-Verlag New York, Inc., 1998.



"minor (of a graph)" is owned by digitalis.
(view preamble)

View style:

See Also: graph minor theorem

Other names:  minor
Keywords:  contraction
Log in to rate this entry.
(view current ratings)

Cross-references: edge-contractions, sequence, subgraph, graph
There are 11 references to this entry.

This is version 1 of minor (of a graph), born on 2002-03-07, modified 2002-03-07.
Object id is 2770, canonical name is MinorOfAGraph.
Accessed 4747 times total.

Classification:
AMS MSC: 05C99 (Combinatorics :: Graph theory :: Miscellaneous)
Pending Errata and Addenda
None.
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | add derivation | add example | add (any)