default search action
Victor Neumann-Lara
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2013
- [j55]Victor Neumann-Lara, Mika Olsen:
Molds of regular tournaments. Ars Comb. 112: 81-96 (2013) - [j54]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): 1427-1439 (2013)
2000 – 2009
- 2009
- [j53]Victor Neumann-Lara, Mika Olsen:
Enumeration and dichromatic number of tame tournaments. Australas. J Comb. 45: 25-36 (2009) - [j52]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
On expansive graphs. Eur. J. Comb. 30(2): 372-379 (2009) - 2008
- [j51]Juan José Montellano-Ballesteros
On a heterochromatic number for hypercubes. Discret. Math. 308(16): 3441-3448 (2008) - [j50]Bernardo Llano, Victor Neumann-Lara:
Circulant tournaments of prime order are tight. Discret. Math. 308(24): 6056-6063 (2008) - 2006
- [j49]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Graph relations, clique divergence and surface triangulations. J. Graph Theory 51(2): 110-122 (2006) - 2005
- [j48]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) - [j47]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: 345-349 (2005) - [j46]Juan José Montellano-Ballesteros
An Anti-Ramsey Theorem on Cycles. Graphs Comb. 21(3): 343-354 (2005) - [j45]Victor Neumann-Lara, Richard G. Wilson:
Compact compatible topologies for graphs with small cycles. Int. J. Math. Math. Sci. 2005(14): 2195-2205 (2005) - 2004
- [j44]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique divergent clockwork graphs and partial orders. Discret. Appl. Math. 141(1-3): 195-207 (2004) - [j43]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): 183-191 (2004) - [j42]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña, Thomas Dale Porter:
A hierarchy of self-clique graphs. Discret. Math. 282(1-3): 193-208 (2004) - [j41]Martín Eduardo Frías-Armenta
Dismantlings and iterated clique graphs. Discret. Math. 282(1-3): 263-265 (2004) - [j40]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On the heterochromatic number of circulant digraphs. Discuss. Math. Graph Theory 24(1): 73-79 (2004) - [j39]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on minimally 3-connected graphs. Discuss. Math. Graph Theory 24(1): 115-123 (2004) - [j38]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): 223-231 (2004) - 2003
- [j37]Xueliang Li, Victor Neumann-Lara, Eduardo Rivera-Campo:
On a tree graph defined by a set of cycles. Discret. Math. 271(1-3): 303-310 (2003) - [j36]Juan José Montellano-Ballesteros
A Linear Heterochromatic Number of Graphs. Graphs Comb. 19(4): 533-536 (2003) - 2002
- [j35]Juan José Montellano-Ballesteros
An Anti-Ramsey Theorem. Comb. 22(3): 445-449 (2002) - [j34]Francisco Larrión, Victor Neumann-Lara:
On clique divergent graphs with linear growth. Discret. Math. 245(1-3): 139-153 (2002) - [j33]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Whitney triangulations, local girth and iterated clique graphs. Discret. Math. 258(1-3): 123-135 (2002) - 2001
- [j32]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
Clique Divergent Clockwork Graphs and Partial Orders. Electron. Notes Discret. Math. 7: 10-13 (2001) - [j31]Francisco Larrión, Victor Neumann-Lara, Miguel A. Pizaña:
On the homotopy type of the clique graph. J. Braz. Comput. Soc. 7(3): 69-73 (2001) - 2000
- [j30]Francisco Larrión, Victor Neumann-Lara:
Locally C6 graphs are clique divergent. Discret. Math. 215: 159-170 (2000) - [j29]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
A class of tight circulant tournaments. Discuss. Math. Graph Theory 20(1): 109-128 (2000) - [j28]Victor Neumann-Lara:
Dichromatic number, circulant tournaments and Zykov sums of digraphs. Discuss. Math. Graph Theory 20(2): 197-207 (2000) - [j27]Juan José Montellano-Ballesteros
Totally Multicoloured Cycles. Electron. Notes Discret. Math. 5: 239-242 (2000)
1990 – 1999
- 1999
- [j26]Bernardo M. Ábrego, Jorge L. Arocha, Silvia Fernández-Merchant
Tightness problems in the plane. Discret. Math. 194(1-3): 1-11 (1999) - [j25]Francisco Larrión, Victor Neumann-Lara:
Clique divergent graphs with unbounded sequence of diameters. Discret. Math. 197-198: 491-501 (1999) - [j24]Victor Neumann-Lara:
The acyclic disconnection of a digraph. Discret. Math. 197-198: 617-632 (1999) - [j23]Victor Neumann-Lara, Eduardo Rivera-Campo, Jorge Urrutia:
A note on covering the edges of a graph with bonds. Discret. Math. 197-198: 633-636 (1999) - 1998
- [j22]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
New classes of critical kernel-imperfect digraphs. Discuss. Math. Graph Theory 18(1): 85-89 (1998) - 1997
- [j21]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): 307-318 (1997) - [j20]Victor Neumann-Lara, Eduardo Rivera-Campo:
Euler tours and a game with dominoes. Discret. Math. 167-168: 511-517 (1997) - [j19]Victor Neumann-Lara:
Vertex critical 4-dichromatic circulant tournaments. Discret. Math. 170(1-3): 289-291 (1997) - [j18]Francisco Larrión, Victor Neumann-Lara:
A Family of Clique Divergent Graphs with Linear Growth. Graphs Comb. 13(3): 263-266 (1997) - 1996
- [j17]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
KP-digraphs and CKI-digraphs satisfying the k-Meyniel's condition. Discuss. Math. Graph Theory 16(1): 5-16 (1996) - 1995
- [j16]Jorge L. Arocha, Javier Bracho
Tight and Untight Triangulations of Surfaces by Complete Graphs. J. Comb. Theory B 63(2): 185-199 (1995) - [c1]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: 71-78 - 1994
- [j15]Victor Neumann-Lara:
The 3 and 4-dichromatic tournaments of minimum order. Discret. Math. 135(1-3): 233-243 (1994) - [j14]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
New Extensions of Kernel Perfect Digraphs to Kernel Imperfect Critical Digraphs. Graphs Comb. 10(2-4): 329-336 (1994) - [j13]Victor Neumann-Lara:
A Short Proof of a Theorem of Reid and Parker on Tournaments. Graphs Comb. 10(2-4): 363-366 (1994) - 1992
- [j12]Jorge L. Arocha, Javier Bracho
On the minimum size of tight hypergraphs. J. Graph Theory 16(4): 319-326 (1992) - 1991
- [j11]Victor Neumann-Lara, Eduardo Rivera-Campo:
Spanning trees with bounded degrees. Comb. 11(1): 55-61 (1991) - [j10]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Orientations of graphs in kernel theory. Discret. Math. 87(3): 271-280 (1991) - [j9]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
Extending kernel perfect digraphs to kernel perfect critical digraphs. Discret. Math. 94(3): 181-187 (1991)
1980 – 1989
- 1988
- [j8]Roland Häggkvist, Pavol Hell, Donald J. Miller, Victor Neumann-Lara:
On multiplicative graphs and the product conjecture. Comb. 8(1): 63-74 (1988) - [j7]Victor Neumann-Lara, Jorge Urrutia:
A combinatorial result on points and circles on the plane. Discret. Math. 69(2): 173-178 (1988) - 1986
- [j6]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernel-perfect critical digraphs. Discret. Math. 59(3): 257-265 (1986) - [j5]Victor Neumann-Lara, Nicola Santoro
Uniquely colourable m-dichromatic oriented graphs. Discret. Math. 62(1): 65-70 (1986) - 1984
- [j4]Hortensia Galeana-Sánchez, Victor Neumann-Lara:
On kernels and semikernels of digraphs. Discret. Math. 48(1): 67-76 (1984) - [j3]Victor Neumann-Lara, Jorge Urrutia:
Vertex critical r-dichromatic tournaments. Discret. Math. 49(1): 83-87 (1984) - [j2]Luis Montejano, Victor Neumann-Lara:
A variation of Menger's theorem for long paths. J. Comb. Theory B 36(2): 213-217 (1984) - 1982
- [j1]Victor Neumann-Lara:
The dichromatic number of a digraph. J. Comb. Theory B 33(3): 265-270 (1982)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-05 01:13 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: