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 diameter-2-critical graphs from Dailly-Foucaud-Hansberg paper #643
There is one called H_5 and 13 others, labeled (a) through (m).
Call these H_5, D2C-a, D2C-b,..., D2C-m,
and put them in appropriate graph lists (add_to_list())
and give the reference and explanation that D2C means "diameter-2-critical" in a docstring:
Dailly, Antoine, Florent Foucaud, and Adriana Hansberg. "Strengthening the Murty–Simon conjecture on diameter 2 critical graphs." Discrete Mathematics 342, no. 11 (2019): 3142-3159.
The paper is attached. dailly-foucaud-Hansberg-murty-simon-conj-2019.pdf