The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- A note on the polytope of bipartite TSP (Q1682883) (← links)
- Multiprofessor scheduling (Q1686063) (← links)
- Graph labeling games (Q1687839) (← links)
- Restricted assignment scheduling with resource constraints (Q1713408) (← links)
- Subexponential-time algorithms for maximum independent set in \(P_t\)-free and broom-free graphs (Q1725633) (← links)
- Domination game on uniform hypergraphs (Q1732097) (← links)
- Finding a potential community in networks (Q1737592) (← links)
- Tropical dominating sets in vertex-coloured graphs (Q1748204) (← links)
- A general bin packing game: interest taken into account (Q1750357) (← links)
- Extended bicolorings of Steiner triple systems of order \(2^{h}-1\) (Q1750737) (← links)
- Grundy dominating sequences and zero forcing sets (Q1751247) (← links)
- Bin packing games with weight decision: how to get a small value for the price of anarchy (Q1757770) (← links)
- Semi-on-line scheduling on two parallel processors with an upper bound on the items (Q1762979) (← links)
- Strong branchwidth and local transversals (Q1764812) (← links)
- Graphs with no induced \(C_ 4\) and \(2K_ 2\) (Q1801686) (← links)
- Disjoint blocking sets in cycle systems (Q1808812) (← links)
- On two intersecting set systems and k-continuous Boolean functions (Q1820783) (← links)
- Another extremal property of some Turán graphs (Q1820793) (← links)
- An upper bound on the Ramsey number of trees (Q1821795) (← links)
- Minimum number of elements of representing a set system of given rank (Q1823939) (← links)
- 4-chromatic graphs with large odd girth (Q1842185) (← links)
- Distance graphs with finite chromatic number (Q1850605) (← links)
- Strict colorings of Steiner triple and quadruple systems: A survey (Q1861307) (← links)
- On short cycles through prescribed vertices of a graph (Q1883253) (← links)
- The expected relative error of the polyhedral approximation of the max- cut problem (Q1892101) (← links)
- Searching for acyclic orientations of graphs (Q1898338) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Covering and independence in triangle structures (Q1916100) (← links)
- The irregularity strength and cost of the union of cliques (Q1916108) (← links)
- Small transversals in uniform hypergraphs (Q1920046) (← links)
- Ramsey-remainder (Q1922879) (← links)
- The forwarding index of directed networks (Q1923618) (← links)
- Small edge sets meeting all triangles of a graph (Q1926043) (← links)
- Colorability of mixed hypergraphs and their chromatic inversions (Q1956247) (← links)
- Uncolorable mixed hypergraphs (Q1962044) (← links)
- On-line rankings of graphs (Q1970586) (← links)
- Extremal bi-Helly families (Q1970723) (← links)
- The variety of domination games (Q2007624) (← links)
- The domination number of the graph defined by two levels of the \(n\)-cube (Q2026316) (← links)
- Aspects of upper defensive alliances (Q2026328) (← links)
- Comparison of sum choice number with chromatic sum (Q2032707) (← links)
- \( \mathbb{Z}_2 \times \mathbb{Z}_2\)-cordial cycle-free hypergraphs (Q2042612) (← links)
- An improved parametric algorithm on two-machine scheduling with given lower and upper bounds for the total processing time (Q2043022) (← links)
- Guillotine cutting is asymptotically optimal for packing consecutive squares (Q2091225) (← links)
- Strong edge coloring of Cayley graphs and some product graphs (Q2115170) (← links)
- On saturation of Berge hypergraphs (Q2122672) (← links)
- Saturation problems with regularity constraints (Q2142663) (← links)
- Singular Turán numbers and worm-colorings (Q2158187) (← links)
- Clique coverings and claw-free graphs (Q2189831) (← links)
- On caterpillar factors in graphs (Q2210502) (← links)
