Soloman's profile - activity

2020-03-28 02:07:18 +0200	received badge	● Famous Question (source)
2018-09-04 17:59:19 +0200	received badge	● Famous Question (source)
2016-06-01 15:54:51 +0200	received badge	● Notable Question (source)
2016-06-01 15:51:45 +0200	received badge	● Notable Question (source)
2016-06-01 15:51:45 +0200	received badge	● Popular Question (source)
2015-01-27 23:09:18 +0200	received badge	● Popular Question (source)
2014-09-26 13:31:29 +0200	asked a question	How to list all the connected graphs with 9 vertices? What I want to do is exactly to list all the connected graphs with 9 vertices which are also `is_long_hole_free()==False`, i.e., contains an induced cycle of length at least 5. But I can only list all the graphs with a given number of vertices, for example `G = GraphQuery(display_cols=['graph6'], num_vertices=2) L = G.get_graphs_list() graphs_list.show_graphs(L)`
2014-09-21 05:13:53 +0200	asked a question	How to get a list of graphs whose independence number equals to chromatic number? The smallest number of colors needed to color a graph G is called its chromatic number, and is often denoted χ(G). The independence number α(G) of a graph G is the size of the largest independent set of G.