Victor Neumann-Lara

56 papers Journal 55Unranked 1
YearRankTypeTitle / Venue / Authors
2013 J jnl
Edge contraction and edge removal on iterated clique graphs.
Discret. Appl. Math.
Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2013 J jnl
Molds of regular tournaments.
Ars Comb.
Victor Neumann-Lara, Mika Olsen
2009 J jnl
Enumeration and dichromatic number of tame tournaments.
Australas. J Comb.
Victor Neumann-Lara, Mika Olsen
2009 J jnl
On expansive graphs.
Eur. J. Comb.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2008 J jnl
Circulant tournaments of prime order are tight.
Discret. Math.
Bernardo Llano, Victor Neumann-Lara
2008 J jnl
On a heterochromatic number for hypercubes.
Discret. Math.
Juan José Montellano-Ballesteros, Victor Neumann-Lara, Eduardo Rivera-Campo
2006 J jnl
Graph relations, clique divergence and surface triangulations.
J. Graph Theory
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2005 J jnl
An Anti-Ramsey Theorem on Cycles.
Graphs Comb.
Juan José Montellano-Ballesteros, Victor Neumann-Lara
2005 J jnl
Compact compatible topologies for graphs with small cycles.
Int. J. Math. Math. Sci.
Victor Neumann-Lara, Richard G. Wilson
2005 J jnl
Local cutpoints and iterated clique graphs.
Electron. Notes Discret. Math.
Martín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2005 J jnl
Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph.
Ars Comb.
Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
2004 J jnl
A Note on Convex Decompositions of a Set of Points in the Plane.
Graphs Comb.
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
2004 J jnl
A hierarchy of self-clique graphs.
Discret. Math.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter
2004 J jnl
A note on minimally 3-connected graphs.
Discuss. Math. Graph Theory
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
2004 J jnl
Clique divergent clockwork graphs and partial orders.
Discret. Appl. Math.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2004 J jnl
Dismantlings and iterated clique graphs.
Discret. Math.
Martín Eduardo Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña
2004 J jnl
On the heterochromatic number of circulant digraphs.
Discuss. Math. Graph Theory
Hortensia Galeana-Sánchez, Victor Neumann-Lara
2004 J jnl
The clique operator on cographs and serial graphs.
Discret. Math.
Francisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña
2003 J jnl
A Linear Heterochromatic Number of Graphs.
Graphs Comb.
Juan José Montellano-Ballesteros, Victor Neumann-Lara
2003 J jnl
On a tree graph defined by a set of cycles.
Discret. Math.
Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo
2002 J jnl
An Anti-Ramsey Theorem.
Comb.
Juan José Montellano-Ballesteros, Victor Neumann-Lara
2002 J jnl
On clique divergent graphs with linear growth.
Discret. Math.
Francisco Larrión, Victor Neumann-Lara
2002 J jnl
Whitney triangulations, local girth and iterated clique graphs.
Discret. Math.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2001 J jnl
Clique Divergent Clockwork Graphs and Partial Orders.
Electron. Notes Discret. Math.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2001 J jnl
On the homotopy type of the clique graph.
J. Braz. Comput. Soc.
Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña
2000 J jnl
A class of tight circulant tournaments.
Discuss. Math. Graph Theory
Hortensia Galeana-Sánchez, Victor Neumann-Lara
2000 J jnl
Dichromatic number, circulant tournaments and Zykov sums of digraphs.
Discuss. Math. Graph Theory
Victor Neumann-Lara
2000 J jnl
Locally C
Discret. Math.
Francisco Larrión, Victor Neumann-Lara
2000 J jnl
Totally Multicoloured Cycles.
Electron. Notes Discret. Math.
Juan José Montellano-Ballesteros, Victor Neumann-Lara
1999 J jnl
A note on covering the edges of a graph with bonds.
Discret. Math.
Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia
1999 J jnl
Clique divergent graphs with unbounded sequence of diameters.
Discret. Math.
Francisco Larrión, Victor Neumann-Lara
1999 J jnl
The acyclic disconnection of a digraph.
Discret. Math.
Victor Neumann-Lara
1999 J jnl
Tightness problems in the plane.
Discret. Math.
Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara
1998 J jnl
New classes of critical kernel-imperfect digraphs.
Discuss. Math. Graph Theory
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1997 J jnl
A Combinatorial Property of Convex Sets.
Discret. Comput. Geom.
Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
1997 J jnl
A Family of Clique Divergent Graphs with Linear Growth.
Graphs Comb.
Francisco Larrión, Victor Neumann-Lara
1997 J jnl
Euler tours and a game with dominoes.
Discret. Math.
Victor Neumann-Lara, Eduardo Rivera-Campo
1997 J jnl
Vertex critical 4-dichromatic circulant tournaments.
Discret. Math.
Victor Neumann-Lara
1996 J jnl
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition.
Discuss. Math. Graph Theory
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1995 J jnl
Tight and Untight Triangulations of Surfaces by Complete Graphs.
J. Comb. Theory B
Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara
1995 — conf
Voronoi Diagrams and Containment of Families of Convex Sets on the Plane.
SCG
Manuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia
1994 J jnl
A Short Proof of a Theorem of Reid and Parker on Tournaments.
Graphs Comb.
Victor Neumann-Lara
1994 J jnl
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs.
Graphs Comb.
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1994 J jnl
The 3 and 4-dichromatic tournaments of minimum order.
Discret. Math.
Victor Neumann-Lara
1992 J jnl
On the minimum size of tight hypergraphs.
J. Graph Theory
Jorge L. Arocha, Javier Bracho, Victor Neumann-Lara
1991 J jnl
Extending kernel perfect digraphs to kernel perfect critical digraphs.
Discret. Math.
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1991 J jnl
Orientations of graphs in kernel theory.
Discret. Math.
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1991 J jnl
Spanning trees with bounded degrees.
Comb.
Victor Neumann-Lara, Eduardo Rivera-Campo
1988 J jnl
A combinatorial result on points and circles on the plane.
Discret. Math.
Victor Neumann-Lara, Jorge Urrutia
1988 J jnl
On multiplicative graphs and the product conjecture.
Comb.
Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara
1986 J jnl
On kernel-perfect critical digraphs.
Discret. Math.
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1986 J jnl
Uniquely colourable m-dichromatic oriented graphs.
Discret. Math.
Victor Neumann-Lara, Nicola Santoro, Jorge Urrutia
1984 J jnl
A variation of Menger's theorem for long paths.
J. Comb. Theory B
Luis Montejano, Victor Neumann-Lara
1984 J jnl
On kernels and semikernels of digraphs.
Discret. Math.
Hortensia Galeana-Sánchez, Victor Neumann-Lara
1984 J jnl
Vertex critical r-dichromatic tournaments.
Discret. Math.
Victor Neumann-Lara, Jorge Urrutia
1982 J jnl
The dichromatic number of a digraph.
J. Comb. Theory B
Victor Neumann-Lara