A proof of Boesch's conjecture
From MaRDI portal
Publication:4305122
DOI10.1002/net.3230240504zbMath0826.90060OpenAlexW2066303074WikidataQ123073615 ScholiaQ123073615MaRDI QIDQ4305122
Publication date: 23 November 1995
Published in: Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/net.3230240504
Programming involving graphs or networks (90C35) Reliability, availability, maintenance, inspection in operations research (90B25)
Related Items (18)
On locally most reliable three-terminal graphs of sparse graphs ⋮ On the Number of All Substructures Containing at Most Four Edges ⋮ On the characterization of graphs with maximum number of spanning trees ⋮ A simple proof of the Gross‐Saccoman multigraph conjecture ⋮ On maximum graphs in Tutte polynomial posets ⋮ Fast reliability ranking of matchstick minimal networks ⋮ Dr. Charles L. Suffel: Scholar, teacher, mentor, friend ⋮ Uniformly optimally reliable graphs: A survey ⋮ Network reliability: Heading out on the highway ⋮ The <scp>Gross–Saccoman</scp> conjecture is true ⋮ <scp>M</scp>ost reliable two‐terminal graphs with node failures ⋮ A generalization of Boesch's theorem ⋮ More reliable graphs are not always stronger ⋮ Invulnerability of planar two-tree networks ⋮ Network reliability in Hamiltonian graphs ⋮ A survey of some network reliability analysis and synthesis results ⋮ Classes of uniformly most reliable graphs for all-terminal reliability ⋮ On Uniformly Optimal Networks: A Reversal of Fortune?
Cites Work
This page was built for publication: A proof of Boesch's conjecture
