Items where Author is "Lehel, Jenő"
 | Up a level |
Number of items: 54.
ISI Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2010 | Cropper, M. and Hilton, A. J. W. and Johnson, P. D. and Lehel, Jenő List multicoloring problems involving the k-fold hall numbers | ISI Article | |
| 2010 | Füredi, Zoltán and Lehel, Jenő Tight embeddings of partial quadrilateral packings | ISI Article | |
| 2009 | Lehel, Jenő and Maffray, Frédéric and Preissmann, Myriam Maximum directed cuts in digraphs with degree restriction | ISI Article | |
| 2008 | Balister, P. N. and Győri, E. and Lehel, Jenő and Schelp, R. H. Connected graphs without long paths | ISI Article | |
| 2008 | Gyárfás, András and Lehel, Jenő and Sárközy, Gábor and Schelp, Richard Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs | ISI Article | |
| 2007 | Gyárfás, András and Lehel, Jenő and Schelp, Richard H. Finding a monochromatic subgraph or a rainbow path | ISI Article | |
| 2007 | Alon, Noga and Bollobás, Béla and Gyárfás, András and Lehel, Jenő and Scott, Alex Maximum directed cuts in acyclic digraphs | ISI Article | |
| 2006 | Kubicki, Grzegorz and Lehel, Jenő and Schelp, Richard Counting chains and antichains in the complete binary tree | ISI Article | |
| 2006 | Cropper, M. and Gyárfás, András and Lehel, Jenő Hall ratio of the Mycielski graphs | ISI Article | |
| 2006 | Balister, P. and Gyárfás, András and Lehel, Jenő and Schelp, R. Mono-multi bipartite Ramsey numbers, designs, and matrices | ISI Article | |
| 2006 | Gyárfás, András and Jacobson, M. and Kezdy, A. and Lehel, Jenő Odd cycles and Theta-cycles in hypergraphs | ISI Article | |
| 2006 | Balister, P. and Lehel, Jenő and Schelp, R. Ramsey unsaturated and saturated graphs | ISI Article |
Article
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2004 | Balister, PN and Győri, E. and Lehel, Jenő and Schelp, RH Longest paths in circular arc graphs | Article | |
| 2004 | Chang, YW and Hutchinson, JP and Jacobson, MS and Lehel, Jenő and West, DB The bar visibility number of a graph | Article | |
| 2003 | Cropper, M. and Gyárfás, András and Lehel, Jenő Edge list multicoloring trees: an extension of Hall's theorem | Article | |
| 2003 | Kézdy, AE and Lehel, Jenő and Powers, RC Heavy transversals and indecomposable hypergraphs | Article | |
| 2003 | Kubicki, G. and Lehel, Jenő and Morayne, M. An asymptotic ratio in the complete binary tree | Article | |
| 2002 | Kubiczki, G. and Lehel, Jenő and Morayne, M. Patch colorings and rigid colorings of the rational n-space | Article | |
| 2002 | Gyárfás, András and Kézdy, AE and Lehel, Jenő A finite basis characterization of a-split colorings | Article | |
| 2002 | Kubiczki, G. and Lehel, Jenő and Morayne, M. A ratio inequalitiy for binary trees and the best secretary | Article | |
| 2001 | Erdős, P. and Faudree, RJ and Lehel, Jenő and Gould, RJ Edge disjoint monochromatic triangles in 2-colored graphs | Article | |
| 2001 | Faudree, RJ and Flandrin, E. and Jacobson, MS and Lehel, Jenő and Schelp, RH Even cycles in graphs with many odd | Article | |
| 2001 | Kubicki, G. and Lehel, Jenő and Morayne, M. Totally positive matrices and totally positive hypergraphs | Article | |
| 2000 | Chen, G. and Jacobson, MS and Kézdy, AE and Lehel, Jenő and Scheinerman, ER and Wang, C. Clique covering the edges of a locally cobipartite graph | Article | |
| 2000 | Lehel, Jenő and Levi, I. Loops with partitions and matchings | Article | |
| 2000 | Cropper, M. and Lehel, Jenő The list multi-coloring of trees with Hall's condition | Article | |
| 1999 | Jacobson, M. and Kézdy, A. and Lehel, Jenő Scenic graphs II: non-traceable graphs | Article | |
| 1998 | Chen, G. and Lehel, Jenő and Jacobson, MS and Shreve, WE Note on graphs without repeated cycle lengths | Article | |
| 1998 | Jacobson, MS and Kézdy, AE and Lehel, Jenő Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete | Article | |
| 1998 | Jacobson, MS and Kézdy, AE and Lehel, Jenő Scenic graphs I: traceable graphs | Article | |
| 1998 | Chen, G. and Jacobson, MS and Kézdy, AE and Lehel, Jenő Tough enough chordal graphs are Hamiltonian | Article | |
| 1997 | Gyárfás, András and Király, Z. and Lehel, Jenő On-line 3-chromatic graphs - II. Critical graphs | Article | |
| 1997 | Jacobson, MS and Kézdy, AE and Lehel, Jenő Recognizing intersection graphs of linear uniform hypergraphs | Article | |
| 1996 | Faudree, RJ and Gould, RJ and Jacobson, MS and Lehel, Jenő and Lesniak, LM Graph spectra | Article | |
| 1996 | Lehel, Jenő and Maffray, F. and Preismann, M. Graphs with largest number of minimum cuts | Article | |
| 1996 | Gyárfás, András and Kratsch, D. and Lehel, Jenő and Maffray, F. Minimal non-neighbourhood perfect graphs | Article | |
| 1996 | Kratsch, D. and Lehel, Jenő and Muller, H. Toughness, Hamiltonicity and split graphs | Article | |
| 1995 | Jacobson, MS and Lehel, Jenő Irregular embeddings of hypergraphs with fixed chromatic number | Article | |
| 1995 | Jacobson, MS and Lehel, Jenő Irregular embeddings of multigraphs with fixed chromatic number | Article | |
| 1995 | Gyárfás, András and Lehel, Jenő Linear sets with five distinct differences among any four elements | Article | |
| 1994 | Lehel, Jenő Neighbourhood-perfect line graphs | Article | |
| 1994 | Faudree, RJ and Schelp, RH and Lesniak, L. and Gyárfás, András and Lehel, Jenő On the rotation distance of graphs | Article | |
| 1993 | Jacobson, MS and Lehel, Jenő and Lesniak, LM [phi]-threshold and [phi]-tolerance chain graphs | Article | |
| 1992 | Gyárfás, András and Jacobson, MS and Kinch, L. and Lehel, Jenő and Schelp, RH Irregularity strength of uniform hypergraphs | Article | |
| 1992 | Faudree, RJ and Gyárfás, András and Lehel, Jenő Minimal path-pairable graphs | Article | |
| 1992 | Csaba, L. and Faudree, RJ and Gyárfás, András and Lehel, Jenő and Schelp, RH Networks communicating for each pairing of terminals | Article | |
| 1992 | Faudree, RJ and Gyárfás, András and Lehel, Jenő Three-regular path pairable graphs | Article |
Book Section
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 1999 | Kézdy, A. and Lehel, Jenő Degree sequences of graphs with prescribed cique size | Book Section | |
| 1999 | Kubicka, E. and Kubicki, G. and Lehel, Jenő Path-pairable property for complete grids | Book Section | |
| 1999 | Gould, RJ and Jacobson, MS and Lehel, Jenő Potentially G-grafical degree sequences | Book Section |
Conference or Workshop Item
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 1993 | Gyárfás, András and Király, Z. and Lehel, Jenő On-line graph coloring and finite basis problems | Conference or Workshop Item |
Book
| Date | Author/Title | Document Type | |
|---|---|---|---|
| 2000 | Cropper, M. and Jacobson, MS and Gyárfás, András and Lehel, Jenő The Hall ratio of graphs and hypergraphs. (Les cahiers du Laboratoire Leibniz., No. 17.) | Book | |
| 1993 | Kratsch, D. and Lehel, Jenő and Müller, H. Toughness, hamiltonicity and split graphs. (Friederich-Schiller-Universitat. Forschungsergebnisse der Fakultat für Mathematik und Informatik. Math/93/5.) | Book | |
| 1992 | Lehel, Jenő and Maffray, F. and Preissmann, M. Graphs with maximal number of minimum cuts (LSD -ARTEMIS. Rapport de recherche RR880-M) | Book |
