Size in maximal triangle-free graphs and minimal graphs of diameter 2
From MaRDI portal
Publication:1842148
DOI10.1016/0012-365X(94)00190-TzbMath0821.05031MaRDI QIDQ1842148
Kathryn Fraughnaugh, Karen Casey, David C. Fisher, Frank Harary, Curtiss Barefoot
Publication date: 3 October 1995
Published in: Discrete Mathematics (Search for Journal in Brave)
Related Items
The edge spectrum of the saturation number for small paths, Sufficient conditions for triangle-free graphs to be super \(k\)-restricted edge-connected, Matching cutsets in graphs of diameter 2, The game of \(\mathcal F\)-saturator, Hamiltonicity, diameter, domination, packing, and biclique partitions of Mycielski's graphs, Gaps in the saturation spectrum of trees, On \((\mathrm{K}_t-e)\)-saturated graphs, The edge spectrum of \(K_4^-\)-saturated graphs, Strengthening the Murty-Simon conjecture on diameter 2 critical graphs, Saturation spectrum of paths and stars
Cites Work