Add graph to GT: tadpole_6_2

math1um / objects-invariants-properties

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

Add graph to GT: tadpole_6_2 #598

Closed math1um closed 3 years ago

math1um commented 6 years ago

The graph which is a cycle on 6 vertices amalgamated to a path on 3 vertices is a counterexample to the conjecture:

If a graph is not matching robust then the graph is maximal triangle-free

tadpole_6_2 = graphs.TadpoleGraph(6,2)

math1um commented 6 years ago

See: https://en.wikipedia.org/wiki/Tadpole_graph

jaritaes99 commented 3 years ago

added