Victor Neumann-Lara

发表

On expansive graphs

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2009, Eur. J. Comb..

Whitney triangulations, local girth and iterated clique graphs

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2002, Discret. Math..

A variation of Menger's theorem for long paths

Victor Neumann-Lara, Luis Pedro Montejano, 1984, J. Comb. Theory, Ser. B.

Vertex critical r-dichromatic tournaments

Jorge Urrutia, Victor Neumann-Lara, 1984, Discret. Math..

On kernel-perfect critical digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1986, Discret. Math..

On a heterochromatic number for hypercubes

Juan José Montellano-Ballesteros, Eduardo Rivera-Campo, Victor Neumann-Lara, 2008, Discret. Math..

A combinatorial result on points and circles on the plane

Jorge Urrutia, Victor Neumann-Lara, J. Urrutia, 1988, Discret. Math..

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition

Hortensia Galeana-Sánchez, Victor Neumann-Lara, 1996, Discuss. Math. Graph Theory.

Locally C6 graphs are clique divergent

Francisco Larrión, Victor Neumann-Lara, 2000, Discret. Math..

Graph relations, clique divergence and surface triangulations

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2006, J. Graph Theory.

On a tree graph defined by a set of cycles

Xueliang Li, Eduardo Rivera-Campo, Victor Neumann-Lara, 2003, Discret. Math..

A note on covering the edges of a graph with bonds

Jorge Urrutia, Eduardo Rivera-Campo, Victor Neumann-Lara, 1999, Discrete Mathematics.

Vertex critical 4-dichromatic circulant tournaments

Victor Neumann-Lara, 1997, Discret. Math..

A Short Proof of a Theorem of Reid and Parker on Tournaments

Victor Neumann-Lara, 1994, Graphs Comb..

A note on minimally 3-connected graphs

Jorge Urrutia, Eduardo Rivera-Campo, Victor Neumann-Lara, 2004, Discuss. Math. Graph Theory.

An Anti-Ramsey Theorem on Cycles

Juan José Montellano-Ballesteros, Victor Neumann-Lara, 2005, Graphs Comb..

A Note on Convex Decompositions of a Set of Points in the Plane

Jorge Urrutia, Eduardo Rivera-Campo, Victor Neumann-Lara, 2004, Graphs Comb..

On the minimum size of tight hypergraphs

Victor Neumann-Lara, Javier Bracho, Jorge L. Arocha, 1992, J. Graph Theory.

A class of tight circulant tournaments

Hortensia Galeana-Sánchez, Victor Neumann-Lara, 2000, Discuss. Math. Graph Theory.

Enumeration and dichromatic number of tame tournaments

Mika Olsen, Victor Neumann-Lara, V. Neumann-Lara, 2009, Australas. J Comb..

Dismantlings and iterated clique graphs

Miguel A. Pizaña, Martín Eduardo Frías-Armenta, Victor Neumann-Lara, 2004, Discret. Math..

An Anti-Ramsey Theorem

Juan José Montellano-Ballesteros, Victor Neumann-Lara, 2002, Comb..

Molds of regular tournaments

Mika Olsen, Victor Neumann-Lara, 2013, Ars Comb..

Tight and Untight Triangulations of Surfaces by Complete Graphs

Victor Neumann-Lara, Javier Bracho, Jorge L. Arocha, 1995, J. Comb. Theory, Ser. B.

Compact compatible topologies for graphs with small cycles

Richard G. Wilson, Victor Neumann-Lara, 2005, Int. J. Math. Math. Sci..

Edge contraction and edge removal on iterated clique graphs

Miguel A. Pizaña, Martín Eduardo Frías-Armenta, Francisco Larrión, 2013, Discret. Appl. Math..

A hierarchy of self-clique graphs

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2004, Discret. Math..

Clique divergent clockwork graphs and partial orders

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2001, Discret. Appl. Math..

Totally Multicoloured Cycles

Juan José Montellano-Ballesteros, Victor Neumann-Lara, 2000, Electron. Notes Discret. Math..

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1994, Graphs Comb..

Local cutpoints and iterated clique graphs

Miguel A. Pizaña, Martín Eduardo Frías-Armenta, Francisco Larrión, 2005, Electron. Notes Discret. Math..

On kernels and semikernels of digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1984, Discret. Math..

