F. T. Boesch

Available identifiers

zbMath Open boesch.frank-tMaRDI QIDQ1149962

List of research outcomes

Publication	Date of Publication	Type
A generalization of an edge-connectivity theorem of Chartrand	2010-11-24	Paper
A survey of some network reliability analysis and synthesis results	2010-11-24	Paper
https://portal.mardi4nfdi.de/entity/Q5443253	2008-02-20	Paper
https://portal.mardi4nfdi.de/entity/Q5310249	2007-09-21	Paper
https://portal.mardi4nfdi.de/entity/Q3429563	2007-04-02	Paper
Some Alternate Characterizations of Reliability Domination	2007-01-19	Paper
https://portal.mardi4nfdi.de/entity/Q4470355	2004-06-22	Paper
https://portal.mardi4nfdi.de/entity/Q4489250	2000-12-13	Paper
https://portal.mardi4nfdi.de/entity/Q4393334	1998-10-19	Paper
On the characterization of graphs with maximum number of spanning trees	1998-09-14	Paper
https://portal.mardi4nfdi.de/entity/Q3838400	1998-08-09	Paper
https://portal.mardi4nfdi.de/entity/Q4390608	1998-05-26	Paper
https://portal.mardi4nfdi.de/entity/Q4381261	1998-05-13	Paper
https://portal.mardi4nfdi.de/entity/Q4873800	1996-04-21	Paper
The neighborhood inclusion structure of a graph	1994-09-11	Paper
https://portal.mardi4nfdi.de/entity/Q4035356	1993-05-18	Paper
Least reliable networks and the reliability domination	1992-06-25	Paper
On the existence of uniformly optimally reliable networks	1991-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3821913	1988-01-01	Paper
Combinatorial optimization problems in the analysis and design of probabilistic networks	1985-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3343742	1984-01-01	Paper
Realizability ofp-point,q-line graphs with prescribed point connectivity, line connectivity, or minimum degree	1982-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3960779	1982-01-01	Paper
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity	1981-01-01	Paper
The cohesiveness of a point of a graph	1981-01-01	Paper
https://portal.mardi4nfdi.de/entity/Q3922713	1981-01-01	Paper
Graphs as models of communication network vulnerability: Connectivity and persistence	1981-01-01	Paper
Robbins's Theorem for Mixed Multigraphs	1980-01-01	Paper
Realizability of p‐point graphs with prescribed minimum degree, maximum degree, and line connectivity	1980-01-01	Paper
Unicyclic realizability of a degree list	1978-01-01	Paper
The spanning subgraphs of eulerian graphs	1977-01-01	Paper
On minimum multigraphs with prescribed lower bounds on local line connectivities	1976-01-01	Paper
Line removal algorithms for graphs and their degree lists	1976-01-01	Paper

Research outcomes over time

Doctoral students

No records found.

Known relations from the MaRDI Knowledge Graph

Property	Value
MaRDI profile type	MaRDI person profile
instance of	human

This page was built for person: F. T. Boesch