The following pages link to Jenő Lehel (Q185069):
Displaying 16 items.
- Ramsey number of paths and connected matchings in Ore-type host graphs (Q267181) (← links)
- Detour trees (Q277622) (← links)
- Locating pairs of vertices on a Hamiltonian cycle in bigraphs (Q293624) (← links)
- (Q311566) (redirect page) (← links)
- Red-blue clique partitions and \((1-1)\)-transversals (Q311567) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- (Q583205) (redirect page) (← links)
- Gallai-type results for multiple boxes and forests (Q583206) (← links)
- Trees in greedy colorings of hypergraphs (Q616002) (← links)
- \(\phi\)-threshold and \(\phi\)-tolerance chain graphs (Q686259) (← links)
- Note on locating pairs of vertices on Hamiltonian cycles (Q742600) (← links)
- Edge list multicoloring trees: An extension of Hall's theorem (Q4800403) (← links)
- An asymptotic resolution of a conjecture of Szemerédi and Petruska (Q6041571) (← links)
- Order plus size of τ‐critical graphs (Q6055381) (← links)
- Helly-type theorems for the ordering of the vertices of a hypergraph (Q6139863) (← links)
- The equivalence of the Szemerédi and Petruska conjecture and the maximum order of 3-uniform \(\tau\)-critical hypergraphs (Q6166161) (← links)
