|
Search the dblp DataBase
Victor Neumann-Lara:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
- Victor Neumann-Lara
The acyclic disconnection of a digraph. [Citation Graph (0, 0)][DBLP] Discrete Mathematics, 1999, v:197, n:, pp:617-632 [Journal]
- 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]
- 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]
- 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]
- 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]
- 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]
- 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]
Circulant tournaments of prime order are tight. [Citation Graph (, )][DBLP]
On a heterochromatic number for hypercubes. [Citation Graph (, )][DBLP]
On expansive graphs. [Citation Graph (, )][DBLP]
Search in 0.003secs, Finished in 0.454secs
|