The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- Asymptotic results on saturated graphs (Q1174171) (← links)
- Perfect graph decompositions (Q1175555) (← links)
- Dominating cliques in \(P_ 5\)-free graphs (Q1176051) (← links)
- Decompositions of regular bipartite graphs (Q1176735) (← links)
- Extensions of Gallai's graph covering theorems for uniform hypergraphs (Q1179466) (← links)
- Dissections into equilateral triangles (Q1179939) (← links)
- Saturated \(r\)-uniform hypergraphs (Q1184855) (← links)
- Narrowness, pathwidth, and their application in natural language processing (Q1186169) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- Perfect couples of graphs (Q1196687) (← links)
- Covering the cliques of a graph with vertices (Q1201260) (← links)
- Asymptotic growth of sparse saturated structures is locally determined (Q1201274) (← links)
- Helly property in finite set systems (Q1208035) (← links)
- Radius, diameter, and minimum degree (Q1262322) (← links)
- Semi on-line algorithms for the partition problem (Q1267197) (← links)
- A comparison of heuristics for scheduling multiprocessor tasks on three dedicated processors: Short communication: Special issue on task sheduling problems on parallel and distributed systems (Q1285548) (← links)
- On-line approximation algorithms for scheduling tasks on identical machines with extendable working time (Q1290163) (← links)
- On light cycles in plane triangulations (Q1292852) (← links)
- Maximum cuts: Improvements and local algorithmic analogues of the Edwards-Erdős inequality (Q1297468) (← links)
- On conjectures of Berge and Chvátal (Q1313827) (← links)
- Large \(s\)-representable set systems with low maximum degree (Q1313861) (← links)
- Eulerian polynomial identities on matrix rings (Q1320251) (← links)
- Largest size and union of Helly families (Q1322238) (← links)
- Monochromatic coverings and tree Ramsey numbers (Q1322294) (← links)
- Algorithmic complexity of list colorings (Q1327214) (← links)
- The spectrum of \(\lambda\)-times repeated blocks for \(\text{TS}(v,\lambda)\) (Q1329349) (← links)
- Inequalities for minimal covering sets in set systems of given rank (Q1329820) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Intersection dimensions of graph classes (Q1334942) (← links)
- Characterization of \((m,1)\)-transitive and \((3,2)\)-transitive semi- complete directed graphs (Q1343273) (← links)
- Small representations of the relation algebra \(\mathcal E_{n+1}(1,2,3)\) (Q1344846) (← links)
- Efficiency and effectiveness of normal schedules on three dedicated processors (Q1356693) (← links)
- Choosability and fractional chromatic numbers (Q1356727) (← links)
- List colorings and reducibility (Q1372746) (← links)
- Upper chromatic number of Steiner triple and quadruple systems (Q1377792) (← links)
- The color cost of a caterpillar (Q1377806) (← links)
- Strict colouring for classes of Steiner triple systems (Q1379842) (← links)
- Marking games and the oriented game chromatic number of partial \(k\)-trees (Q1396657) (← links)
- Linear-time algorithm for the edge-colorability of a graph with prescribed vertex types (Q1411559) (← links)
- Complexity of choosing subsets from color sets (Q1584428) (← links)
- Sharpness of some intersection theorems (Q1587913) (← links)
- Uniquely colorable mixed hypergraphs (Q1598826) (← links)
- The chromatic spectrum of mixed hypergraphs (Q1606033) (← links)
- Efficient approximation algorithms for the subset-sums equality problem. (Q1608313) (← links)
- Reconstruction graphs and testing their properties in a relational spatial database (Q1609074) (← links)
- A note on planar 5-list colouring: Non-extendability at distance 4 (Q1613480) (← links)
- Safe sets in graphs: graph classes and structural parameters (Q1631677) (← links)
- Tight upper bounds for semi-online scheduling on two uniform machines with known optimum (Q1642847) (← links)
- Optimal multi-TDMA scheduling in ring topology networks (Q1666713) (← links)
- Computing all possible graph structures describing linearly conjugate realizations of kinetic systems (Q1682512) (← links)
