The following pages link to Jenő Lehel (Q185069):
Displaying 50 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)
- Petruska's question on planar convex sets (Q776273) (← links)
- Mono-multi bipartite Ramsey numbers, designs, and matrices (Q817616) (← links)
- Sum-distinct sequences and Fibonacci numbers (Q914722) (← links)
- Connected graphs without long paths (Q941391) (← links)
- Tight embeddings of partial quadrilateral packings (Q965225) (← links)
- The \(k\)-fold list coloring of cycles with Hall's condition (Q1011879) (← links)
- (Q1066917) (redirect page) (← links)
- A characterization of totally balanced hypergraphs (Q1066918) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Covering with Euclidean boxes (Q1091402) (← links)
- Deltahedra are realizable as simplicial convex polyhedra (Q1139597) (← links)
- Ensembles d'articulation d'un graphe \(\gamma\)-critique (Q1140657) (← links)
- Triangle-free partial graphs and edge covering theorems (Q1171575) (← links)
- Effective on-line coloring of \(P_ 5\)-free graphs (Q1180418) (← links)
- The irregularity strength of \(tP_ 3\) (Q1182742) (← links)
- Three-regular path pairable graphs (Q1187948) (← links)
- Neighbourhood-perfect line graphs (Q1343228) (← links)
- The partition of a uniform hypergraph into pairs of dependent hyperedges (Q1356565) (← links)
- Recognizing intersection graphs of linear uniform hypergraphs (Q1376077) (← links)
- On-line 3-chromatic graphs. II: Critical graphs (Q1377872) (← links)
- An asymptotic ratio in the complete binary tree (Q1425163) (← links)
- Clique covering the edges of a locally cobipartite graph (Q1567657) (← links)
- Linkage on the infinite grid (Q1641161) (← links)
- The minimum size of graphs satisfying cut conditions (Q1701098) (← links)
- M-chain graphs of posets (Q1823266) (← links)
- Irregular networks, regular graphs and integer matrices with distinct row and column sums (Q1825880) (← links)
- Covers in hypergraphs (Q1838499) (← links)
- A finite basis characterization of alpha-split colorings (Q1850023) (← links)
- Patch colorings and rigid colorings of the rational \(n\)-space (Q1850575) (← links)
- Heavy transversals and indecomposable hypergraphs (Q1878601) (← links)
- Linear sets with five distinct differences among any four elements (Q1892854) (← links)
- Irregular embeddings of hypergraphs with fixed chromatic number (Q1901037) (← links)
- Irregular embeddings of multigraphs with fixed chromatic number (Q1901051) (← links)
- Graph spectra (Q1916101) (← links)
- Toughness, hamiltonicity and split graphs (Q1916113) (← links)
- Graphs with largest number of minimum cuts (Q1917282) (← links)
- On path-pairability of the finite grids (Q2010412) (← links)
- Eckhoff's problem on convex sets in the plane (Q2049618) (← links)
- Path-pairability of infinite planar grids (Q2052787) (← links)
