José Zamora

Orcid: 0000-0003-0455-8856

According to our database1, José Zamora authored at least 26 papers between 2005 and 2023.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2023
Marked Graphs and the Chromatic Symmetric Function.
SIAM J. Discret. Math., September, 2023

Boundedness for proper conflict-free and odd colorings.
CoRR, 2023

Counting lines in semi-complete digraphs *.
Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022
Graphs with no induced house nor induced hole have the de Bruijn-Erdös property.
J. Graph Theory, 2022

Clique immersions and independence number.
Eur. J. Comb., 2022

2021
On the smallest trees with the same restricted U-polynomial and the rooted U-polynomial.
Discret. Math., 2021

A Vertex-Weighted Tutte Symmetric Function, and Constructing Graphs with Equal Chromatic Symmetric Function.
Electron. J. Comb., 2021

2020
Lines in bipartite graphs and in 2-metric spaces.
J. Graph Theory, 2020

Graphs admitting antimagic labeling for arbitrary sets of positive numbers.
Discret. Appl. Math., 2020

2019
Large Immersions in Graphs with Independence Number 3 and 4.
Proceedings of the tenth Latin and American Algorithms, Graphs and Optimization Symposium, 2019

2018
A New Class of Graphs That Satisfies the Chen-Chvátal Conjecture.
J. Graph Theory, 2018

χ-bounded families of oriented graphs.
J. Graph Theory, 2018

On graphs with the same restricted <i>U</i>-polynomial and the <i>U</i>-polynomial for rooted graphs.
Electron. Notes Discret. Math., 2018

Weighted antimagic labeling.
Discret. Appl. Math., 2018

2017
Graphs admitting antimagic labeling for arbitrary sets of positive integers.
Electron. Notes Discret. Math., 2017

On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem.
Discret. Math., 2017

2015
Injective Colorings with Arithmetic Constraints.
Graphs Comb., 2015

Weighted antimagic labeling: an algorithmic approach.
Electron. Notes Discret. Math., 2015

2014
Proper caterpillars are distinguished by their chromatic symmetric function.
Discret. Math., 2014

2013
Forcing Large Complete (Topological) Minors in Infinite Graphs.
SIAM J. Discret. Math., 2013

Nowhere-Zero 5-Flows and Even (1, 2)-Factors.
Graphs Comb., 2013

2011
The relative degree and large complete minors in infinite graphs.
Electron. Notes Discret. Math., 2011

2009
Degree Sequence of Tight Distance Graphs.
Electron. Notes Discret. Math., 2009

2008
Nowhere-zero 5-flows and (1, 2)-factors.
Electron. Notes Discret. Math., 2008

A new family of expansive graphs.
Discret. Appl. Math., 2008

2005
A new family of K-divergent graphs.
Electron. Notes Discret. Math., 2005


  Loading...