The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Victor Neumann-Lara: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
    Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. [Citation Graph (0, 0)][DBLP]
    Symposium on Computational Geometry, 1995, pp:71-78 [Conf]
  2. Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
    Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2005, v:75, n:, pp:- [Journal]
  3. Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
    On multiplicative graphs and the product conjecture. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1988, v:8, n:1, pp:63-74 [Journal]
  4. Victor Neumann-Lara, Eduardo Rivera-Campo
    Spanning trees with bounded degrees. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 1991, v:11, n:1, pp:55-61 [Journal]
  5. Juan José Montellano-Ballesteros, Victor Neumann-Lara
    An Anti-Ramsey Theorem. [Citation Graph (0, 0)][DBLP]
    Combinatorica, 2002, v:22, n:3, pp:445-449 [Journal]
  6. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
    Clique divergent clockwork graphs and partial orders. [Citation Graph (0, 0)][DBLP]
    Discrete Applied Mathematics, 2004, v:141, n:1-3, pp:195-207 [Journal]
  7. Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
    A Combinatorial Property of Convex Sets. [Citation Graph (0, 0)][DBLP]
    Discrete & Computational Geometry, 1997, v:17, n:3, pp:307-318 [Journal]
  8. M. E. Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña
    Dismantlings and iterated clique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:263-265 [Journal]
  9. Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña
    The clique operator on cographs and serial graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:183-191 [Journal]
  10. Francisco Larrión, Victor Neumann-Lara
    Locally C6 graphs are clique divergent. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2000, v:215, n:, pp:159-170 [Journal]
  11. Francisco Larrión, Victor Neumann-Lara
    On clique divergent graphs with linear growth. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:245, n:1-3, pp:139-153 [Journal]
  12. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
    Whitney triangulations, local girth and iterated clique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:258, n:1-3, pp:123-135 [Journal]
  13. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter
    A hierarchy of self-clique graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2004, v:282, n:1-3, pp:193-208 [Journal]
  14. Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
    On a tree graph defined by a set of cycles. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2003, v:271, n:1-3, pp:303-310 [Journal]
  15. Juan José Montellano-Ballesteros, Victor Neumann-Lara
    A Linear Heterochromatic Number of Graphs. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2003, v:19, n:4, pp:533-536 [Journal]
  16. Juan José Montellano-Ballesteros, Victor Neumann-Lara
    An Anti-Ramsey Theorem on Cycles. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2005, v:21, n:3, pp:343-354 [Journal]
  17. Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
    A Note on Convex Decompositions of a Set of Points in the Plane. [Citation Graph (0, 0)][DBLP]
    Graphs and Combinatorics, 2004, v:20, n:2, pp:223-231 [Journal]
  18. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
    On the homotopy type of the clique graph. [Citation Graph (0, 0)][DBLP]
    J. Braz. Comp. Soc., 2001, v:7, n:3, pp:69-73 [Journal]
  19. Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara
    Tight and Untight Triangulations of Surfaces by Complete Graphs. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1995, v:63, n:2, pp:185-199 [Journal]
  20. Luis Montejano, Victor Neumann-Lara
    A variation of Menger's theorem for long paths. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1984, v:36, n:2, pp:213-217 [Journal]
  21. Victor Neumann-Lara
    The dichromatic number of a digraph. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 1982, v:33, n:3, pp:265-270 [Journal]
  22. Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
    Graph relations, clique divergence and surface triangulations. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2006, v:51, n:2, pp:110-122 [Journal]
  23. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    On kernel-perfect critical digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:59, n:3, pp:257-265 [Journal]
  24. Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia
    Uniquely colourable m-dichromatic oriented graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1986, v:62, n:1, pp:65-70 [Journal]
  25. Victor Neumann-Lara, Jorge Urrutia
    A combinatorial result on points and circles on the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1988, v:69, n:2, pp:173-178 [Journal]
  26. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    On kernels and semikernels of digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:48, n:1, pp:67-76 [Journal]
  27. Victor Neumann-Lara, Jorge Urrutia
    Vertex critical r-dichromatic tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1984, v:49, n:1, pp:83-87 [Journal]
  28. Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara
    Tightness problems in the plane. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:194, n:1-3, pp:1-11 [Journal]
  29. Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
    A note on covering the edges of a graph with bonds. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:633-636 [Journal]
  30. Victor Neumann-Lara
    The acyclic disconnection of a digraph. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:617-632 [Journal]
  31. Francisco Larrión, Victor Neumann-Lara
    Clique divergent graphs with unbounded sequence of diameters. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1999, v:197, n:, pp:491-501 [Journal]
  32. Victor Neumann-Lara
    Vertex critical 4-dichromatic circulant tournaments. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:170, n:1-3, pp:289-291 [Journal]
  33. Victor Neumann-Lara, Eduardo Rivera-Campo
    Euler tours and a game with dominoes. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1997, v:167, n:, pp:511-517 [Journal]
  34. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    Orientations of graphs in kernel theory. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:87, n:3, pp:271-280 [Journal]
  35. Hortensia Galeana-Sánchez, Victor Neumann-Lara
    Extending kernel perfect digraphs to kernel perfect critical digraphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1991, v:94, n:3, pp:181-187 [Journal]
  36. Victor Neumann-Lara
    The 3 and 4-dichromatic tournaments of minimum order. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 1994, v:135, n:1-3, pp:233-243 [Journal]

  37. Circulant tournaments of prime order are tight. [Citation Graph (, )][DBLP]


  38. On a heterochromatic number for hypercubes. [Citation Graph (, )][DBLP]


  39. On expansive graphs. [Citation Graph (, )][DBLP]


Search in 0.037secs, Finished in 0.038secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
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 asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002