Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDavid Cariolaro
Person information
- affiliation: Xi'an Jiaotong-Liverpool University, Suzhou, China
- affiliation: Academia Sinica, Taipei, Taiwan
- affiliation: University of Reading, UK
- David Cariolaro passed away in January 2014
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2016
[j17]David Cariolaro, Romeo Rizzi:
On the Complexity of Computing the Excessive [B]-Index of a Graph. J. Graph Theory 82(1): 65-74 (2016)- 2015
- [j16]David Cariolaro, Giuseppe Mazzuoccolo
:
Excessive [l, m]-factorizations. Discret. Math. 338(11): 1917-1927 (2015) - 2014
- [j15]Romeo Rizzi, David Cariolaro:
Polynomial Time Complexity of Edge Colouring Graphs with Bounded Colour Classes. Algorithmica 69(3): 494-500 (2014) - [j14]David Cariolaro, Gianfranco L. Cariolaro, Uwe Schauz, Xu Sun:
The list-chromatic index of K6. Discret. Math. 322: 15-18 (2014) - [i1]David Cariolaro, Zhaiming Shen, Yi Zhang:
Group Testing with Pools of Fixed Size. CoRR abs/1407.3631 (2014) - 2012
- [j13]Saieed Akbari, David Cariolaro, Malihehsadat Chavooshi, Maryam Ghanbari, Sanaz Zare:
Some criteria for a graph to be Class 1. Discret. Math. 312(17): 2593-2598 (2012) - 2010
- [j12]David Cariolaro, Romeo Rizzi:
Excessive factorizations of bipartite multigraphs. Discret. Appl. Math. 158(16): 1760-1766 (2010) - [j11]David Cariolaro, Hung-Lin Fu:
Covering graphs with matchings of fixed size. Discret. Math. 310(2): 276-287 (2010)
2000 – 2009
- 2009
- [j10]David Cariolaro, Hung-Lin Fu:
The Excessive [3]-Index of All Graphs. Electron. J. Comb. 16(1) (2009) - [j9]David Cariolaro:
A theorem in edge colouring. Discret. Math. 309(12): 4208-4209 (2009) - [j8]David Cariolaro, Hung-Lin Fu:
Excessive near 1-factorizations. Discret. Math. 309(14): 4690-4696 (2009) - [j7]David Cariolaro, Anthony J. W. Hilton:
An application of Tutte's Theorem to 1-factorization of regular graphs of high degree. Discret. Math. 309(14): 4736-4745 (2009) - 2008
- [j6]David Cariolaro:
An adjacency lemma for critical multigraphs. Discret. Math. 308(20): 4791-4795 (2008) - [j5]David Cariolaro, Hung-Lin Fu:
On minimum sets of 1-factors covering a complete multipartite graph. J. Graph Theory 58(3): 239-250 (2008) - 2007
- [j4]David Cariolaro:
On the Ramsey number R(3, 6). Australas. J Comb. 37: 301-304 (2007) - 2006
- [j3]David Cariolaro:
On fans in multigraphs. J. Graph Theory 51(4): 301-318 (2006) - 2003
- [j2]David Cariolaro, Gianfranco L. Cariolaro:
Colouring the Petals of a Graph. Electron. J. Comb. 10 (2003)
1990 – 1999
- 1997
- [j1]Carlo Bertoluzza, David Cariolaro:
On the measure of a fuzzy set based on continuous t-conorms. Fuzzy Sets Syst. 88(3): 355-362 (1997)
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-04-25 05:53 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:
