default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn Baptist Gauci
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j18]John Baptist Gauci, Cheryl Zerafa Xuereb:
The planar crossing number of some quartic circulant graphs. Art Discret. Appl. Math. 7(3): 3 (2024)- 2023
- [j17]Marién Abreu, John Baptist Gauci, Domenico Labbate, Federico Romaniello, Jean Paul Zerafa:
Perfect matchings, Hamiltonian cycles and edge-colourings in a class of cubic graphs. Ars Math. Contemp. 23(3) (2023) - 2022
- [j16]John Baptist Gauci, Jean Paul Zerafa
:
A note on fractional covers of a graph. Art Discret. Appl. Math. 6(1): 1 (2022) - [j15]John Baptist Gauci, Jean Paul Zerafa:
Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants. Discret. Appl. Math. 321: 126-137 (2022) - 2021
- [j14]Marién Abreu, John Baptist Gauci, Domenico Labbate, Giuseppe Mazzuoccolo, Jean Paul Zerafa:
Extending Perfect Matchings to Hamiltonian Cycles in Line Graphs. Electron. J. Comb. 28(1): 1 (2021) - [j13]John Baptist Gauci, Silvano Martello:
Theory and applications in combinatorial optimization. J. Comb. Optim. 42(2): 207-211 (2021) - [j12]Gülnaz Boruzanli Ekinci, John Baptist Gauci:
The super-connectivity of odd graphs and of their kronecker double cover. RAIRO Oper. Res. 55(Supplement): S699-S704 (2021) - 2020
- [j11]Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha:
Existence of regular nut graphs for degree at most 11. Discuss. Math. Graph Theory 40(2): 533-557 (2020) - [j10]Gülnaz Boruzanli Ekinci, John Baptist Gauci:
The super-connectivity of Johnson graphs. Discret. Math. Theor. Comput. Sci. 22(1) (2020)
2010 – 2019
- 2019
- [j9]Irene Sciriha, Didar A. Ali, John Baptist Gauci, Khidir Sharaf:
The conductivity of superimposed key-graphs with a common one-dimensional adjacency nullspace. Ars Math. Contemp. 16(1): 141-155 (2019) - [j8]Gülnaz Boruzanli Ekinci, John Baptist Gauci:
On the reliability of generalized Petersen graphs. Discret. Appl. Math. 252: 2-9 (2019) - [j7]Irene Sciriha, Josef Lauri, John Baptist Gauci, Peter Borg:
Preface: The Second Malta Conference in Graph Theory and Combinatorics. Discret. Appl. Math. 266: 1-2 (2019) - [j6]Gülnaz Boruzanli Ekinci, John Baptist Gauci:
The super-connectivity of Kneser graphs. Discuss. Math. Graph Theory 39(1): 5-11 (2019) - [i2]Patrick W. Fowler, John Baptist Gauci, Jan Goedgebeur, Tomaz Pisanski, Irene Sciriha:
Existence of $d$-regular nut graphs for $d$ at most 11. CoRR abs/1908.11635 (2019) - 2016
- [j5]Alexander Farrugia, John Baptist Gauci, Irene Sciriha:
Complete graphs with zero diagonal inverse. Ars Math. Contemp. 11(2): 231-245 (2016) - [j4]Alexander Farrugia, John Baptist Gauci, Irene Sciriha:
Non-Singular graphs with a Singular Deck. Discret. Appl. Math. 202: 50-57 (2016) - 2015
- [i1]Gülnaz Boruzanli, John Baptist Gauci:
Super Connectivity of Generalized Petersen Graphs. CTW 2015: 246-249 - 2013
- [j3]John Baptist Gauci, Anthony J. W. Hilton, Dudley Stark:
Wiggles and Finitely Discontinuous k-to-1 Functions Between Graphs. J. Graph Theory 74(3): 275-308 (2013) - 2010
- [j2]J. Keith Dugdale, Stanley Fiorini, Anthony J. W. Hilton, John Baptist Gauci:
Continuous k-to-1 functions between complete graphs of even order. Discret. Math. 310(2): 330-346 (2010) - [j1]John Baptist Gauci, Anthony J. W. Hilton:
Continuous k-to-1 functions between complete graphs whose orders are of a different parity. J. Graph Theory 65(1): 35-60 (2010)
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 2025-01-21 00:11 CET 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:
