default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDRita Zuazua
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j15]Marta Borowiecka-Olszewska
, Ewa Drgas-Burchardt, Rita Zuazua:
On interval colouring reorientation number of oriented graphs. Discret. Appl. Math. 360: 65-80 (2025)- 2023
- [c1]Hanna Furmanczyk, Rita Zuazua:
Adjacent vertex distinguishing total coloring of corona products (Brief Announcement). LAGOS 2023: 382-384 - 2021
- [j14]Hanna Furmanczyk, Rita Zuazua:
Equitable total coloring of corona of cubic graphs. Discuss. Math. Graph Theory 41(4): 1147-1163 (2021)
2010 – 2019
- 2019
- [j13]César Hernández-Cruz, Magdalena Lemanska, Rita Zuazua:
A characterization of trees having a minimum vertex cover which is also a minimum total dominating set. Australas. J Comb. 73: 334-345 (2019) - [j12]Magda Dettlaff, Magdalena Lemanska, Juan Alberto Rodríguez-Velázquez, Rita Zuazua:
On the super domination number of lexicographic product graphs. Discret. Appl. Math. 263: 118-129 (2019) - [j11]Magdalena Lemanska, Joaquín Tey, Rita Zuazua:
Relations between edge removing and edge subdivision concerning domination number of a graph. Discret. Appl. Math. 263: 212-219 (2019) - [j10]Magdalena Lemanska, Eduardo Rivera-Campo, Radoslaw Ziemann, Rita Zuazua, Pawel Zylinski:
Convex dominating sets in maximal outerplanar graphs. Discret. Appl. Math. 265: 142-157 (2019) - 2017
- [j9]Ferran Hurtado, Mercè Mora, Eduardo Rivera-Campo, Rita Zuazua:
Distance 2-domination in prisms of graphs. Discuss. Math. Graph Theory 37(2): 383-397 (2017) - [j8]Magdalena Lemanska, Rita Zuazua, Pawel Zylinski:
Total Dominating Sets in Maximal Outerplanar Graphs. Graphs Comb. 33(4): 991-998 (2017) - 2016
- [j7]Magda Dettlaff, Magdalena Lemanska, Gabriel Semanisin, Rita Zuazua:
Some variations of perfect graphs. Discuss. Math. Graph Theory 36(3): 661-668 (2016) - 2015
- [j6]Susan A. van Aardt, Alewyn P. Burger, Jean E. Dunbar, Marietjie Frick, Bernardo Llano, Carsten Thomassen, Rita Zuazua:
Destroying longest cycles in graphs and digraphs. Discret. Appl. Math. 186: 251-259 (2015) - [j5]Ana Paulina Figueroa, Mika Olsen, Rita Zuazua:
On the vertices of a 3-partite tournament not in triangles. Discret. Math. 338(11): 1982-1988 (2015) - [j4]Diana Avella-Alaminos, Magda Dettlaff, Magdalena Lemanska, Rita Zuazua:
Total domination multisubdivision number of a graph. Discuss. Math. Graph Theory 35(2): 315-327 (2015) - 2014
- [j3]Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Bernardo Llano, Rita Zuazua:
Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs. Graphs Comb. 30(4): 783-800 (2014) - 2012
- [j2]Magdalena Lemanska, Rita Zuazua:
Convex universal fixers. Discuss. Math. Graph Theory 32(4): 807-812 (2012) - 2010
- [j1]Ana Paulina Figueroa, Bernardo Llano, Rita Zuazua:
The number of C3-free vertices on 3-partite tournaments. Discret. Math. 310(19): 2482-2488 (2010)
1990 – 1999
- 1999
- [b1]Rita Zuazua:
Árboles algoritmicos en la teoría de Bocses. UNAM, Mexico, 1999
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-09 13:01 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:
