default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFrancis T. Boesch
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2000 – 2009
- 2009
[j27]Frank Boesch, Daniel Gross, John T. Saccoman, L. William Kazmierczak, Charles L. Suffel, Antonius Suhartomo:
A generalization of an edge-connectivity theorem of Chartrand. Networks 54(2): 82-89 (2009)- [j26]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
A survey of some network reliability analysis and synthesis results. Networks 54(2): 99-107 (2009) - 2007
- [j25]L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel:
Realizability Results Involving Two Connectivity Parameters. Ars Comb. 82 (2007)
1990 – 1999
- 1998
- [j24]Louis Petingi, Frank Boesch, Charles L. Suffel:
On the characterization of graphs with maximum number of spanning trees. Discret. Math. 179(1-3): 155-166 (1998) - 1996
- [j23]Frank Boesch, Daniel Gross, Charles L. Suffel:
A coherent model for reliability of multiprocessor networks. IEEE Trans. Reliab. 45(4): 678-684 (1996) - 1995
- [j22]Francis T. Boesch, Xiaoming Li, José Rodríguez:
Graphs with Most Number of Three Point Induced Connected Subgraphs. Discret. Appl. Math. 59(1): 1-10 (1995) - 1991
- [j21]Francis T. Boesch, Xiaoming Li, Charles L. Suffel:
On the existence of uniformly optimally reliable networks. Networks 21(2): 181-194 (1991) - 1990
- [j20]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
Least reliable networks and the reliability domination. IEEE Trans. Commun. 38(11): 2004-2009 (1990)
1980 – 1989
- 1989
- [c2]Francis T. Boesch, Appajosyula Satyanarayana, Charles L. Suffel:
On Residual Connectedness Network Reliability. Reliability Of Computer And Communication Networks 1989: 51-60 - 1988
- [c1]Francis T. Boesch:
On the synthesis of optimally reliable networks having unreliable nodes but reliable edges. INFOCOM 1988: 829-834 - 1986
- [j19]Francis T. Boesch, Helmut Prodinger:
Spanning tree formulas and chebyshev polynomials. Graphs Comb. 2(1): 191-200 (1986) - [j18]Francis T. Boesch:
On unreliability polynomials and graph connectivity in reliable network synthesis. J. Graph Theory 10(3): 339-352 (1986) - 1985
- [j17]Francis T. Boesch, James A. M. McHugh:
An edge extremal result for subcohesion. J. Comb. Theory B 38(1): 1-7 (1985) - [j16]Douglas Bauer, Frank Boesch, Charles L. Suffel, Ralph Tindell:
Combinatorial optimization problems in the analysis and design of probabilistic networks. Networks 15(2): 257-271 (1985) - 1984
- [j15]Frank Boesch, Ralph Tindell:
Circulants and their connectivities. J. Graph Theory 8(4): 487-499 (1984) - [j14]Francis T. Boesch:
Reviews in graph theory, edited by William G. Brown, American Mathematical Society, 1980. Volumes I, II, III, IV (paperback). Networks 14(1): 173 (1984) - 1982
- [j13]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point, q-line graphs with prescribed point connectivity, line connectivity, or minimum degree. Networks 12(3): 341-350 (1982) - 1981
- [j12]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and point-connectivity. Discret. Appl. Math. 3(1): 9-18 (1981) - [j11]Frank Boesch, Frank Harary, Jerald A. Kabell:
Graphs as models of communication network vulnerability: Connectivity and persistence. Networks 11(1): 57-63 (1981) - [j10]Jin Akiyama, Frank Boesch, Hiroshi Era, Frank Harary, Ralph Tindell:
The cohesiveness of a point of a graph. Networks 11(1): 65-68 (1981) - [j9]Frank Boesch:
Editorial. Networks 11(2): 93 (1981) - 1980
- [j8]Francis T. Boesch, Charles L. Suffel:
Realizability of p-point graphs with prescribed minimum degree, maximum degree, and line connectivity. J. Graph Theory 4(4): 363-370 (1980)
1970 – 1979
- 1978
- [j7]Frank Boesch:
Editorial. Networks 8(1): iii (1978) - [j6]Francis T. Boesch, Frank Harary:
Unicyclic realizability of a degree list. Networks 8(2): 93-96 (1978) - 1977
- [j5]Francis T. Boesch, James F. Gimpel:
Covering Points of a Digraph with Point-Disjoint Paths and Its Application to Code Optimization. J. ACM 24(2): 192-198 (1977) - [j4]Francis T. Boesch, Charles L. Suffel, Ralph Tindell:
The spanning subgraphs of eulerian graphs. J. Graph Theory 1(1): 79-84 (1977) - 1973
- [j3]Francis T. Boesch:
Changing careers in science and engineering edited by Sanborn C. Brown, MIT Press, 1972, 349 pages. Networks 3(1): 95-96 (1973) - 1972
- [j2]Francis T. Boesch, Alan P. Felzer:
A general class of invulnerable graphs. Networks 2(3): 261-283 (1972) - [j1]Francis T. Boesch:
Lower bounds on the vulnerability of a graph. Networks 2(4): 329-340 (1972)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-06-10 21:26 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
