Daniel Gross

Name: dblp XML data dump
Creator: Schloss Dagstuhl - Leibniz Center for Informatics
Published: 1993
License: https://creativecommons.org/publicdomain/zero/1.0/
Keywords: dblp, XML, computer science, scholarly publications, metadata

◀ ▶ joint publications with L. William Kazmierczak

> Home > Persons > Daniel Gross

Publications

2013
[j9]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/GrossKSSS13
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/GrossKSSS13
Daniel Gross, L. William Kazmierczak, John T. Saccoman, Charles L. Suffel, Antonius Suhartomo:
On Component Order Edge Connectivity Of a Complete Bipartite Graph. Ars Comb. 112: 433-448 (2013)
2009
[j7]
- view
  authority control:
- export record
  dblp key:
  - journals/networks/BoeschGSKSS09
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/networks/BoeschGSKSS09
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)
2007
[j5]
- no documents available
  - no references & citations available
- export record
  dblp key:
  - journals/arscom/KazmierczakBGS07
- ask others
- share record
  persistent URL:
  - https://dblp.org/rec/journals/arscom/KazmierczakBGS07
L. William Kazmierczak, Frank Boesch, Daniel Gross, Charles L. Suffel:
Realizability Results Involving Two Connectivity Parameters. Ars Comb. 82 (2007)

a service of

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.