default search action
Pablo De Caria Di Fonzo
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j17]Pablo De Caria Di Fonzo
:
Cycle intersection in spanning trees: A shorter proof of a conjecture and applications. Discret. Appl. Math. 350: 10-14 (2024) - 2022
- [j16]Pablo De Caria
Intersection graphs of induced subtrees of any graph and a generalization of chordal graphs. Discret. Appl. Math. 323: 171-183 (2022) - 2020
- [j15]Pablo De Caria:
Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs. Discret. Appl. Math. 281: 151-161 (2020)
2010 – 2019
- 2019
- [c1]Pablo De Caria:
Families of Induced Trees and Their Intersection Graphs. LAGOS 2019: 265-274 - 2017
- [j14]Pablo De Caria:
On the recognition of neighborhood inclusion posets. Electron. Notes Discret. Math. 62: 285-290 (2017) - 2016
- [j13]Pablo De Caria, Marisa Gutierrez:
On basic chordal graphs and some of its subclasses. Discret. Appl. Math. 210: 261-276 (2016) - 2015
- [j12]Pablo De Caria, Marisa Gutierrez:
Determining possible sets of leaves for spanning trees of dually chordal graphs. Ars Comb. 122: 13-20 (2015) - [j11]Pablo De Caria, Miguel A. Pizaña:
On second iterated clique graphs that are also third iterated clique graphs. Electron. Notes Discret. Math. 50: 319-324 (2015) - 2014
- [j10]Pablo De Caria, Marisa Gutierrez:
On the correspondence between tree representations of chordal and dually chordal graphs. Discret. Appl. Math. 164: 500-511 (2014) - [j9]Pablo De Caria, Terry A. McKee:
Maxclique and unit disk characterizations of strongly chordal graphs. Discuss. Math. Graph Theory 34(3): 593-602 (2014) - [j8]Pablo De Caria, Marisa Gutierrez:
Special Eccentric Vertices for the Class of Chordal Graphs and Related Classes. Graphs Comb. 30(2): 343-352 (2014) - [j7]Pablo De Caria:
The Images of the Clique Operator and Its Square are Different. J. Graph Theory 77(1): 39-57 (2014) - 2013
- [j6]Pablo De Caria, Marisa Gutierrez:
Introducing subclasses of basic chordal graphs. Electron. Notes Discret. Math. 44: 287-292 (2013) - 2012
- [j5]Pablo De Caria, Marisa Gutierrez:
On minimal vertex separators of dually chordal graphs: Properties and characterizations. Discret. Appl. Math. 160(18): 2627-2635 (2012) - [j4]Pablo De Caria, Marisa Gutierrez:
Determining what sets of trees can be the clique trees of a chordal graph. J. Braz. Comput. Soc. 18(2): 121-128 (2012) - 2011
- [j3]Pablo De Caria, Marisa Gutierrez:
Comparing trees characteristic to chordal and dually chordal graphs. Electron. Notes Discret. Math. 37: 33-38 (2011) - [j2]Pablo De Caria:
The difference between clique graphs and iterated clique graphs. Electron. Notes Discret. Math. 37: 39-44 (2011)
2000 – 2009
- 2009
- [j1]Pablo De Caria, Marisa Gutierrez:
Minimal vertex separators and new characterizations for dually chordal graphs. Electron. Notes Discret. Math. 35: 127-132 (2009)
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-08-03 20:11 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: