Objects, Invariants and Properties for Graph Theory (GT) automated conjecturing: in particular with the Sage program CONJECTURING: http://nvcleemp.github.io/conjecturing/
GNU General Public License v3.0
14
stars
6
forks
source link
is_factor_critical property has mistake in docstring #616
def is_factor_critical(g):
"""
Return whether or not a graph "g" is factor-critical.
A graph is factor-critical if order is odd and removal of any vertex gives graph with perfect matching
INPUT:
-``g``-- Sage graph
OUTPUT:
-Boolean value
EXAMPLES:
sage: is_factor_critical(graphs.PathGraph(3))
False
sage: is_factor_critical(graphs.CycleGraph(5))
True
SHOULD BE:
sage: is_factor_critical(graphs.PathGraph(3)) True
OLD:
def is_factor_critical(g): """ Return whether or not a graph "g" is factor-critical.