The following pages link to A proof of Boesch's conjecture (Q4305122):
Displaying 18 items.
- A generalization of Boesch's theorem (Q409456) (← links)
- On the characterization of graphs with maximum number of spanning trees (Q1377718) (← links)
- Invulnerability of planar two-tree networks (Q1733045) (← links)
- On locally most reliable three-terminal graphs of sparse graphs (Q2130800) (← links)
- Network reliability in Hamiltonian graphs (Q2234742) (← links)
- Classes of uniformly most reliable graphs for all-terminal reliability (Q2322865) (← links)
- On Uniformly Optimal Networks: A Reversal of Fortune? (Q2876220) (← links)
- A survey of some network reliability analysis and synthesis results (Q3057110) (← links)
- On the Number of All Substructures Containing at Most Four Edges (Q5050770) (← links)
- A simple proof of the Gross‐Saccoman multigraph conjecture (Q6064167) (← links)
- On maximum graphs in Tutte polynomial posets (Q6064837) (← links)
- Fast reliability ranking of matchstick minimal networks (Q6065903) (← links)
- Dr. Charles L. Suffel: Scholar, teacher, mentor, friend (Q6085882) (← links)
- Uniformly optimally reliable graphs: A survey (Q6085885) (← links)
- Network reliability: Heading out on the highway (Q6087070) (← links)
- The <scp>Gross–Saccoman</scp> conjecture is true (Q6087152) (← links)
- <scp>M</scp>ost reliable two‐terminal graphs with node failures (Q6092632) (← links)
- More reliable graphs are not always stronger (Q6179694) (← links)
