Minimum edge cuts in diameter 2 graphs

DOI10.7151/dmgt.2097zbMath1404.05101OpenAlexW2803807567WikidataQ129822175 ScholiaQ129822175MaRDI QIDQ1717218

Allan Bickle, Allen J. Schwenk

Publication date: 7 February 2019

Published in: Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.7151/dmgt.2097

zbMATH Keywords

diameteredge connectivity

Mathematics Subject Classification ID

Distance in graphs (05C12) Connectivity (05C40) Vertex degrees (05C07)

Related Items (1)

Characterization of general position sets and its applications to cographs and bipartite graphs

Cites Work

• On the chromatic index of almost all graphs
• Unnamed Item
• Unnamed Item

This page was built for publication: Minimum edge cuts in diameter 2 graphs