The following pages link to Zsolt Tuza (Q175498):
Displaying 50 items.
- One More Occurrence of Variables Makes Satisfiability Jump from Trivial to NP-Complete (Q4037693) (← links)
- Generalized colorings and avoidable orientations (Q4209941) (← links)
- Graph colorings with local constraints -- a survey (Q4210665) (← links)
- (Q4219034) (← links)
- Cycle systems without 2-colorings (Q4221912) (← links)
- (Q4227911) (← links)
- (Q4232782) (← links)
- (Q4233832) (← links)
- On the Approximation of Finding A(nother) Hamiltonian Cycle in Cubic Hamiltonian Graphs (Q4240135) (← links)
- (Q4263476) (← links)
- ON <i>k</i>-LOCAL AND <i>k</i>-MEAN COLORINGS OF GRAPHS AND HYPERGRAPHS (Q4277966) (← links)
- (Q4278353) (← links)
- Linear-Time Approximation Algorithms for the Max Cut Problem (Q4290088) (← links)
- Bipartite Subgraphs of Triangle-Free Graphs (Q4296525) (← links)
- Blocking Sets in <i>SQS</i>(2<i>v</i>) (Q4306434) (← links)
- Local and global average degree in graphs and multigraphs (Q4312243) (← links)
- (Q4320452) (← links)
- (Q4323132) (← links)
- (Q4326650) (← links)
- Optimal routings in communication networks with linearly bounded forwarding index (Q4344452) (← links)
- (Q4347897) (← links)
- A weighted generalization of Tur�n's theorem (Q4351314) (← links)
- Zero‐sum block designs and graph labelings (Q4373384) (← links)
- Brooks-type theorems for choosability with separation (Q4376504) (← links)
- Rankings of Graphs (Q4388986) (← links)
- (Q4390702) (← links)
- (Q4400814) (← links)
- (Q4405635) (← links)
- (Q4414507) (← links)
- (Q4448764) (← links)
- Schttes Tournament Problem and Intersecting Families of Sets (Q4462634) (← links)
- (Q4489145) (← links)
- Remarks on the existence of uniquely partitionable planar graphs (Q4498982) (← links)
- (Q4518396) (← links)
- (Q4532751) (← links)
- Partition-Crossing Hypergraphs (Q4584655) (← links)
- Improved bounds for batch scheduling with nonidentical job sizes (Q4632843) (← links)
- (Q4634386) (← links)
- Local Anti-Ramsey Numbers of Graphs (Q4655896) (← links)
- Graphs without induced P<sub>5</sub>and C<sub>5</sub> (Q4668435) (← links)
- (Q4693370) (← links)
- The Number of Maximal Independent Sets in Triangle-Free Graphs (Q4695389) (← links)
- The acyclic orientation game on random graphs (Q4697816) (← links)
- How to make a random graph irregular (Q4697822) (← links)
- Rankings of Directed Graphs (Q4699165) (← links)
- (Q4711897) (← links)
- (Q4713034) (← links)
- Domination in partitioned graphs (Q4786799) (← links)
- On the complexity of bicoloring clique hypergraphs of graphs (Q4806592) (← links)
- Perfect Triangle Families (Q4835697) (← links)