#9779: Grotzsch graph and Mycielski graphs
----------------------------------+-----------------------------------------
Reporter: edward.scheinerman | Owner: jason, ncohen, rlm
Type: enhancement | Status: new
Priority: major | Milestone:
Component: graph theory | Keywords:
Author: Ed Scheinerman | Upstream: N/A
Reviewer: | Merged:
Work_issues: |
----------------------------------+-----------------------------------------
Added methods to create the Grotzsch graph and the Mycielski graphs. The
Mycielski graphs are a sequence of triangle-free graphs with arbitrarily
high chromatic number. The Grotzsch graph is (isomorphic to) the fourth
graph in this series; it it triangle-free and has chromatic number equal
to 4.
--
Ticket URL: <http://trac.sagemath.org/sage_trac/ticket/9779>
Sage <http://www.sagemath.org>
Sage: Creating a Viable Open Source Alternative to Magma, Maple, Mathematica,
and MATLAB
--
You received this message because you are subscribed to the Google Groups
"sage-trac" group.
To post to this group, send email to [email protected].
To unsubscribe from this group, send email to
[email protected].
For more options, visit this group at
http://groups.google.com/group/sage-trac?hl=en.
