Jenö Lehel - RankMe

72 papers Journal 72

Year	Rank	Type	Title / Venue / Authors
2016	J	`jnl`	Detour trees. Discret. Appl. Math. Adam S. Jobson, André E. Kézdy, Jenö Lehel, Susan C. White
2016	J	`jnl`	Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs. Graphs Comb. Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto
2016	J	`jnl`	Random Hypergraph Irregularity. SIAM J. Discret. Math. Paul N. Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
2013	J	`jnl`	Repeated Degrees in Random Uniform Hypergraphs. SIAM J. Discret. Math. Paul Balister, Béla Bollobás, Jenö Lehel, Michal Morayne
2011	J	`jnl`	Trees in greedy colorings of hypergraphs. Discret. Math. András Gyárfás, Jenö Lehel
2010	J	`jnl`	List multicoloring problems involving the J. Graph Theory Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel
2010	J	`jnl`	Tight embeddings of partial quadrilateral packings. J. Comb. Theory A Zoltán Füredi, Jenö Lehel
2009	J	`jnl`	Maximum directed cuts in digraphs with degree restriction. J. Graph Theory Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2008	J	`jnl`	Connected graphs without long paths. Discret. Math. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2008	J	`jnl`	Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs. J. Comb. Theory B András Gyárfás, Jenö Lehel, Gábor N. Sárközy, Richard H. Schelp
2007	J	`jnl`	Adjacent Vertex Distinguishing Edge-Colorings. SIAM J. Discret. Math. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2007	J	`jnl`	Finding a monochromatic subgraph or a rainbow path. J. Graph Theory András Gyárfás, Jenö Lehel, Richard H. Schelp
2007	J	`jnl`	Maximum directed cuts in acyclic digraphs. J. Graph Theory Noga Alon, Béla Bollobás, András Gyárfás, Jenö Lehel, Alex D. Scott
2007	J	`jnl`	Maximum directed cuts in digraphs with degree restriction CoRR Jenö Lehel, Frédéric Maffray, Myriam Preissmann
2006	J	`jnl`	Hall ratio of the Mycielski graphs. Discret. Math. Mathew Cropper, András Gyárfás, Jenö Lehel
2006	J	`jnl`	Mono-multi bipartite Ramsey numbers, designs, and matrices. J. Comb. Theory A Paul N. Balister, András Gyárfás, Jenö Lehel, Richard H. Schelp
2006	J	`jnl`	Odd cycles and Theta-cycles in hypergraphs. Discret. Math. András Gyárfás, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
2006	J	`jnl`	Ramsey unsaturated and saturated graphs. J. Graph Theory Paul N. Balister, Jenö Lehel, Richard H. Schelp
2004	J	`jnl`	Longest Paths in Circular Arc Graphs. Comb. Probab. Comput. Paul N. Balister, Ervin Györi, Jenö Lehel, Richard H. Schelp
2004	J	`jnl`	The Bar Visibility Number of a Graph. SIAM J. Discret. Math. Yi-Wu Chang, Joan P. Hutchinson, Michael S. Jacobson, Jenö Lehel, Douglas B. West
2003	J	`jnl`	An Asymptotic Ratio in the Complete Binary Tree. Order Grzegorz Kubicki, Jenö Lehel, Michal Morayne
2003	J	`jnl`	Edge list multicoloring trees: An extension of Hall's theorem. J. Graph Theory Mathew Cropper, András Gyárfás, Jenö Lehel
2003	J	`jnl`	Heavy Transversals and Indecomposable Hypergraphs. Comb. André E. Kézdy, Jenö Lehel, Robert C. Powers
2002	J	`jnl`	A Ratio Inequality For Binary Trees And The Best Secretary. Comb. Probab. Comput. Grzegorz Kubicki, Jenö Lehel, Michal Morayne
2002	J	`jnl`	A finite basis characterization of ?-split colorings. Discret. Math. András Gyárfás, André E. Kézdy, Jenö Lehel
2002	J	`jnl`	Foreword. Discret. Math. Grzegorz Kubicki, Jenö Lehel
2002	J	`jnl`	Patch Colorings and Rigid Colorings of the Rational n-Space. J. Comb. Theory B Grzegorz Kubicki, Jenö Lehel, Michal Morayne
2001	J	`jnl`	Edge disjoint monochromatic triangles in 2-colored graphs. Discret. Math. Paul Erdös, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel
2000	J	`jnl`	Clique covering the edges of a locally cobipartite graph. Discret. Math. Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel, Edward R. Scheinerman, Chi Wang
1999	J	`jnl`	Loops With Partitions and Matchings. Ars Comb. Jenö Lehel, Inessa Levi
1999	J	`jnl`	On-Line 3-Chromatic Graphs I. Triangle-Free Graphs. SIAM J. Discret. Math. András Gyárfás, Zoltán Király, Jenö Lehel
1998	J	`jnl`	Note on graphs without repeated cycle lengths. J. Graph Theory Guantao Chen, Jenö Lehel, Michael S. Jacobson, Warren E. Shreve
1998	J	`jnl`	Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete. Networks Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1998	J	`jnl`	Scenic Graphs I: Traceable Graphs. Ars Comb. Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1998	J	`jnl`	Tough enough chordal graphs are Hamiltonian. Networks Guantao Chen, Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1997	J	`jnl`	On-line 3-chromatic graphs - II critical graphs. Discret. Math. András Gyárfás, Zoltán Király, Jenö Lehel
1997	J	`jnl`	Recognizing Intersection Graphs of Linear Uniform Hypergraphs. Graphs Comb. Michael S. Jacobson, André E. Kézdy, Jenö Lehel
1997	J	`jnl`	The partition of a uniform hypergraph into pairs of dependent hyperedges. Discret. Math. Jenö Lehel
1996	J	`jnl`	Graph spectra. Discret. Math. Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
1996	J	`jnl`	Graphs with Largest Number of Minimum Cuts. Discret. Appl. Math. Jenö Lehel, Frédéric Maffray, Myriam Preissmann
1996	J	`jnl`	Minimal non-neighborhood-perfect graphs. J. Graph Theory András Gyárfás, Dieter Kratsch, Jenö Lehel, Frédéric Maffray
1996	J	`jnl`	Toughness, hamiltonicity and split graphs. Discret. Math. Dieter Kratsch, Jenö Lehel, Haiko Müller
1995	J	`jnl`	Irregular embeddings of hypergraphs with fixed chromatic number. Discret. Math. Michael S. Jacobson, Jenö Lehel
1995	J	`jnl`	Irregular embeddings of multigraphs with fixed chromatic number. Discret. Math. Michael S. Jacobson, Jenö Lehel
1995	J	`jnl`	Linear Sets with Five Distinct Differences among Any Four Elements. J. Comb. Theory B András Gyárfás, Jenö Lehel
1994	J	`jnl`	Neighbourhood-Perfect Line Graphs. Graphs Comb. Jenö Lehel
1994	J	`jnl`	On the rotation distance of graphs. Discret. Math. Ralph J. Faudree, Richard H. Schelp, Linda M. Lesniak, András Gyárfás, Jenö Lehel
1993	J	`jnl`	Ø-Threshold and Ø-Tolerance Chain Graphs. Discret. Appl. Math. Michael S. Jacobson, Jenö Lehel, Linda M. Lesniak
1992	J	`jnl`	Networks communicating for each pairing of terminals. Networks László Csaba, Ralph J. Faudree, András Gyárfás, Jenö Lehel, Richard H. Schelp
1992	J	`jnl`	Three-regular path pairable graphs. Graphs Comb. Ralph J. Faudree, András Gyárfás, Jenö Lehel
1991	J	`jnl`	Effective on-line coloring of P Comb. András Gyárfás, Jenö Lehel
1991	J	`jnl`	Irregularity strength of dense graphs. Discret. Math. Ralph J. Faudree, Michael S. Jacobson, Lael F. Kinch, Jenö Lehel
1991	J	`jnl`	The irregularity strength of tP Discret. Math. Lael F. Kinch, Jenö Lehel
1989	J	`jnl`	Irregular networks, regular graphs and integer matrices with distinct row and column sums. Discret. Math. Ralph J. Faudree, Richard H. Schelp, Michael S. Jacobson, Jenö Lehel
1989	J	`jnl`	M-chain graphs of posets. Discret. Math. Jenö Lehel, Fred R. McMorris, Debra D. Scott
1989	J	`jnl`	The minimum number of triangles covering the edges of a graph. J. Graph Theory Jenö Lehel
1988	J	`jnl`	Clumsy packing of dominoes. Discret. Math. András Gyárfás, Jenö Lehel, Zsolt Tuza
1988	J	`jnl`	Gallai-type Results for Multiple Boxes and Forests. Eur. J. Comb. Jenö Lehel
1988	J	`jnl`	On-line and first fit colorings of graphs. J. Graph Theory András Gyárfás, Jenö Lehel
1987	J	`jnl`	Covering with Euclidean Boxes. Eur. J. Comb. Imre Bárány, Jenö Lehel
1987	J	`jnl`	Local J. Comb. Theory B András Gyárfás, Jenö Lehel, Jaroslav Nesetril, Vojtech Rödl, Richard H. Schelp, Zsolt Tuza
1986	J	`jnl`	Neighborhood perfect graphs. Discret. Math. Jenö Lehel, Zsolt Tuza
1985	J	`jnl`	A characterization of totally balanced hypergraphs. Discret. Math. Jenö Lehel
1985	J	`jnl`	Covering and coloring problems for relatives of intervals. Discret. Math. András Gyárfás, Jenö Lehel
1985	J	`jnl`	How many atoms can be defined by boxes. Comb. András Gyárfás, Jenö Lehel, Zsolt Tuza
1984	J	`jnl`	The structure of rectangle families dividing the plane into maximum number of atoms. Discret. Math. András Gyárfás, Jenö Lehel, Zsolt Tuza
1983	J	`jnl`	Hypergraph families with bounded edge cover or transversal number. Comb. András Gyárfás, Jenö Lehel
1982	J	`jnl`	Covers in hypergraphs. Comb. Jenö Lehel
1982	J	`jnl`	Triangle-free partial graphs and edge covering theorems. Discret. Math. Jenö Lehel, Zsolt Tuza
1981	J	`jnl`	Generating all 4-regular planar graphs from the graph of the octahedron. J. Graph Theory Jenö Lehel
1980	J	`jnl`	Deltahedra are realizable as simplicial convex polyhedra. Discret. Appl. Math. Jenö Lehel
1980	J	`jnl`	Ensembles d'articulation d'un graphe γ-critique. Discret. Math. Jenö Lehel, Zsolt Tuza