default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJosé Zamora
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j23]José Aliste-Prieto
, Anna de Mier, Rosa C. Orellana, José Zamora:
Marked Graphs and the Chromatic Symmetric Function. SIAM J. Discret. Math. 37(3): 1881-1919 (2023)- [c2]Gabriela Araujo-Pardo, Martín Matamala, José Zamora:
Counting lines in semi-complete digraphs *. LAGOS 2023: 352-359 - [i4]Andrea Jiménez, Kolja Knauer, Carla Negri Lintzmayer, Martín Matamala, Juan Pablo Peña, Daniel A. Quiroz, Maycon Sambinelli, Yoshiko Wakabayashi, Weiqiang Yu, José Zamora:
Boundedness for proper conflict-free and odd colorings. CoRR abs/2308.00170 (2023) - 2022
- [j22]Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora:
Clique immersions and independence number. Eur. J. Comb. 106: 103550 (2022) - [j21]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property. J. Graph Theory 100(4): 638-652 (2022) - 2021
- [j20]José Aliste-Prieto, Logan Crew, Sophie Spirkl, José Zamora:
A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function. Electron. J. Comb. 28(2): 2 (2021) - [j19]José Aliste-Prieto, Anna de Mier, José Zamora:
On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial. Discret. Math. 344(3): 112255 (2021) - 2020
- [j18]Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive numbers. Discret. Appl. Math. 281: 246-251 (2020) - [j17]Martín Matamala, José Zamora:
Lines in bipartite graphs and in 2-metric spaces. J. Graph Theory 95(4): 565-585 (2020) - [i3]Pierre Aboulker, Laurent Beaudou, Martín Matamala, José Zamora:
Graphs with no induced house nor induced hole have the de Bruijn-Erdős property. CoRR abs/2005.09447 (2020)
2010 – 2019
- 2019
- [c1]Sebastián Bustamante, Daniel A. Quiroz, Maya Stein, José Zamora:
Large Immersions in Graphs with Independence Number 3 and 4. LAGOS 2019: 221-228 - 2018
- [j16]Martín Matamala, José Zamora:
Weighted antimagic labeling. Discret. Appl. Math. 245: 194-201 (2018) - [j15]José Aliste-Prieto, José Zamora, Anna de Mier:
On graphs with the same restricted U-polynomial and the U-polynomial for rooted graphs. Electron. Notes Discret. Math. 68: 185-190 (2018) - [j14]Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture. J. Graph Theory 87(1): 77-88 (2018) - [j13]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
χ-bounded families of oriented graphs. J. Graph Theory 89(3): 304-326 (2018) - 2017
- [j12]José Aliste-Prieto, Anna de Mier, José Zamora:
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem. Discret. Math. 340(6): 1435-1441 (2017) - [j11]Martín Matamala, José Zamora:
Graphs admitting antimagic labeling for arbitrary sets of positive integers. Electron. Notes Discret. Math. 62: 159-164 (2017) - 2016
- [i2]Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
$χ$-bounded families of oriented graphs. CoRR abs/1605.07411 (2016) - [i1]Pierre Aboulker, Martín Matamala, Paul Rochet, José Zamora:
A new class of graphs that satisfies the Chen-Chvátal Conjecture. CoRR abs/1606.06011 (2016) - 2015
- [j10]Martín Matamala, José Zamora:
Weighted antimagic labeling: an algorithmic approach. Electron. Notes Discret. Math. 50: 127-132 (2015) - [j9]Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora:
Injective Colorings with Arithmetic Constraints. Graphs Comb. 31(6): 2003-2017 (2015) - 2014
- [j8]José Aliste-Prieto, José Zamora:
Proper caterpillars are distinguished by their chromatic symmetric function. Discret. Math. 315-316: 158-164 (2014) - 2013
- [j7]Martín Matamala, José Zamora:
Nowhere-Zero 5-Flows and Even (1, 2)-Factors. Graphs Comb. 29(3): 609-616 (2013) - [j6]Maya Stein, José Zamora:
Forcing Large Complete (Topological) Minors in Infinite Graphs. SIAM J. Discret. Math. 27(2): 697-707 (2013) - 2011
- [j5]Maya Stein, José Zamora:
The relative degree and large complete minors in infinite graphs. Electron. Notes Discret. Math. 37: 129-134 (2011)
2000 – 2009
- 2009
- [j4]Martín Matamala, José Zamora:
Degree Sequence of Tight Distance Graphs. Electron. Notes Discret. Math. 35: 329-334 (2009) - 2008
- [j3]Martín Matamala, José Zamora:
A new family of expansive graphs. Discret. Appl. Math. 156(7): 1125-1131 (2008) - [j2]Martín Matamala, José Zamora:
Nowhere-zero 5-flows and (1, 2)-factors. Electron. Notes Discret. Math. 30: 279-284 (2008) - 2005
- [j1]Martín Matamala, José Zamora:
A new family of K-divergent graphs. Electron. Notes Discret. Math. 19: 357-363 (2005)
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-04 03:03 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:
