Characterize all C5-free diameter-2-critical graphs with at least ⌊(n-1)24⌋+1 edges

Qiao Lin, Xiaolin Wang. Characterize all C5-free diameter-2-critical graphs with at least ⌊(n-1)24⌋+1 edges. Discrete Applied Mathematics, 375:332-337, 2025. [doi]

Abstract

Abstract is missing.