Hi,
It would be beneficial for the program to support standard stream-based input, particularly graph6 data piped from tools like geng.
This is somewhat similar to pickg in nauty, or to planarg. For exmaple, we have 64 non-isomorphic connected planar graphs with 7 vertices and14 edges.
geng 7 14 -c |planarg
It gives us:
FCr~w
FCZ~w
FCz^w
FEjvw
FEj^w
FEh~w
FEj~o
FEvvW
FEl~o
FEl}w
FQjvw
FQzVw
FQzmw
FQz^o
FQy}w
FUZvo
>Z 64 graphs read from stdin, 16 written to stdout; 0.00 sec.
It is also beneficial for the program to terminate once the first, or the first several, such graphs are obtained. This is especially valuable when one is searching for either an example or a counterexample.
Just for example, we want find three 10-vertex 1-planar graphs with 30 edges or five 10-vertex non-1-planar graphs with 30 edges .
Licheng
Hi,
It would be beneficial for the program to support standard stream-based input, particularly graph6 data piped from tools like geng.
This is somewhat similar to
pickginnauty, or toplanarg. For exmaple, we have 64 non-isomorphic connected planar graphs with 7 vertices and14 edges.geng 7 14 -c |planargIt gives us:
It is also beneficial for the program to terminate once the first, or the first several, such graphs are obtained. This is especially valuable when one is searching for either an example or a counterexample.
Just for example, we want find three 10-vertex 1-planar graphs with 30 edges or five 10-vertex non-1-planar graphs with 30 edges .
Licheng