1 paper
Afrouz Jabalameli, Amin behjati, Morteza Saghafian +3
A graph is said to be diameter-k-critical if its diameter is k and removal of any of its edges increases its diameter. A beautiful conjecture by Murty and Simon, says that ever…