A forbidden minor characterization and reliability of a class of partial 4‐trees

DOI10.1002/net.3230250307zbMath0829.90057OpenAlexW1968018012MaRDI QIDQ4838206

No author found.

Publication date: 20 July 1995

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

all-terminal reliabilitypartial 4-treesseven forbidden minors

Mathematics Subject Classification ID

Stochastic network models in operations research (90B15) Reliability, availability, maintenance, inspection in operations research (90B25)

Related Items (2)

The structure of quasi 4-connected graphs ⋮ Network reliability: Heading out on the highway

Cites Work

• Unnamed Item

This page was built for publication: A forbidden minor characterization and reliability of a class of partial 4‐trees