Edge Contraction in a Graph

Initializing live version
Download to Desktop

Requires a Wolfram Notebook System

Interact on desktop, mobile and cloud with the free Wolfram Player or other Wolfram Language products.

The contraction of an edge of a graph is the graph obtained by identifying the vertices and , and replacing them with a single vertex ; any edges that were incident to or are redirected to . This operation plays a major role in the analysis of graph coloring. You can chose a random graph and then choose which vertex is to be contracted. The graph at the top shows the edge to be contracted and the graph at the bottom shows the graph after the contraction.

Contributed by: Jaime Rangel-Mondragon (August 2011)
Open content licensed under CC BY-NC-SA




Feedback (field required)
Email (field required) Name
Occupation Organization
Note: Your message & contact information may be shared with the author of any specific Demonstration for which you give feedback.