Oscar Ordaz

According to our database1, Oscar Ordaz authored at least 25 papers between 1985 and 2015.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2015
Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory.
J. Comb. Theory A, 2015

Barycentric and zero-sum Ramsey numbers.
Ars Comb., 2015

Quality-based bottom-up design of reference architecture applied to Healthcare Integrated Information Systems.
Proceedings of the 9th IEEE International Conference on Research Challenges in Information Science, 2015

2013
Some remarks on barycentric-sum problems over cyclic groups.
Eur. J. Comb., 2013

Graph modelling of a refactoring process for Product Line Architecture design.
Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013

2008
Representation of group elements as subsequence sums.
Discret. Math., 2008

2004
Existence conditions for barycentric sequences.
Discret. Math., 2004

Barycentric sequences and barycentric Ramsey numbers stars.
Discret. Math., 2004

2001
Some remarks on Davenport constant.
Discret. Math., 2001

1998
Tools for studying paths and cycles in digraphs.
Networks, 1998

Neighborhood conditions for balanced independent sets in bipartite graphs.
Discret. Math., 1998

The Forwarding Diameter of Graphs.
Discret. Appl. Math., 1998

On a Combinatorial Theorem of Erdös, Ginzburg and Ziv.
Comb. Probab. Comput., 1998

1996
Hamiltonian properties and the bipartite independence number.
Discret. Math., 1996

On the Erdös-Ginzburg-Ziv theorem.
Discret. Math., 1996

Chvatal-Erdos condition for Hamiltonicity in digraphs.
Ars Comb., 1996

1995
Biclosure and bistability in a balanced bipartite graph.
J. Graph Theory, 1995

Dominating cycles in bipartite biclaw-free graphs.
Discret. Math., 1995

1994
An Implementation of the PAC Architecture Using Object-Oriented Techniques.
Proceedings of the Applications and Impacts, Information Processing '94, Volume 2, Proceedings of the IFIP 13th World Computer Congress, Hamburg, Germany, 28 August, 1994

1993
Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2.
SIAM J. Discret. Math., 1993

On the bipartite independence number of a balanced bipartite graph.
Discret. Math., 1993

1990
Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey.
Discret. Math., 1990

1988
A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs.
Discret. Math., 1988

1986
A sufficient condition for oriented graphs to be Hamiltonian.
Discret. Math., 1986

1985
A Chvátal-Erdös condition for (1, 1)-factors in digraphs.
Discret. Math., 1985


  Loading...