Graphs with largest number of minimum cuts

DOI10.1016/0166-218X(95)00043-QzbMath0858.05062MaRDI QIDQ1917282

Myriam Preissmann, Frédéric Maffray, Jenő Lehel

Publication date: 23 March 1997

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

extremal graphsconnectivitycuts

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35)

Cites Work

• Unnamed Item
• Unnamed Item
• A structure theorem for the consecutive 1's property
• Efficient algorithm for finding all minimal edge cuts of a nonoriented graph
• Counting the number of minimum cuts in undirected multigraphs
• The Minimum Number of Edges and Vertices in a Graph with Edge Connectivity n and m n‐Bonds
• A good algorithm for smallest spanning trees with a degree constraint

This page was built for publication: Graphs with largest number of minimum cuts