On Thu, 12 Oct 2017, David Coudert wrote:
Many authors avoid the empty graph (see e.g., the excellent book "Graph
Theory with Applications" by Bondy and Murty) as there are no consensus
on its properties. Should it be considered connected ? biconnected ?
hamiltonian ? minor-free ? transitively
Le mercredi 11 octobre 2017 16:36:07 UTC+2, Dima Pasechnik a écrit :
>
>
>
> On Wednesday, October 11, 2017 at 10:20:02 AM UTC+1, Jori Mäntysalo wrote:
>>
>> On Wed, 11 Oct 2017, David Joyner wrote:
>>
>> >> 1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a
>> >> graph of 0 v
(There is #24004 with positive_review, so I code changes should be thinked
after next beta.)
On Wed, 11 Oct 2017, Robert Miller wrote:
4) When is augment='edges' usefull? Is
One reason it is useful:
You can use the argument "property" to restrict to a subclass of graphs. This
argument
On Tue, Oct 10, 2017 at 10:45 PM, Jori Mäntysalo
wrote:
> 4) When is augment='edges' usefull? Is
>
One reason it is useful:
You can use the argument "property" to restrict to a subclass of graphs.
This argument takes a function and filters the output by testing against
this property. If this pr
On Wednesday, October 11, 2017 at 10:20:02 AM UTC+1, Jori Mäntysalo wrote:
>
> On Wed, 11 Oct 2017, David Joyner wrote:
>
> >> 1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a
> >> graph of 0 vertices. Can someone ask McKay to handle this special case
> >> too?
>
> > Would
On Wed, 11 Oct 2017, David Joyner wrote:
1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a
graph of 0 vertices. Can someone ask McKay to handle this special case
too?
Wouldn't it be easier to simply catch that case in the nauty_geng method?
Could be done, but needs some
On Oct 11, 2017 1:45 AM, "Jori Mäntysalo" wrote:
1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a graph
of 0 vertices. Can someone ask McKay to handle this special case too?
Wouldn't it be easier to simply catch that case in the nauty_geng method?
2) Is there an example of
1) list(graphs.nauty_geng(0)) gives empty list, whereas Sage knows a graph
of 0 vertices. Can someone ask McKay to handle this special case too?
2) Is there an example of graph property that holds after deleting any
vertex but not necessarily after deleting an edge? Or the converse?
3) Curren
