Hello Minh, Thanks again for the fast response. I fixed my code to have the graphs I need make a copy and add to a seperate list ... for C in graphs(3): if C.is_connected(): G = copy(C) L.append( G ) A = G.adjacency_matrix() ... This seems to work. I'm just starting out with Sage and python. I see you are the author of sage.graphs.graph_coloring.edge_coloring() I am about to study that to see how easily it could be modified to do a different edge coloring, detectable. The detectable coloring is such that no vertices have the same number of colors. That is, for three colors, that each vertex has a uniqque vector ( num red, num blue, num yellow ). I hope you might be able to answer some questions when I run into them. Thanks,Michael Vogt561 338-7151
--- On Sat, 3/6/10, Minh Nguyen <[email protected]> wrote: From: Minh Nguyen <[email protected]> Subject: Re: [sage-support] Re: set_edge_label is setting labels on intended and unintended graph To: [email protected] Date: Saturday, March 6, 2010, 2:19 PM Hi Michael, On Sun, Mar 7, 2010 at 6:03 AM, m_p_v_13 <[email protected]> wrote: <SNIP> > Should this property of the iterators to the generated graphs be > documented? This is now ticket #8458: http://trac.sagemath.org/sage_trac/ticket/8458 -- Regards Minh Van Nguyen -- 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-support URL: http://www.sagemath.org -- 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-support URL: http://www.sagemath.org
