Oscar Ordaz

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

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2015

Multi-wise and constrained fully weighted Davenport constants and interactions with coding theory.

Luz Elimar Marchan, Oscar Ordaz, Irene Santos, Wolfgang A. Schmid

J. Comb. Theory A, 2015

Barycentric and zero-sum Ramsey numbers.

Yair Caro, Leida Gonzalez, Luz Elimar Marchan, Oscar Ordaz

Ars Comb., 2015

Quality-based bottom-up design of reference architecture applied to Healthcare Integrated Information Systems.

Francisca Losavio, Oscar Ordaz, Victor Esteller

Proceedings of the 9th IEEE International Conference on Research Challenges in Information Science, 2015

2013

Some remarks on barycentric-sum problems over cyclic groups.

Oscar Ordaz, Alain Plagne, Wolfgang A. Schmid

Eur. J. Comb., 2013

Graph modelling of a refactoring process for Product Line Architecture design.

Francisca Losavio, Oscar Ordaz, Nicole Lévy, Anthony Baiotto

Proceedings of the 2013 XXXIX Latin American Computing Conference (CLEI), 2013

2008

Representation of group elements as subsequence sums.

Oscar Ordaz, Domingo Quiroz

Discret. Math., 2008

2004

Existence conditions for barycentric sequences.

Charles Delorme, Isabel Marquez, Oscar Ordaz, Asdrubal Ortuño

Discret. Math., 2004

Barycentric sequences and barycentric Ramsey numbers stars.

Charles Delorme, Samuel Gonzalez, Oscar Ordaz, María Teresa Varela

Discret. Math., 2004

2001

Some remarks on Davenport constant.

Charles Delorme, Oscar Ordaz, Domingo Quiroz

Discret. Math., 2001

1998

Tools for studying paths and cycles in digraphs.

Charles Delorme, Oscar Ordaz, Domingo Quiroz

Networks, 1998

Neighborhood conditions for balanced independent sets in bipartite graphs.

Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz

Discret. Math., 1998

The Forwarding Diameter of Graphs.

Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz

Discret. Appl. Math., 1998

On a Combinatorial Theorem of Erdös, Ginzburg and Ziv.

Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño

Comb. Probab. Comput., 1998

1996

Hamiltonian properties and the bipartite independence number.

Oscar Ordaz, Denise Amar, André Raspaud

Discret. Math., 1996

On the Erdös-Ginzburg-Ziv theorem.

Carlos Flores, Oscar Ordaz

Discret. Math., 1996

Chvatal-Erdos condition for Hamiltonicity in digraphs.

Carlos Guia, Oscar Ordaz

Ars Comb., 1996

1995

Biclosure and bistability in a balanced bipartite graph.

Denise Amar, Odile Favaron, Pedro Mago, Oscar Ordaz

J. Graph Theory, 1995

Dominating cycles in bipartite biclaw-free graphs.

Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz

Discret. Math., 1995

1994

An Implementation of the PAC Architecture Using Object-Oriented Techniques.

Francisca Losavio, Alfredo Matteo, Oscar Ordaz, O. Meza, W. Gontier

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.

Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz

SIAM J. Discret. Math., 1993

On the bipartite independence number of a balanced bipartite graph.

Odile Favaron, Pedro Mago, Oscar Ordaz

Discret. Math., 1993

1990

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

Bill Jackson, Oscar Ordaz

Discret. Math., 1990

1988

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

Pierre Fraisse, Oscar Ordaz

Discret. Math., 1988

1986

A sufficient condition for oriented graphs to be Hamiltonian.

Odile Favaron, Oscar Ordaz

Discret. Math., 1986

1985

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

Bill Jackson, Oscar Ordaz

Discret. Math., 1985