Orientations of graphs in kernel theory

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1991, Discret. Math..

Circulant tournaments of prime order are tight

Bernardo Llano, Victor Neumann-Lara, 2008, Discret. Math..

The clique operator on cographs and serial graphs

Célia Picinin de Mello, Miguel A. Pizaña, Francisco Larrión, 2004, Discret. Math..

A Linear Heterochromatic Number of Graphs

Juan José Montellano-Ballesteros, Victor Neumann-Lara, 2003, Graphs Comb..

On the homotopy type of the clique graph

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2001, J. Braz. Comput. Soc..

Clique divergent clockwork graphs and partial orders

Miguel A. Pizaña, Francisco Larrión, Victor Neumann-Lara, 2004, Discret. Appl. Math..

On multiplicative graphs and the product conjecture

Pavol Hell, Donald J. Miller, Roland Häggkvist, 1988, Comb..

Spanning trees with bounded degrees

Eduardo Rivera-Campo, Victor Neumann-Lara, V. Neumann-Lara, 1991, Comb..

The dichromatic number of a digraph

Victor Neumann-Lara, V. Neumann-Lara, 1982, J. Comb. Theory, Ser. B.

On the heterochromatic number of circulant digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, 2004, Discuss. Math. Graph Theory.

Two Approaches for the Generalization of Leaf Edge Exchange Graphs on Spanning Trees to Connected Spanning k-Edge Subgraphs of a Graph

Xueliang Li, Eduardo Rivera-Campo, Victor Neumann-Lara, 2005, Ars Comb..

Voronoi diagrams and containment of families of convex sets on the plane

Jorge Urrutia, Rolf Klein, Manuel Abellanas, 1995, SCG '95.

Euler tours and a game with dominoes

Eduardo Rivera-Campo, Victor Neumann-Lara, 1997, Discret. Math..

Dichromatic number, circulant tournaments and Zykov sums of digraphs

Victor Neumann-Lara, V. Neumann-Lara, 2000, Discuss. Math. Graph Theory.

Uniquely colourable m-dichromatic oriented graphs

Jorge Urrutia, Victor Neumann-Lara, Nicola Santoro, 1986, Discret. Math..

The acyclic disconnection of a digraph

Victor Neumann-Lara, 1999, Discret. Math..

Tightness problems in the plane

Bernardo M. Ábrego, Silvia Fernández-Merchant, Victor Neumann-Lara, 1999, Discret. Math..

On clique divergent graphs with linear growth

Francisco Larrión, Victor Neumann-Lara, 2002, Discret. Math..

Extending kernel perfect digraphs to kernel perfect critical digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1991, Discret. Math..

Clique divergent graphs with unbounded sequence of diameters

Francisco Larrión, Victor Neumann-Lara, V. Neumann-Lara, 1999, Discret. Math..

A combinatorial property of convex sets

Jorge Urrutia, Rolf Klein, Manuel Abellanas, 1997, Discret. Comput. Geom..

The 3 and 4-dichromatic tournaments of minimum order

Victor Neumann-Lara, 1994, Discret. Math..

New classes of critical kernel-imperfect digraphs

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1998, Discuss. Math. Graph Theory.

Compatible connectedness in graphs and topological spaces

Victor Neumann-Lara, Richard G. Wilson, 1995 .

Graph relations, clique divergence and surface triangulations

Miguel A. Pizaña, Victor Neumann-Lara, F. Larrión, 2006 .

Clique divergent graphs with unbounded sequence of diameters

Victor Neumann-Lara, F. Larrión, 1999 .

SELF-CLIQUE GRAPHS WITH PRESCRIBED CLIQUE-SIZES

Miguel A. Pizaña, Victor Neumann-Lara, Thomas Dale Porter, 2003 .

On the dichromatic number in kernel theory

Hortensia Galeana-Sánchez, Victor Neumann-Lara, V. Neumann-Lara, 1998 .

Digital Jordan curves — a graph-theoretical approach to a topological theorem

Victor Neumann-Lara, V. Neumann-Lara, Richard G. Wilson, 1992 .

The acyclic disconnection of a digraph

Victor Neumann-Lara, 1999 .

Compact Compatible Topologies for Posets and Graphs

Victor Neumann-Lara, V. Neumann-Lara, Richard G. Wilson, 1998 .