Victor Neumann-Lara

Publication Activity (10 Years)

Years Active: 1982-2013
Publications (10 Years): 0

Top Topics

Top Venues

Discret. Appl. Math.

Publications

Victor Neumann-Lara, Mika Olsen
Molds of regular tournaments. Ars Comb. 112 (2013)
Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Edge contraction and edge removal on iterated clique graphs. Discret. Appl. Math. 161 (10-11) (2013)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
On expansive graphs. Eur. J. Comb. 30 (2) (2009)
Victor Neumann-Lara, Mika Olsen
Enumeration and dichromatic number of tame tournaments. Australas. J Comb. 45 (2009)
Bernardo Llano, Victor Neumann-Lara
Circulant tournaments of prime order are tight. Discret. Math. 308 (24) (2008)
Juan José Montellano-Ballesteros, Victor Neumann-Lara, Eduardo Rivera-Campo
On a heterochromatic number for hypercubes. Discret. Math. 308 (16) (2008)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Graph relations, clique divergence and surface triangulations. J. Graph Theory 51 (2) (2006)
Juan José Montellano-Ballesteros, Victor Neumann-Lara
An Anti-Ramsey Theorem on Cycles. Graphs Comb. 21 (3) (2005)
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. Ars Comb. 75 (2005)
Victor Neumann-Lara, Richard G. Wilson
Compact compatible topologies for graphs with small cycles. Int. J. Math. Math. Sci. 2005 (14) (2005)
Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Local cutpoints and iterated clique graphs. Electron. Notes Discret. Math. 19 (2005)
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. Discret. Math. 282 (1-3) (2004)
Martín Eduardo Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña
Dismantlings and iterated clique graphs. Discret. Math. 282 (1-3) (2004)
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
A Note on Convex Decompositions of a Set of Points in the Plane. Graphs Comb. 20 (2) (2004)
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
A note on minimally 3-connected graphs. Discuss. Math. Graph Theory 24 (1) (2004)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Clique divergent clockwork graphs and partial orders. Discret. Appl. Math. 141 (1-3) (2004)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter
A hierarchy of self-clique graphs. Discret. Math. 282 (1-3) (2004)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
On the heterochromatic number of circulant digraphs. Discuss. Math. Graph Theory 24 (1) (2004)
Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
On a tree graph defined by a set of cycles. Discret. Math. 271 (1-3) (2003)
Juan José Montellano-Ballesteros, Victor Neumann-Lara
A Linear Heterochromatic Number of Graphs. Graphs Comb. 19 (4) (2003)
Francisco Larrión, Victor Neumann-Lara
On clique divergent graphs with linear growth. Discret. Math. 245 (1-3) (2002)
Juan José Montellano-Ballesteros, Victor Neumann-Lara
An Anti-Ramsey Theorem. Comb. 22 (3) (2002)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Whitney triangulations, local girth and iterated clique graphs. Discret. Math. 258 (1-3) (2002)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
On the homotopy type of the clique graph. J. Braz. Comput. Soc. 7 (3) (2001)
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
Clique Divergent Clockwork Graphs and Partial Orders. Electron. Notes Discret. Math. 7 (2001)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
A class of tight circulant tournaments. Discuss. Math. Graph Theory 20 (1) (2000)
Victor Neumann-Lara
Dichromatic number, circulant tournaments and Zykov sums of digraphs. Discuss. Math. Graph Theory 20 (2) (2000)
Francisco Larrión, Victor Neumann-Lara
graphs are clique divergent. Discret. Math. 215 (2000)
Juan José Montellano-Ballesteros, Victor Neumann-Lara
Totally Multicoloured Cycles. Electron. Notes Discret. Math. 5 (2000)
Francisco Larrión, Victor Neumann-Lara
Clique divergent graphs with unbounded sequence of diameters. Discret. Math. (1999)
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
A note on covering the edges of a graph with bonds. Discret. Math. (1999)
Victor Neumann-Lara
The acyclic disconnection of a digraph. Discret. Math. (1999)
Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara
Tightness problems in the plane. Discret. Math. 194 (1-3) (1999)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
New classes of critical kernel-imperfect digraphs. Discuss. Math. Graph Theory 18 (1) (1998)
Victor Neumann-Lara, Eduardo Rivera-Campo
Euler tours and a game with dominoes. Discret. Math. (1997)
Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
A Combinatorial Property of Convex Sets. Discret. Comput. Geom. 17 (3) (1997)
Victor Neumann-Lara
Vertex critical 4-dichromatic circulant tournaments. Discret. Math. 170 (1-3) (1997)
Francisco Larrión, Victor Neumann-Lara
A Family of Clique Divergent Graphs with Linear Growth. Graphs Comb. 13 (3) (1997)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. Discuss. Math. Graph Theory 16 (1) (1996)
Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara
Tight and Untight Triangulations of Surfaces by Complete Graphs. J. Comb. Theory, Ser. B 63 (2) (1995)
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. SCG (1995)
Victor Neumann-Lara
A Short Proof of a Theorem of Reid and Parker on Tournaments. Graphs Comb. 10 (2-4) (1994)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. Graphs Comb. 10 (2-4) (1994)
Victor Neumann-Lara
The 3 and 4-dichromatic tournaments of minimum order. Discret. Math. 135 (1-3) (1994)
Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara
On the minimum size of tight hypergraphs. J. Graph Theory 16 (4) (1992)
Victor Neumann-Lara, Eduardo Rivera-Campo
Spanning trees with bounded degrees. Comb. 11 (1) (1991)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
Orientations of graphs in kernel theory. Discret. Math. 87 (3) (1991)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
Extending kernel perfect digraphs to kernel perfect critical digraphs. Discret. Math. 94 (3) (1991)
Victor Neumann-Lara, Jorge Urrutia
A combinatorial result on points and circles on the plane. Discret. Math. 69 (2) (1988)
Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
On multiplicative graphs and the product conjecture. Comb. 8 (1) (1988)
Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia
Uniquely colourable m-dichromatic oriented graphs. Discret. Math. 62 (1) (1986)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
On kernel-perfect critical digraphs. Discret. Math. 59 (3) (1986)
Luis Montejano, Victor Neumann-Lara
A variation of Menger's theorem for long paths. J. Comb. Theory, Ser. B 36 (2) (1984)
Victor Neumann-Lara, Jorge Urrutia
Vertex critical r-dichromatic tournaments. Discret. Math. 49 (1) (1984)
Hortensia Galeana-Sánchez, Victor Neumann-Lara
On kernels and semikernels of digraphs. Discret. Math. 48 (1) (1984)
Victor Neumann-Lara
The dichromatic number of a digraph. J. Comb. Theory, Ser. B 33 (3) (1982)