The dichromatic number of a digraph. - Victor Neumann-Lara (J. Comb. Theory B, 1982)

On kernels and semikernels of digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1984)

Vertex critical r-dichromatic tournaments. - Victor Neumann-Lara; Jorge Urrutia (Discret. Math., 1984)

A variation of Menger's theorem for long paths. - Luis Montejano 001; Victor Neumann-Lara (J. Comb. Theory B, 1984)

On kernel-perfect critical digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1986)

Uniquely colourable m-dichromatic oriented graphs. - Victor Neumann-Lara; Nicola Santoro; Jorge Urrutia (Discret. Math., 1986)

On multiplicative graphs and the product conjecture. - Roland Häggkvist; Pavol Hell; Donald J. Miller; Victor Neumann-Lara (Comb., 1988)

A combinatorial result on points and circles on the plane. - Victor Neumann-Lara; Jorge Urrutia (Discret. Math., 1988)

Spanning trees with bounded degrees. - Victor Neumann-Lara; Eduardo Rivera-Campo (Comb., 1991)

Orientations of graphs in kernel theory. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1991)

Extending kernel perfect digraphs to kernel perfect critical digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discret. Math., 1991)

On the minimum size of tight hypergraphs. - Jorge L. Arocha; Javier Bracho; Victor Neumann-Lara (J. Graph Theory, 1992)

The 3 and 4-dichromatic tournaments of minimum order. - Victor Neumann-Lara (Discret. Math., 1994)

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Graphs Comb., 1994)

A Short Proof of a Theorem of Reid and Parker on Tournaments. - Victor Neumann-Lara (Graphs Comb., 1994)

Voronoi Diagrams and Containment of Families of Convex Sets on the Plane. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (SCG, 1995)

Tight and Untight Triangulations of Surfaces by Complete Graphs. - Jorge L. Arocha; Javier Bracho; Victor Neumann-Lara (J. Comb. Theory B, 1995)

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 1996)

A Combinatorial Property of Convex Sets. - Manuel Abellanas; Gregorio Hernández-Peñalver; Rolf Klein; Victor Neumann-Lara; Jorge Urrutia (Discret. Comput. Geom., 1997)

Vertex critical 4-dichromatic circulant tournaments. - Victor Neumann-Lara (Discret. Math., 1997)

Euler tours and a game with dominoes. - Victor Neumann-Lara; Eduardo Rivera-Campo (Discret. Math., 1997)

A Family of Clique Divergent Graphs with Linear Growth. - Francisco Larrión; Victor Neumann-Lara (Graphs Comb., 1997)

New classes of critical kernel-imperfect digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 1998)

Tightness problems in the plane. - Bernardo M. Ábrego; Jorge L. Arocha; Silvia Fernández-Merchant; Victor Neumann-Lara (Discret. Math., 1999)

Clique divergent graphs with unbounded sequence of diameters. - Francisco Larrión; Victor Neumann-Lara (Discret. Math., 1999)

The acyclic disconnection of a digraph. - Victor Neumann-Lara (Discret. Math., 1999)

A note on covering the edges of a graph with bonds. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Discret. Math., 1999)

Locally C6 graphs are clique divergent. - Francisco Larrión; Victor Neumann-Lara (Discret. Math., 2000)

A class of tight circulant tournaments. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 2000)

Dichromatic number, circulant tournaments and Zykov sums of digraphs. - Victor Neumann-Lara (Discuss. Math. Graph Theory, 2000)

Totally Multicoloured Cycles. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Electron. Notes Discret. Math., 2000)

On the homotopy type of the clique graph. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (J. Braz. Comput. Soc., 2001)

An Anti-Ramsey Theorem. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Comb., 2002)

On clique divergent graphs with linear growth. - Francisco Larrión; Victor Neumann-Lara (Discret. Math., 2002)

Whitney triangulations, local girth and iterated clique graphs. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Math., 2002)

On a tree graph defined by a set of cycles. - Xueliang Li 001; Victor Neumann-Lara; Eduardo Rivera-Campo (Discret. Math., 2003)

A Linear Heterochromatic Number of Graphs. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Graphs Comb., 2003)

Clique divergent clockwork graphs and partial orders. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Appl. Math., 2004)

Dismantlings and iterated clique graphs. - Martín Eduardo Frías-Armenta; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Math., 2004)

The clique operator on cographs and serial graphs. - Francisco Larrión; Célia Picinin de Mello; Aurora Morgana; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Math., 2004)

A hierarchy of self-clique graphs. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña; Thomas Dale Porter (Discret. Math., 2004)

On the heterochromatic number of circulant digraphs. - Hortensia Galeana-Sánchez; Victor Neumann-Lara (Discuss. Math. Graph Theory, 2004)

A note on minimally 3-connected graphs. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Discuss. Math. Graph Theory, 2004)

A Note on Convex Decompositions of a Set of Points in the Plane. - Victor Neumann-Lara; Eduardo Rivera-Campo; Jorge Urrutia (Graphs Comb., 2004)

Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph. - Xueliang Li 001; Victor Neumann-Lara; Eduardo Rivera-Campo (Ars Comb., 2005)

Local cutpoints and iterated clique graphs. - Martín Eduardo Frías-Armenta; Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (Electron. Notes Discret. Math., 2005)

An Anti-Ramsey Theorem on Cycles. - Juan José Montellano-Ballesteros; Victor Neumann-Lara (Graphs Comb., 2005)

Compact compatible topologies for graphs with small cycles. - Victor Neumann-Lara; Richard G. Wilson (Int. J. Math. Math. Sci., 2005)

Graph relations, clique divergence and surface triangulations. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (J. Graph Theory, 2006)

Circulant tournaments of prime order are tight. - Bernardo Llano; Victor Neumann-Lara (Discret. Math., 2008)

On a heterochromatic number for hypercubes. - Juan José Montellano-Ballesteros; Victor Neumann-Lara; Eduardo Rivera-Campo (Discret. Math., 2008)

Enumeration and dichromatic number of tame tournaments. - Victor Neumann-Lara; Mika Olsen (Australas. J Comb., 2009)

On expansive graphs. - Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (Eur. J. Comb., 2009)

Molds of regular tournaments. - Victor Neumann-Lara; Mika Olsen (Ars Comb., 2013)

Edge contraction and edge removal on iterated clique graphs. - Martín Eduardo Frías-Armenta; Francisco Larrión; Victor Neumann-Lara; Miguel A. Pizaña (Discret. Appl. Math., 2013)