Jenö Lehel

According to our database1, Jenö Lehel authored at least 82 papers between 1980 and 2018.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of one.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepages:

On csauthors.net:

Bibliography

2018
Linkage on the infinite grid.
Inf. Process. Lett., 2018

A panconnectivity theorem for bipartite graphs.
Discrete Mathematics, 2018

The minimum size of graphs satisfying cut conditions.
Discrete Applied Mathematics, 2018

2016
Random Hypergraph Irregularity.
SIAM J. Discrete Math., 2016

Vertex Coloring of Graphs by Total 2-Weightings.
Graphs and Combinatorics, 2016

Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs.
Graphs and Combinatorics, 2016

Ramsey number of paths and connected matchings in Ore-type host graphs.
Discrete Mathematics, 2016

Detour trees.
Discrete Applied Mathematics, 2016

Red-Blue Clique Partitions and (1-1)-Transversals.
Electr. J. Comb., 2016

2014
Note on Locating Pairs of Vertices on Hamiltonian Cycles.
Graphs and Combinatorics, 2014

2013
Repeated Degrees in Random Uniform Hypergraphs.
SIAM J. Discrete Math., 2013

2011
Trees in greedy colorings of hypergraphs.
Discrete Mathematics, 2011

2010
List multicoloring problems involving the k-fold Hall numbers.
Journal of Graph Theory, 2010

Tight embeddings of partial quadrilateral packings.
J. Comb. Theory, Ser. A, 2010

2009
Maximum directed cuts in digraphs with degree restriction.
Journal of Graph Theory, 2009

2008
Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs.
J. Comb. Theory, Ser. B, 2008

Connected graphs without long paths.
Discrete Mathematics, 2008

2007
Adjacent Vertex Distinguishing Edge-Colorings.
SIAM J. Discrete Math., 2007

Finding a monochromatic subgraph or a rainbow path.
Journal of Graph Theory, 2007

Maximum directed cuts in acyclic digraphs.
Journal of Graph Theory, 2007

2006
Ramsey unsaturated and saturated graphs.
Journal of Graph Theory, 2006

Mono-multi bipartite Ramsey numbers, designs, and matrices.
J. Comb. Theory, Ser. A, 2006

Odd cycles and Theta-cycles in hypergraphs.
Discrete Mathematics, 2006

Hall ratio of the Mycielski graphs.
Discrete Mathematics, 2006

Counting chains and antichains in the complete binary tree.
Ars Comb., 2006

2004
The Bar Visibility Number of a Graph.
SIAM J. Discrete Math., 2004

Longest Paths in Circular Arc Graphs.
Combinatorics, Probability & Computing, 2004

2003
An Asymptotic Ratio in the Complete Binary Tree.
Order, 2003

Edge list multicoloring trees: An extension of Hall's theorem.
Journal of Graph Theory, 2003

Heavy Transversals and Indecomposable Hypergraphs.
Combinatorica, 2003

2002
Patch Colorings and Rigid Colorings of the Rational n-Space.
J. Comb. Theory, Ser. B, 2002

Foreword.
Discrete Mathematics, 2002

A finite basis characterization of ?-split colorings.
Discrete Mathematics, 2002

A Ratio Inequality For Binary Trees And The Best Secretary.
Combinatorics, Probability & Computing, 2002

2001
Edge disjoint monochromatic triangles in 2-colored graphs.
Discrete Mathematics, 2001

2000
Even Cycles in Graphs with Many Odd Cycles.
Graphs and Combinatorics, 2000

Clique covering the edges of a locally cobipartite graph.
Discrete Mathematics, 2000

1999
On-Line 3-Chromatic Graphs I. Triangle-Free Graphs.
SIAM J. Discrete Math., 1999

Loops With Partitions and Matchings.
Ars Comb., 1999

Scenic graphs II: non-traceable graphs.
Australasian J. Combinatorics, 1999

1998
Recognizing triangle-free graphs with induced path-cycle double covers is NP-complete.
Networks, 1998

Tough enough chordal graphs are Hamiltonian.
Networks, 1998

Note on graphs without repeated cycle lengths.
Journal of Graph Theory, 1998

Scenic Graphs I: Traceable Graphs.
Ars Comb., 1998

1997
Recognizing Intersection Graphs of Linear Uniform Hypergraphs.
Graphs and Combinatorics, 1997

The partition of a uniform hypergraph into pairs of dependent hyperedges.
Discrete Mathematics, 1997

On-line 3-chromatic graphs - II critical graphs.
Discrete Mathematics, 1997

1996
Minimal non-neighborhood-perfect graphs.
Journal of Graph Theory, 1996

Toughness, hamiltonicity and split graphs.
Discrete Mathematics, 1996

Graph spectra.
Discrete Mathematics, 1996

Graphs with Largest Number of Minimum Cuts.
Discrete Applied Mathematics, 1996

1995
Linear Sets with Five Distinct Differences among Any Four Elements.
J. Comb. Theory, Ser. B, 1995

Irregular embeddings of multigraphs with fixed chromatic number.
Discrete Mathematics, 1995

Irregular embeddings of hypergraphs with fixed chromatic number.
Discrete Mathematics, 1995

1994
Neighbourhood-Perfect Line Graphs.
Graphs and Combinatorics, 1994

On the rotation distance of graphs.
Discrete Mathematics, 1994

1993
Ø-Threshold and Ø-Tolerance Chain Graphs.
Discrete Applied Mathematics, 1993

1992
Networks communicating for each pairing of terminals.
Networks, 1992

Three-regular path pairable graphs.
Graphs and Combinatorics, 1992

1991
The irregularity strength of tP3.
Discrete Mathematics, 1991

Irregularity strength of dense graphs.
Discrete Mathematics, 1991

Effective on-line coloring of P5-free graphs.
Combinatorica, 1991

1989
The minimum number of triangles covering the edges of a graph.
Journal of Graph Theory, 1989

M-chain graphs of posets.
Discrete Mathematics, 1989

Irregular networks, regular graphs and integer matrices with distinct row and column sums.
Discrete Mathematics, 1989

1988
On-line and first fit colorings of graphs.
Journal of Graph Theory, 1988

Gallai-type Results for Multiple Boxes and Forests.
Eur. J. Comb., 1988

Clumsy packing of dominoes.
Discrete Mathematics, 1988

1987
Local k-colorings of graphs and hypergraphs.
J. Comb. Theory, Ser. B, 1987

Ramsey numbers for local colorings.
Graphs and Combinatorics, 1987

Covering with Euclidean Boxes.
Eur. J. Comb., 1987

1986
Neighborhood perfect graphs.
Discrete Mathematics, 1986

1985
A characterization of totally balanced hypergraphs.
Discrete Mathematics, 1985

Covering and coloring problems for relatives of intervals.
Discrete Mathematics, 1985

How many atoms can be defined by boxes.
Combinatorica, 1985

1984
The structure of rectangle families dividing the plane into maximum number of atoms.
Discrete Mathematics, 1984

1983
Hypergraph families with bounded edge cover or transversal number.
Combinatorica, 1983

1982
Triangle-free partial graphs and edge covering theorems.
Discrete Mathematics, 1982

Covers in hypergraphs.
Combinatorica, 1982

1981
Generating all 4-regular planar graphs from the graph of the octahedron.
Journal of Graph Theory, 1981

1980
Ensembles d'articulation d'un graphe γ-critique.
Discrete Mathematics, 1980

Deltahedra are realizable as simplicial convex polyhedra.
Discrete Applied Mathematics, 1980


  Loading...