Fakultät für Informatik
-
Technische Universität München
Lehrstuhl für Effiziente Algorithmen
Die bibliographische Datenbank LEABib
Suchen
•
Liste der Journale
•
Liste der Serien
•
Liste der Konferenzen
•
Ausgewählte Publikationen
[1]
Hilfe
Suche: Author="Neumann-Lara, V."
Als [
bib
] [
pdf
] [
ps
] [
dvi
] [
xml
] herunterladen.
Graph relations, clique divergence and surface triangulations
F. Larrión
,
V. Neumann-Lara
,
M.A. Pizaña
Journal of Graph Theory
51
(2), 2006, pp. 110-122
An anti-Ramsey theorem on cycles
J.J. Montellano-Ballesteros
,
V. Neumann-Lara
Graphs and Combinatorics
21
(3), 2005, pp. 343-354
A linear heterochromatic number of graphs
J.J. Montellano-Ballesteros
,
V. Neumann-Lara
Graphs and Combinatorics
19
(4), 2003, pp. 533-536
An anti-Ramsey theorem
J.J. Montellano-Ballesteros
,
V. Neumann-Lara
Combinatorica
22
(3), 2002, pp. 445-449
A family of clique divergent graphs with linear growth
F. Larrión
,
V. Neumann-Lara
Graphs and Combinatorics
13
, 1997, pp. 263-266
New extensions of kernel-perfect digraphs to kernel imperfect critical digraphs
Sánchez H. Galeana
,
V. Neumann-Lara
Graphs and Combinatorics
10
, 1994, pp. 329-336
A short proof of a theorem of Reid and Parker on tournaments
V. Neumann-Lara
Graphs and Combinatorics
10
, 1994, pp. 363-366
A variation of Menger's theorem for long paths
L. Montejano
,
V. Neumann-Lara
Journal of Combinatorial Theory Series B
36
, 1984, pp. 213-217
The dichromatic number of a digraph
V. Neumann-Lara
Journal of Combinatorial Theory Series B
33
(3), 1982, December, pp. 265-270