Victor Neumann-Lara - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 56 from 56

2013

Edge contraction and edge removal on iterated clique graphsMartín Eduardo Frías-Armenta, Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. DAM, 161(10-11):1427-1439, 2013. [doi]

Molds of regular tournamentsVictor Neumann-Lara, Mika Olsen. arscom, 112:81-96, 2013.

2009

On expansive graphsFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. ejc, 30(2):372-379, 2009. [doi]

Enumeration and dichromatic number of tame tournamentsVictor Neumann-Lara, Mika Olsen. ajc, 45:25-36, 2009. [doi]

2008

Circulant tournaments of prime order are tightBernardo Llano, Victor Neumann-Lara. DM, 308(24):6056-6063, 2008. [doi]

On a heterochromatic number for hypercubesJuan José Montellano-Ballesteros, Victor Neumann-Lara, Eduardo Rivera-Campo. DM, 308(16):3441-3448, 2008. [doi]

2006

Graph relations, clique divergence and surface triangulationsFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. jgt, 51(2):110-122, 2006. [doi]

2005

2004

Dismantlings and iterated clique graphsM. E. Frías-Armenta, Victor Neumann-Lara, Miguel A. Pizaña. DM, 282(1-3):263-265, 2004. [doi]

On the heterochromatic number of circulant digraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. dmgt, 24(1):73-79, 2004. [doi]

Clique divergent clockwork graphs and partial ordersFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. DAM, 141(1-3):195-207, 2004. [doi]

The clique operator on cographs and serial graphsFrancisco Larrión, Célia Picinin de Mello, Aurora Morgana, Victor Neumann-Lara, Miguel A. Pizaña. DM, 282(1-3):183-191, 2004. [doi]

A hierarchy of self-clique graphsFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter. DM, 282(1-3):193-208, 2004. [doi]

A Note on Convex Decompositions of a Set of Points in the PlaneVictor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia. gc, 20(2):223-231, 2004. [doi]

A note on minimally 3-connected graphsVictor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia. dmgt, 24(1):115-123, 2004. [doi]

2003

On a tree graph defined by a set of cyclesXueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo. DM, 271(1-3):303-310, 2003. [doi]

A Linear Heterochromatic Number of GraphsJuan José Montellano-Ballesteros, Victor Neumann-Lara. gc, 19(4):533-536, 2003. [doi]

2002

On clique divergent graphs with linear growthFrancisco Larrión, Victor Neumann-Lara. DM, 245(1-3):139-153, 2002. [doi]

Whitney triangulations, local girth and iterated clique graphsFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. DM, 258(1-3):123-135, 2002. [doi]

An Anti-Ramsey TheoremJuan José Montellano-Ballesteros, Victor Neumann-Lara. combinatorica, 22(3):445-449, 2002. [doi]

2001

On the homotopy type of the clique graphFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. jbcs, 7(3):69-73, 2001.

Clique Divergent Clockwork Graphs and Partial OrdersFrancisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña. endm, 7:10-13, 2001. [doi]

2000

A class of tight circulant tournamentsHortensia Galeana-Sánchez, Victor Neumann-Lara. dmgt, 20(1):109-128, 2000. [doi]

Locally C::6:: graphs are clique divergentFrancisco Larrión, Victor Neumann-Lara. DM, 215:159-170, 2000. [doi]

Totally Multicoloured CyclesJuan José Montellano-Ballesteros, Victor Neumann-Lara. endm, 5:239-242, 2000. [doi]

Dichromatic number, circulant tournaments and Zykov sums of digraphsVictor Neumann-Lara. dmgt, 20(2):197-207, 2000. [doi]

1999

Clique divergent graphs with unbounded sequence of diametersFrancisco Larrión, Victor Neumann-Lara. DM, 197-198:491-501, 1999. [doi]

The acyclic disconnection of a digraphVictor Neumann-Lara. DM, 197-198:617-632, 1999. [doi]

A note on covering the edges of a graph with bondsVictor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia. DM, 197-198:633-636, 1999. [doi]

Tightness problems in the planeBernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant, Victor Neumann-Lara. DM, 194(1-3):1-11, 1999. [doi]

1998

New classes of critical kernel-imperfect digraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. dmgt, 18(1):85-89, 1998. [doi]

1997

A Combinatorial Property of Convex SetsManuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia. dcg, 17(3):307-318, 1997. [doi]

A Family of Clique Divergent Graphs with Linear GrowthFrancisco Larrión, Victor Neumann-Lara. gc, 13(3):263-266, 1997. [doi]

Euler tours and a game with dominoesVictor Neumann-Lara, Eduardo Rivera-Campo. DM, 167-168:511-517, 1997. [doi]

Vertex critical 4-dichromatic circulant tournamentsVictor Neumann-Lara. DM, 170(1-3):289-291, 1997. [doi]

1996

KP-digraphs and CKI-digraphs satisfying the k-Meyniel's conditionHortensia Galeana-Sánchez, Victor Neumann-Lara. dmgt, 16(1):5-16, 1996. [doi]

1995

Voronoi Diagrams and Containment of Families of Convex Sets on the PlaneManuel Abellanas, Gregorio Hernández-Peñalver, Rolf Klein, Victor Neumann-Lara, Jorge Urrutia. compgeom 1995: 71-78 [doi]

Tight and Untight Triangulations of Surfaces by Complete GraphsJorge L. Arocha, Javier Bracho, Victor Neumann-Lara. JCT, 63(2):185-199, 1995. [doi]

1994

New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical DigraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. gc, 10(2-4):329-336, 1994. [doi]

The 3 and 4-dichromatic tournaments of minimum orderVictor Neumann-Lara. DM, 135(1-3):233-243, 1994. [doi]

A Short Proof of a Theorem of Reid and Parker on TournamentsVictor Neumann-Lara. gc, 10(2-4):363-366, 1994. [doi]

1992

On the minimum size of tight hypergraphsJorge L. Arocha, Javier Bracho, Victor Neumann-Lara. jgt, 16(4):319-326, 1992. [doi]

1991

Orientations of graphs in kernel theoryHortensia Galeana-Sánchez, Victor Neumann-Lara. DM, 87(3):271-280, 1991. [doi]

Extending kernel perfect digraphs to kernel perfect critical digraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. DM, 94(3):181-187, 1991. [doi]

Spanning trees with bounded degreesVictor Neumann-Lara, Eduardo Rivera-Campo. combinatorica, 11(1):55-61, 1991.

1988

On multiplicative graphs and the product conjectureRoland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara. combinatorica, 8(1):63-74, 1988.

A combinatorial result on points and circles on the planeVictor Neumann-Lara, Jorge Urrutia. DM, 69(2):173-178, 1988. [doi]

1986

On kernel-perfect critical digraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. DM, 59(3):257-265, 1986. [doi]

Uniquely colourable m-dichromatic oriented graphsVictor Neumann-Lara, Nicola Santoro, Jorge Urrutia. DM, 62(1):65-70, 1986. [doi]

1984

On kernels and semikernels of digraphsHortensia Galeana-Sánchez, Victor Neumann-Lara. DM, 48(1):67-76, 1984. [doi]

A variation of Menger s theorem for long pathsLuis Montejano, Victor Neumann-Lara. JCT, 36(2):213-217, 1984. [doi]

Vertex critical r-dichromatic tournamentsVictor Neumann-Lara, Jorge Urrutia. DM, 49(1):83-87, 1984. [doi]

1982

The dichromatic number of a digraphVictor Neumann-Lara. JCT, 33(3):265-270, 1982. [doi]

Sign in or sign up to see more results.

runs on WebDSL