2022-01-24 19:31:44 +0200 | received badge | ● Notable Question (source) |

2017-08-04 12:34:11 +0200 | received badge | ● Famous Question (source) |

2014-06-26 16:36:29 +0200 | received badge | ● Notable Question (source) |

2014-02-01 17:33:54 +0200 | received badge | ● Taxonomist |

2013-12-08 13:26:41 +0200 | received badge | ● Popular Question (source) |

2013-10-08 22:18:17 +0200 | received badge | ● Popular Question (source) |

2012-10-16 11:42:44 +0200 | received badge | ● Nice Question (source) |

2011-09-20 20:45:56 +0200 | marked best answer | Determining Complete Multipartite Graphs (Specifically Tripartite) You're getting that error because there is no Then, you'd use it like to test for complete tripartiteness. |

2011-09-15 16:28:43 +0200 | commented answer | Determining Complete Multipartite Graphs (Specifically Tripartite) Thanks! I'll give it try. |

2011-09-14 17:41:08 +0200 | asked a question | Determining Complete Multipartite Graphs (Specifically Tripartite) I have been reading the Sage References, and it does not seem that complete multipartite graphs are defined in Sage yet. I have tried to critique the following two lines of code to see if it would work for complete multipartite graphs. I get a "graph attribute needed" error. I just wanted to verify that this is the case. Thanks again for the help! |

2011-09-07 01:08:51 +0200 | commented answer | Determining Complete Bipartite Graphs I have been reading the Sage References, and it does not seem that complete multipartite graphs are defined in Sage yet. I have tried to critique the code you have provide to try and see if it would work for complete multipartite graphs. I get a "graph attribute needed" error. I just wanted to verify that this is the case. Thanks again for the help! |

2011-09-01 18:03:53 +0200 | commented answer | Determining Complete Bipartite Graphs Thanks for the help! I got what I wanted. |

2011-09-01 18:02:49 +0200 | marked best answer | Determining Complete Bipartite Graphs You can use the following function to test if a graph is complete bipartite: Then, you can do to get your list of complete bipartites. |

2011-09-01 18:02:49 +0200 | received badge | ● Scholar (source) |

2011-09-01 18:02:46 +0200 | received badge | ● Supporter (source) |

2011-09-01 14:14:46 +0200 | received badge | ● Student (source) |

2011-08-30 11:56:35 +0200 | asked a question | Determining Complete Bipartite Graphs I have generated an extremely large list of graphs. Do you know if there is a way to determine which graphs in the list are Complete Bipartite graphs? I have tried a filter function: dd = filter(lambda x:x.completebipatitegraphs(), d), but it gives me an "attribute needed" error. Any help is greatly appreciated! |

Copyright Sage, 2010. Some rights reserved under creative commons license. Content on this site is licensed under a Creative Commons Attribution Share Alike 3.0 license.