维普期刊资源整合服务平台（V6.5）

24篇 您的检索式：作者名="Tuza Z"

选中清除导出查看参考文献查看引证文献引用追踪共2页首页上一页第1页下一页末页 /2 跳转

	题名	作者	年代	出处	被引量
1	Uncolorable mixed hypergraphs显示文摘	Tuza Z Voloshin V	2000	Discrete Applied Mathematics2000，99，1：	1
2	The chromatic spectrum of mixed hypergraphs显示文摘	Jiang Tao Mubayi D Tuza Z Vitaly Voloshin Douglas B West	2002	Graphs and Combinatorics2002，18，3：	1
3	Dominating properties and induced subgraphs显示文摘	BacsoG Tuza Z	1983	Discrete Mathematics1983，111，：	1
4	Graph colorings with local constraints-a survey显示文摘	Tuza Z	1997	Discussiones Mathematicae Graph Theorey1997，17，2：	1
5	The chromatic spectrum of mixed hypergraphs显示文摘	Jiang Tao Mubayi D Tuza Z	2002	Graphs and Combinatorics2002，18，3：	1
6	Semi on-line algorithms for the partition problem显示文摘	Kellerer H Kotov H Speranza MR Tuza Z	1997	Operations Research Letters1997，21，：	1
7	A 13/12 approximation algorithm for bin packing with extendable bins显示文摘	Kellerer H Speranza M G Tuza Z	1998	Information Processing Letters1998，65，：	1
8	Graph colorings with local constraints-a survey显示文摘	TUZA Z	1997	Discussiones Mathematicae Graph Theorey1997，17，2：	1
9	Irregular assignments and vertex-distinguishing edge-colorings of graphs显示文摘	AIGNER M TRIESCH E TUZA Z S	1992	Combinatorics1992，90，：	1
10	On the complexity of bicoloring clique hypergraphs of graphs 显示文摘	Kratochvfl J Tuza Z	2002	Journalof Algorithms^2002，45，：	1
11	Clique-transversal sets of line graphs and complements ofline graphs 显示文摘	Andreae T Schughart M Tuza Z	1991	Discrete Mathematics1991，88，：	1
12	Clique-transversal sets and weak 2-colorings in graphs of small maximum,degree 显示文摘	Bacso G Tuza Z	2009	Discrete Mathematics and Theoretical Computer Science2009，11，：	1
13	On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs显示文摘	BAZGAN C SANTHA M TUZA Z	1999	Journal of Algorithms1999，31，1：	1
14	Efficiency and effectiveness of normal schedules on three dedicated processors显示文摘	Speranza M G Tuza Z S	1997	Discrete Mathematics1997，164，：	1
15	Every 2-choosable graph is (2m , m)-choosable显示文摘	Tuza Z Voigt M	1996	J Graph Theory1996，22，：	1
16	On the Approximation of Finding Another Hamiltonian Cycle in Cubic Hamiltonian Graphs显示文摘	Bazgan C Santha M Tuza Z	1999	Journal of Algorithms1999，31，1：	1
17	Covering the cliques of a graph with vertices显示文摘	Erds P Gallai T Tuza Z	1992	Discrete Math1992，108，123：	1
18	Graph colorings with local constraints-a survey显示文摘	Tuza Z	1997	Discussiones Mathematicae Graph Theory1997，17，：	1
19	Covering the cliques of a graph with vertices 显示文摘	Erd6s P Gallai T Tuza Z	1992	Discrete Mathe- matics1992，108，123：	1
20	Covering all cliques of a graph 显示文摘	Tuza Z	1990	Discrete Mathematics1990，86，123：	1

返回顶部每页显示：

共2页首页上一页第1页下一页末页 /2 跳转

互联网出版许可证新出网证(渝)字10号全国400电话 - 免长途话费

用户提示