default search action
John Sheehan
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2022
- [j22]Marién Abreu, Domenico Labbate, Federico Romaniello, John Sheehan:
Even orientations and pfaffian graphs. Bull. ICA 95: 70-83 (2022) - 2021
- [i2]Michael Barry, Claudio Gambella, Fabio Lorenzi, John Sheehan, Joern Ploennigs:
Optimal Seat Allocation Under Social Distancing Constraints. CoRR abs/2105.05017 (2021)
2010 – 2019
- 2016
- [c2]John S. Erickson
, John Sheehan, Kristin P. Bennett, Deborah L. McGuinness
Addressing Scientific Rigor in Data Analytics Using Semantic Workflows. IPAW 2016: 187-190 - 2014
- [j21]Marién Abreu
Odd 2-factored snarks. Eur. J. Comb. 36: 460-472 (2014) - 2013
- [j20]Domenico Labbate
A counterexample to the odd 2-factored snarks conjecture. Electron. Notes Discret. Math. 40: 205-210 (2013) - [c1]Ken Inoue, Davide Pasetto, Karol Lynch, Massimiliano Meneghin, Kay Müller, John Sheehan:
Low-latency and high bandwidth TCP/IP protocol processing through an integrated HW/SW approach. INFOCOM 2013: 2967-2975 - 2012
- [j19]Marién Abreu
Irreducible pseudo 2-factor isomorphic cubic bipartite graphs. Des. Codes Cryptogr. 64(1-2): 153-160 (2012) - [j18]Marién Abreu
Pseudo and strongly pseudo 2-factor isomorphic regular graphs and digraphs. Eur. J. Comb. 33(8): 1847-1856 (2012) - [i1]Marién Abreu, Domenico Labbate, Romeo Rizzi, John Sheehan:
Odd 2-factored snarks. CoRR abs/1210.8101 (2012)
2000 – 2009
- 2009
- [j17]Marién Abreu
Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. J. Comb. Theory B 99(1): 271-273 (2009) - 2008
- [j16]Marién Abreu
Pseudo 2-factor isomorphic regular bipartite graphs. J. Comb. Theory B 98(2): 432-442 (2008) - 2006
- [j15]Peter J. Cameron
Semiregular automorphisms of vertex-transitive cubic graphs. Eur. J. Comb. 27(6): 924-930 (2006) - 2005
- [j14]Robert E. L. Aldred, Derek A. Holton, John Sheehan:
2-factors with prescribed and proscribed edges. J. Graph Theory 49(1): 48-58 (2005) - 2004
- [j13]Robert E. L. Aldred, Martin Funk
Regular bipartite graphs with all 2-factors isomorphic. J. Comb. Theory B 92(1): 151-161 (2004) - [j12]Marién Abreu
Graphs and digraphs with all 2-factors isomorphic. J. Comb. Theory B 92(2): 395-404 (2004) - 2003
- [j11]Martin Funk
2-Factor hamiltonian graphs. J. Comb. Theory B 87(1): 138-144 (2003) - [j10]Martin Funk
Det-extremal cubic bipartite graphs. J. Graph Theory 44(1): 50-64 (2003) - 2002
- [j9]John Sheehan:
Minimum multiplicities of subgraphs and Hamiltonian cycles. Discret. Math. 255(1-3): 357-366 (2002)
1990 – 1999
- 1999
- [j8]M. A. Seoud, A. E. I. Abd el Maqsoud, John Sheehan:
Gracefulness of the union of cycles and paths. Ars Comb. 54 (1999) - 1997
- [j7]Bill Jackson, John Sheehan:
The structure of transform graphs. Discret. Math. 177(1-3): 123-144 (1997) - 1993
- [b1]Derek A. Holton, John Sheehan:
The Petersen graph. Australian mathematical society lecture series 7, Cambridge University Press 1993, ISBN 978-0-521-43594-9, pp. 1-353 - 1992
- [j6]John Sheehan:
Balanced graphs with minimum degree constraints. Discret. Math. 102(3): 307-314 (1992) - 1990
- [j5]John Sheehan:
Balanced graphs with edge density constraints. J. Graph Theory 14(6): 673-685 (1990)
1980 – 1989
- 1988
- [j4]John Sheehan:
Graph decomposition with constraints on the minimum degree. Discret. Math. 68(2-3): 299-307 (1988) - 1984
- [j3]Michael Purser, Chris Horn, John Sheehan:
The PHS Protocol. Softw. Pract. Exp. 14(4): 299-310 (1984)
1970 – 1979
- 1977
- [j2]John Sheehan:
Graphs with exactly one hamiltonian circuit. J. Graph Theory 1(1): 37-43 (1977) - 1974
- [j1]John Sheehan:
Non-bipartite graphs of girth 4. Discret. Math. 8(4): 383-402 (1974)
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 20:29 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: