The SCEAS System
Navigation Menu

Search the dblp DataBase


Oscar Ordaz: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Carlos Guia, Oscar Ordaz
    Chvatal-Erdos condition for Hamiltonicity in digraphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 1996, v:43, n:, pp:- [Journal]
  2. Yahya Ould Hamidoune, Oscar Ordaz, Asdrubal Ortuño
    On a Combinatorial Theorem of Erdös, Ginzburg and Ziv. [Citation Graph (0, 0)][DBLP]
    Combinatorics, Probability & Computing, 1998, v:7, n:4, pp:403-412 [Journal]
  3. Wenceslas Fernandez de la Vega, Mohamed El Haddad, Daniel Barraez, Oscar Ordaz
    The Forwarding Diameter of Graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 1998, v:86, n:2-3, pp:201-211 [Journal]
  4. Charles Delorme, Samuel Gonzalez, Oscar Ordaz, María Teresa Varela
    Barycentric sequences and barycentric Ramsey numbers stars. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:277, n:1-3, pp:45-56 [Journal]
  5. Charles Delorme, Isabel Marquez, Oscar Ordaz, Asdrubal Ortuño
    Existence conditions for barycentric sequences. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:281, n:1-3, pp:163-172 [Journal]
  6. Charles Delorme, Oscar Ordaz, Domingo Quiroz
    Some remarks on Davenport constant. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2001, v:237, n:1-3, pp:119-128 [Journal]
  7. Charles Delorme, Oscar Ordaz, Domingo Quiroz
    Tools for studying paths and cycles in digraphs. [Citation Graph (0, 0)][DBLP]
    Networks, 1998, v:31, n:2, pp:125-148 [Journal]
  8. Odile Favaron, Pedro Mago, Consuelo Maulino, Oscar Ordaz
    Hamiltonian Properties of Bipartite Graphs and Digraphs with Bipartite Independence 2. [Citation Graph (0, 0)][DBLP]
    SIAM J. Discrete Math., 1993, v:6, n:2, pp:189-196 [Journal]
  9. Bill Jackson, Oscar Ordaz
    A Chvátal-Erdös condition for (1, 1)-factors in digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1985, v:57, n:1-2, pp:199-201 [Journal]
  10. Odile Favaron, Oscar Ordaz
    A sufficient condition for oriented graphs to be Hamiltonian. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:58, n:3, pp:243-252 [Journal]
  11. Pierre Fraisse, Oscar Ordaz
    A Chvátal-Erdös condition for (t, t)-factors in digraphs using given arcs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:71, n:2, pp:143-148 [Journal]
  12. Denise Amar, Stephan Brandt, Daniel Brito, Oscar Ordaz
    Neighborhood conditions for balanced independent sets in bipartite graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1998, v:181, n:1-3, pp:31-36 [Journal]
  13. Oscar Ordaz, Denise Amar, André Raspaud
    Hamiltonian properties and the bipartite independence number. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:161, n:1-3, pp:207-215 [Journal]
  14. Bill Jackson, Oscar Ordaz
    Chvátal-Erdös conditions for paths and cycles in graphs and digraphs. A survey. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1990, v:84, n:3, pp:241-254 [Journal]
  15. Daniel Barraez, Evelyne Flandrin, Hao Li, Oscar Ordaz
    Dominating cycles in bipartite biclaw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1995, v:146, n:1-3, pp:11-18 [Journal]
  16. Carlos Flores, Oscar Ordaz
    On the Erdös-Ginzburg-Ziv theorem. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1996, v:152, n:1-3, pp:321-324 [Journal]
  17. Odile Favaron, Pedro Mago, Oscar Ordaz
    On the bipartite independence number of a balanced bipartite graph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1993, v:121, n:1-3, pp:55-63 [Journal]

  18. Representation of group elements as subsequence sums. [Citation Graph (, )][DBLP]

Search in 0.002secs, Finished in 0.003secs
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
System created by [] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002