An exact lower bound on the number of cut‐sets in multigraphs

DOI10.1002/NET.3230240804zbMath0817.90128OpenAlexW2166711092MaRDI QIDQ4319529

Zheng Sun, Hiroshi Nagamochi, Hideaki Harada

Publication date: 16 February 1995

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240804

zbMATH Keywords

cut-setundirected multigraph

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)

This page was built for publication: An exact lower bound on the number of cut‐sets in multigraphs