The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- Clique-transversal sets of line graphs and complements of line graphs (Q810533) (← links)
- List version of \(L(d,s)\)-labelings (Q817777) (← links)
- Semi on-line scheduling on three processors with known sum of the tasks (Q835557) (← links)
- Characterization of graphs dominated by induced paths (Q868348) (← links)
- Game list colouring of graphs (Q873968) (← links)
- Efficient algorithms for decomposing graphs under degree constraints (Q881575) (← links)
- Largest non-unique subgraphs (Q882786) (← links)
- Generalized line graphs: Cartesian products and complexity of recognition (Q888591) (← links)
- Periodic string division generated by deterministic L systems (Q911317) (← links)
- The maximum number of edges in \(2K_ 2\)-free graphs of bounded degree (Q912124) (← links)
- Self-generating hexagonal cell division patterns (Q912395) (← links)
- Contractions and minimal k-colorability (Q916670) (← links)
- Multipartite Turán problem for connected graphs and hypergraphs (Q919006) (← links)
- Graph coloring in linear time (Q921012) (← links)
- Induced matchings in bipartite graphs (Q921017) (← links)
- Approximation of satisfactory bisection problems (Q931729) (← links)
- Hall number for list colorings of graphs: Extremal results (Q960954) (← links)
- Smallest set-transversals of \(k\)-partitions (Q968226) (← links)
- Color-bounded hypergraphs, IV: Stable colorings of hypertrees (Q968415) (← links)
- Infinite versus finite graph domination (Q968422) (← links)
- Groupies in random graphs (Q976110) (← links)
- Satisfactory graph partition, variants, and generalizations (Q976309) (← links)
- Orderings of uniquely colorable hypergraphs (Q997065) (← links)
- On-line arbitrarily vertex decomposable trees (Q997067) (← links)
- On rainbow connection (Q1010776) (← links)
- Combinatorial 5/6-approximation of Max Cut in graphs of maximum degree 3 (Q1018104) (← links)
- Some complexity problems on single input double output controllers (Q1028446) (← links)
- Color-bounded hypergraphs. I: General results (Q1044919) (← links)
- On list critical graphs (Q1044925) (← links)
- Color-bounded hypergraphs. II: Interval hypergraphs and hypertrees (Q1045172) (← links)
- Upper bound for transversals of tripartite hypergraphs (Q1050364) (← links)
- On color critical graphs (Q1059085) (← links)
- Hypergraphs without a large star (Q1061141) (← links)
- Critical hypergraphs and interesting set-pair systems (Q1071788) (← links)
- Neighborhood perfect graphs (Q1081622) (← links)
- Linear upper bounds for local Ramsey numbers (Q1087887) (← links)
- Inequalities for two set systems with prescribed intersections (Q1090680) (← links)
- On the context-free production complexity of finite languages (Q1098318) (← links)
- Decompositions of partially ordered sets into chains and antichains of given size (Q1115890) (← links)
- A coloring problem related to the Erdős, Faber, Lovasz conjecture (Q1117945) (← links)
- Maximum bipartite subgraphs of Kneser graphs (Q1121290) (← links)
- On the maximum number of qualitative independent partitions (Q1121889) (← links)
- Hypergraph coverings and local colorings (Q1121913) (← links)
- Isomorphism of two infinite-chromatic triangle-free graphs (Q1124601) (← links)
- Hamiltonian properties of Toeplitz graphs (Q1126180) (← links)
- Ensembles d'articulation d'un graphe \(\gamma\)-critique (Q1140657) (← links)
- Worst-case behavior of string-searching algorithms (Q1158765) (← links)
- Induced subtrees in graphs of large chromatic number (Q1159679) (← links)
- Triangle-free partial graphs and edge covering theorems (Q1171575) (← links)
- Covering all cliques of a graph (Q1174130) (← links)
