Bujtás, Csilla and Tuza, Zsolt. Color-bounded hypergraphs. I. General results.
Discrete Math. 309 (2009), no. 15, 4890--4902.
L. Milazzo, Zs. Tuza. Logarithmic upper bound for the upper chromatic number of $S(t,t+1,v)$ systems.
Ars Combin. 92 (2009), 213--223.
2008
G. Bacsó, Zs. Tuza. Upper chromatic number of finite projective planes.
J. Combin. Des. 16 (2008), no. 3, 221--230.
Cs. Bujtas. Algorithms and structure: set partitions under local constraints. PhD Thesis. University of Pannonia,
Veszprem, Hungary, 2008.
V. Voloshin. Coloring theory: history, results and open problems. Combinatorics 2008, Costermano,
(VR), Italy, 22-28 June, 2008, pp. 173 - 177.
Zs. Tuza, V. Voloshin. Problems and results on colorings of mixed hypergraphs.
Horizons of Combinatorics. (E. Gyori et al, eds.) Bolyai Society Mathematical Studies 17,
Springer-Verlag, 2008, 235 - 255.
G. Bacso, Cs. Bujtas, Zs. Tuza, V. Voloshin. New challenges in the theory of hypergraph coloring.
Proc. Int. Conf. ICDM 2008, pp. 67--78.
Cs. Bujtas, Zs. Tuza. Uniform Mixed Hypergraphs: The Possible Numbers of Colors.
Graphs and Combinatorics, Volume 24 , Issue 1 (February 2008), Pages 1-12.
2007
L. Milazzo, Zs. Tuza. A class of Steiner Systems S(2,4,v) with arcs of extremal size.
Tatra Mountains Mathematical Publications 36 (2007), 153--162.
M. Gionfriddo, A. Amato. Colourings of Voloshin for $S\sb 2(2,3,v)$.
Util. Math. 74 (2007), 19--32.
A.D. Forbes, M.J. Grannell, T.S. Griggs.
New type B colorable $S(2,4,v)$ designs.
J. Combin. Des. 15 (2007), no. 4, 357--368.
Gabor Bacso, Zsolt Tuza. Upper chromatic number of finite projective planes.
Journal of Combinatorial Designs, Published Online: 4 Sep 2007.
Ping Zhao, Kefeng Diao. On the Upper Chromatic Numbers of Mixed Interval Hypertrees.
Lecture Notes in Computer Science, Springer Berlin / Heidelberg
ISSN 0302-9743 (Print) 1611-3349 (Online), Volume 4381 (2007) 272-277.
DIAO Ke-feng and ZHAO Ping. On the coloring of C-hypergraphs
with minimum connected pair graphs. Chinese Journal
of Organic Chemistry 2007- 42- 2:56-58.
P. Johnson, V. Voloshin. Geombinatorial Mixed Hypergraph Coloring
Problems. Geombinatorics, Vol XVII (2), 2007, 57-67.
Cs. Bujtas, Zs. Tuza. Color-bounded hypergraphs III: Model comparison.
Applicable Analysis and Discrete Mathematics 1 (2007), 36-55.
D. Kral. Mixed Hypergraphas and other coloring problems. Discrete Mathematics 307 (7-8) (2007), 923-938.
2006
J. Yu, K. Diao, G. Liu. The Minimum Edge Number of a 4-Uniform Co-Hypergraph. OPERATIONS RESEARCH TRANSACTIONS, 2006, Vol. 10, No. 1, p. 95-98 (in Chinese).
K. Diao, G. Liu, D. Rautenbach, P. Zhao. A note on the least number of edges of 3-uniform hypergraphs with upper chromatic number 2.
Discrete Math. 306 (2006), no. 7, 670--672.
Cs. Bujtas, Zs. Tuza. Mixed colorings of hypergraphs. Electronic Notes in Discrete Mathematics, 24 (2006), 273-275.
D. Kral, J. Kratochvil, A. Proskurowski, H.-J. Voss. Coloring mixed hypertrees. Discrete Applied Mathematics 154(4): 660-672 (2006).
V.Voloshin. Coloring Mixed Hypergraphs: from Combinatorics to Philosophy.
In: LE MATEMATICHE Vol. LIX (2004)-Fasc. I-II, pp. 393-402.
Palermo, 2006.
Amato, Alberto(I-CATN-MI), Colourings of Voloshin for $ATS(v)$. (English summary) Matematiche (Catania) 57 (2002), no. 2, 275--286 (2005).
G. Lo Faro, A. Tripodi. Strict colourings of STS(3v)s and uncolourable BSTS(3v)s, Discrete Math. 1 (301) (2005) 117-123.
K. Roblee, V. Voloshin. About the upper chromatic number of mixed hypertree.
Computer Science Journal of Moldova, Vol.13, No.2 (38), 2005, pp.131-135.
K. F. Diao, G. Liu. The Coloring Theory of Mixed Hypergraphs. ADVANCES IN MATHEMATICS
2005, Vol. 34, No. 2, P. 145-154.
V. Voloshin. Coloring Block Designs as Mixed Hypergraphs: survey. Abstracts of papers presented to the American
Mathematical Society. Volume 26, Number 1, Issues 139, 2005, p.15, abstract 1003-05-129, Atlanta, Georgia, January
5-8, 2005.
2004
K. Diao, J. Yu. A sufficient condition for a C-perfect C-hypergraph.
JOURNAL OF SHANDONG UNIVERSITY (NATURAL SCIENCE), 2004, Vol. 39 No. 3 P. 6-9.
K. Diao, G. Liu. Bounds on minimum C-edge number of 4-uniform C-hypergraphs.
MATHEMATICA APPLICATA, Vol. 17, No. 4, 2004, p. 1-6.
L. Gionfriddo. Construction of ${\rm BP}\sb 3$-designs with mononumerical spectrum. Util. Math. 65 (2004), 201--218.
D. Kral. On feasible sets of mixed hypergraphs. Electron. J. Combin. 11 (2004), Research Paper 19, 14 pp.
D. Kral, J. Kratochvil, H.-J. Voss. Mixed hypercacti. Discrete Math. 286 (2004), no. 1-2, 99--113.
P. Adams, D. Bryant, J. Lefevre, M. Waterhouse.
Some equitably 3-colourable cycle decompositions.
Discrete Math. 284 (2004), no. 1-3, 21--35
A. Rosa. Blocking sets and colourings in Steiner Systems S(2,4,v). Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.
A. Amato, M. Gionfriddo. Bicolourings for S2(2,3,v). Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.
H. Gropp. Colourings of configurations as mixed hypergraphs.
Abstracts of the 12th Italian Conference "Combinatorics 2004", Acireale, Capomulini, September 13-18, 2004.
M. Gionfriddo, G. Quattrocchi.
Colouring 4-cycle systems with equitably coloured blocks, Discrete Mathematics,
284 (2004) 137-148.
D. Kral. On maximum face-constrained coloring of plane graphs with no short face cycles. Discrete Math. 277 (2004), no. 1-3, 301--307.
M. Gionfriddo, L. Milazzo, A. Rosa, V. Voloshin. Bicoloring Steiner systems S(2,4,v).
Discrete Mathematics, 283 (2004) 249-253.
G. Lo Faro, A. Tripodi. Triplication for BSTSs and uncolourability.
Discrete Mathematics, 284 (2004) 197-203.
J. Gross, J Yellen (Eds). Handbook of Graph Theory. CRC, 2004 (in section "Hypergraph Coloring").
L. Gionfriddo. Voloshin's colourings of P3-designs. Discrete Mathematics,
Volume 275, Issues 1-3 , 28 January 2004, Pages 137-149.
Zhao, P., Diao, K. F. A problem on minimum number of edges and colorings for $\scr C$-hypergraphs. (Chinese) Qufu Shifan Daxue Xuebao Ziran Kexue Ban 30 (2004), no. 2, 33--36.
2003
P. Danziger, E. Mendelsohn. Bicolour graphs of Steiner triple systems. Discrete Math. 261 (2003), no. 1-3, 157--176.
M. Gionfriddo. Colourings of hypergraphs and mixed hypergraphs.
Rendiconti
del Seminario Matematico di Messina. Serie II, Tomo XXV, Volume n.9 (2003), pages 87-98.
Proceedings of the International Symposium on Graphs, Designs and Applications. Villa Pace, Messina, 30 September - 4 October, 2003.
V. Voloshin. Coloring Mixed Hypegraphs: some results and open problems. Rendiconti
del Seminario Matematico di Messina. Serie II, Tomo XXV, Volume n.9 (2003), pages 237-244.
Proceedings of the International Symposium on Graphs, Designs and Applications. Villa Pace, Messina, 30 September - 4 October, 2003.
C.J. Colbourn, A. Rosa. Specialized Block-Colourings of Steiner Triple Systems and the Upper Chromatic Index. Graphs and Combinatorics, Volume 19, Number 3,
Pages 335 - 345.
M. Greig, A. Rosa. Maximal arcs in Steiner systems S(2,4,v). Discrete Mathematics,
267 (2003) 143 - 151.
Zs. Tuza, V. Voloshin. Linear-time algorithm for the edge-colorability.
Comput. Sci. J. Moldova, V.11, N.1(31), 2003, pp. 35-42.
D. Kral', J. Kratochvil, H.-J. Voss. Mixed hypergraphs with bounded degree: edge-coloring of mixed multigraphs. Theoretical Computer Science,
Volume 295, Issues 1-3 , 24 February 2003, Pages 263-278.
L. Milazzo, Zs. Tuza, V. Voloshin. Strict colorings of Steiner triple and quadruple systems: a survey. Discrete Mathematics, 261 (2003), 399-411.
G. Bacso, Zs. Tuza, V. Voloshin. Unique colorings of bi-hypergraphs, Australas. J. Combin. 27 (2003) 33-45.
D. Kral'. A counter-example to Voloshin's hypergraph co-perfectness conjecture. Australas. J. Combin. 27, (2003), p.25.
L. Gionfriddo. Nesting of G-designs. Ph.D. Thesis, University of Catania, 2003 (in Italian).
Diao, K. F., Liu, G. Z., Zhao P. Totally irregular embedding of co-hypergraphs. (Chinese) Gongcheng Shuxue Xuebao 20 (2003), no. 3, 111--116.
Z. Dvorak, J. Kara, D. Kral, O. Pangrac. Complexity of Pattern Coloring
of Cycle Systems. In: L. Kucera (Ed.): WG 2002, LNCS 2573, pp. 164–175, 2002.
Springer-Verlag Berlin Heidelberg 2002
L. Gionfriddo. P(3)-designs with gaps in the chromatic spectrum.
Rendiconti Seminario Matematico Universita Messina 8 (2002), 49-58.
A. Kundgen, R. Ramamurthi.
Coloring face-hypergraphs of graphs on surfaces.
J. Combin. Theory Ser. B 85 (2002), no. 2, 307--337.
A. Tripodi. A survey on strict colourings for a class of STS(3v)s.
Rendiconti Seminario Matematico Universita Messina 8 (2002), 207-214.
V.I.Voloshin. Problem # 10976. The American Mathematical Monthly, Vol. 109, No. 9,
2002.
L. Gionfriddo, V. Voloshin. The smallest bihypergraph with a gap in the chromatic spectrum has 7 vertices and 9 edges. Bulletin of the ICA, Volume 36 (2002), 73-79.
C. Arbib, M. Flammini. On the upper chromatic number of (v3,b2)-configurations.
Discrete Applied Mathematics, 120 (2002) 3-12.
A. Tripodi. Due problematiche classiche nella teoria degli ipergrafi
e dei disegni: colorazioni e "intersection problem".
Ph.D. Thesis, University of Messina, 2002 (in Italian).
Zs. Tuza, V. Voloshin, H. Zhou Uniquely colorable mixed hypegraphs.
Discrete Mathematics, 248 (2002) 221-236.
V.I. Voloshin, H.-J. Voss.
Circular Mixed Hypergraphs II: The Upper Chromatic Number.
Preprint TU Dresden, MATH-AL-2-2002, 1-26.
Abstract on www.math.tu-dresden.de
M. Gionfriddo, L. Milazzo, V. Voloshin. On the upper chromatic index of a multigraph. Comput. Sci. J. Moldova, V.10, N.1(28), 2002, pp.81-91.
D. Lozovanu, V. Voloshin, A. Zelikovsky. A note on the colorability of a mixed hypergraph using k colors. Comput. Sci. J. Moldova, , V.10, N.1(28), 2002, pp.92-95.
Diao, Ke Feng; Zheng, Qing Yu.
The upper chromatic number of the Cartesian product of co-hypergraphs. (Chinese. English, Chinese summary)
Math. Appl. (Wuhan) 15 (2002), suppl., 5--8.
2001
A. Niculitsa, V.Voloshin, H.-J. Voss.
Circular and uniquely colorable mixed hypergraphs.
Electronic Notes in Discrete Mathematics
Volume 8, May 2001, Pages 115-118.
J. Kratochvil. Gap-freeness of feasible sets of mixed hypergraphs.
In J. Kara, D. Kral (Eds.), Graph Theory Day IV. KAM-DIMATIA series 2001-522, Prague, 2001, p. 11.
G. Quattrocchi. Colouring 4-cycle Systems with Specified Block Colour
Patterns: the Case of Embedding P3-designs.
Electron. J. Combin. 8(1) (2001) R24.
L. Gionfriddo. Extremal gaps in BP_3 designs. Comput. Sci. J. Moldova 9 (3)
(2001), 305--320.
Kral D.: On Complexity of Colouring Mixed Hypertrees, Proceedings 13th International Symposium, Fundamentals of Computation Theory, 1st Workshop on Efficient Algorithms, Lecture Notes in Computer Science vol. 2138, p. 516-524, Springer-Verlag, 2001
Kral D., Kratochvil J., Voss H.-J.: Complexity Note on Mixed Hypergraphs, Proceedings 26th International Symposium, Mathematical Foundations of Computer Science 2001, Lecture Notes in Computer Science vol. 2136, p. 474-486, Springer-Verlag, 2001.
Kral D., Kratochvil J., Voss H.-J.: Complexity Note on Mixed Hypergraphs, preprint, MATH-AL 6-2001, TU Dresden.
D. Kral, J. Kratochvil, H.-J. Voss: Mixed Hypergraphs with Bounded Degree: Edge--Coloring of Mixed Multigraphs, to appear in the special volume of Theoretical Computer Science from MFCS 2001.
M. Buratti, M. Gionfriddo, L. Milazzo, V. Voloshin.
Lower and upper chromatic numbers for BSTSs(2^h - 1).
Comput. Sci. J. Moldova, Vol. 9, No 2, (2001), 259-272.
V.I. Voloshin. Coloring Mixed Hypergraphs: theory,
algorithms and applications. In: Mathematical Society of the
Republic of Moldova - UNESCO. First Conference of the Mathematical
Society of the Republic of Moldova. Abstracts. Chisinau (2001), p.155.
V. Prisacaru. The coloring properties of conformal acyclic mixed hypergraphs.
In: Mathematical Society of the Republic of Moldova - UNESCO.
First Conference of the Mathematical Society of the Republic of
Moldova. Abstracts. Chisinau (2001), p. 123-124.
V.I. Voloshin. Greedy algorithms for the lower and
upper chromatic numbers, in: Combinatorics, Computability and
Logic, (C.S. Calude, M.J. Dinneen, S. Sburlan, eds.),
Proceedings of DMTCS'01, Springer-Verlag, London (2001),
241-251.
D. Kobler, A. Kundgen. Gaps in the
chromatic spectrum of face-constrained plane graphs. Electron.
J. Combin. 8 (1) (2001) N3.
G. Lo Faro, L. Milazzo, A. Tripodi.
On the Upper and Lower Chromatic Numbers of BSQSs(16).
Electron. J. Combin. 8(1) (2001) R6.
G. Lo Faro, L. Milazzo, A. Tripodi.
The first BSTS with different upper and lower chromatic
numbers. Australas. J. Combin. 22 (2000), 123--133.
E.M. Li Marzi. Strict colorings for classes of 4-cycle
systems. III International Conference in "Stochastic
Geometry, Convex Bodies and Empirical Measures", Part I (Mazara
del Vallo, 1999). Rend. Circ. Mat. Palermo (2) Suppl. No. 65,
part I (2000), 201--218 (in Italian) .
K. Diao, P. Zhao, H. Zhou.
About the upper chromatic number of a co-hypergraph.
Discrete Math. 220 (1-3) (2000), 67--73.
A. Niculitsa, H.-J. Voss. A characterization of
uniquely colorable mixed hypergraphs of order n with upper
chromatic numbers n-1 and n-2. Australas. J. Combin.
21 (2000), 167--177.
E.M. Li Marzi, M.C. Marino. On planar mixed hypergraphs.
Comput. Sci. J. Moldova 8 (3)
(2000), 247--259.
A. Niculitsa. Structure of some classes of
uc mixed hypergraphs.
Ph.D. Thesis, Moldova State University, Chisinau (2000)
(in Romanian).
V. Prisakaru. Methods of investigation of
chromatic properties of hypergraphs.
Ph.D. Thesis, Moldova State University, Chisinau (2000)
(in Romanian).
A. Kundgen, E. Mendelsohn, V. Voloshin.
Colouring of planar mixed hypergraphs. Electron.
J. Combin. 7 (2000), R60.
Kral D., Kratochvil J., Proskurowski A., Voss H.-J.: Coloring mixed hypertrees, Proceedings 26th Workshop on Graph-Theoretic Concepts in Computer Science, Lecture Notes in Computer Science vol. 1928, p. 279-289, Springer-Verlag, 2000.
Kral D., Kratochvil J., Proskurowski A., Voss H.-J.: Coloring mixed hypertrees, preprint, MATH-AL 8-2000, TU Dresden.
A. Niculita. Caracterizarea structurii
unor clase de hipergrafe mixte unic colorabile. Institutul de
cercetari stiintifice in domeniul informatiei
tehnico-stiintifice; Certificat de depunere a
manuscrisului Nr. 1773-M2000, 10 p.
A. Niculitsa. Some clases of mixed hypergraphs uniquely
colorable with two colors. Scientific Annals, Faculty of
Mathematics and Informatics, State University of Moldova, 2000,
Vol.II, Nr. 1, p. 3-9.
A. Niculitsa and V. Voloshin. About uniquely
colorable mixed hypertrees. Discussione Mathematicae: Graph
Theory. Vol. 20, No. 1, 2000, pp. 81-91.
D. Lozovanu, V. Voloshin. Integer programming models for colorings of mixed
hypergraphs. Computer Science Journal of Moldova, Vol.8, No
1 (22), 2000, p. 64--74.
V. Prisacaru. About the mixed hypergraph
coloring.
Preceedings of the Tiberiu Popoviciu Itinerant Seminar of
Functional Equations, Approximation and Convexity, pp. 193-196,
Editura SRIMA, Cluj-Napoca, 2000.
V. Prisacaru. The upper cromatic number of a
co-hypergraph. Conferinta corpului didactico- -stiintific a USM
pe anii 1998-99, pp.75-76, Chishinau, 2000.
V.I. Voloshin, H.-J. Voss.
Circular Mixed hypergraphs I: colorability and unique
colorability. Proceedings of the
Thirty-first Southeastern International Conference on
Combinatorics, Graph Theory and Computing (Boca Raton, FL,
2000). Congr. Numer. 144 (2000), 207--219.
V. Voloshin, H.-J. Voss.
Circular Mixed hypergraphs I : colorability and unique
colorability. Preprint Inst. of Algebra MATH-AL-3-2000,
Technische Universitat Dresden, 2000.
V. Voloshin and H.-J. Voss The upper chromatic number of circular mixed
hypergraphs. KAM Series, Discrete Mathematics-Combinatorics,
Operations Research-Optimization
(Seventh Prague Combinatorial Workshop) 495 (2000), 26 - 28.
T. Jiang. Structural and extremal problems in graph theory. Ph.D. Thesis.
University of Illinois, Urbana, 2000.
Diao, Ke Feng; Zhang, Chun Guo; Zheng, Qing Yu. The upper
chromatic numbers of a class of Steiner triple systems. (Chinese)
Qufu Shifan Daxue Xuebao Ziran Kexue Ban 26 (2000), no. 1, 21--23.
1999
C.Arbib. A primal-dual property of the upper chromatic number of mixed hypergraphs.
Electronic Notes in Discrete Mathematics, Volume 3 (1999).
J. Kratochvil, Zs. Tuza, M. Voigt. New trends
in the theory of graph coloring: choosability and list coloring.
DIMACS Series to Discrete Mathematics and Theoretical Computer
Science. Volume 49, 1999, p.183-197, (sect. 8.4. Mixed
hypergraphs: list colorings without lists).
Ch. Colbourn, J. Dinitz and A. Rosa.
Bicoloring Steiner Triple Systems. Electron. J. Combin. 6 (1999), R25.
Ch.J. Colbourn, A. Rosa. Triple Systems.
Clarendon Press, Oxford, 1999 (section 18.6. Strict colorings and
the upper chromatic number, p. 340-341).
M.C. Marino. Colorings of maximal planar
bi-hypergraphs. Rendiconti del Seminario Matematico di Messina,
Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on
Combinatorics, Messina 8-10 November, 1999, p. 91-106.
L. Milazzo. Colorazioni strette per sistemi di Steiner
di tipo STS e SQS. Rendiconti del Seminario Matematico di
Messina, Serie II - Tomo XX, supplementato al n.5, Atti del 5th
Workshop on Combinatorics, Messina 8-10 November, 1999, p.
107-118.
V. Prisakaru. The upper chromatic number of a
co-hypergraph. Rendiconti del Seminario Matematico di Messina,
Serie II - Tomo XX, supplementato al n.5, Atti del 5th Workshop on
Combinatorics, Messina 8-10 November, 1999, p. 129-148.
R. Scapellato, V. Voloshin.
Some results on coloring of mixed hypergraphs. Rendiconti del
Seminario Matematico di Messina, Serie II - Tomo XX, supplementato
al n.5, Atti del 5th Workshop on Combinatorics, Messina 8-10
November, 1999, p. 149- 166.
A. Tripodi. New results about strict colorings for small BSTSs and
BSQSs. Rendiconti del Seminario Matematico di Messina, Serie II
- Tomo XX, supplementato al n.5, Atti del 5th Workshop on
Combinatorics, Messina 8-10 November, 1999, p. 181-190.
V. Voloshin and H. Zhou. Pseudo-chordal mixed
hypergraphs. Discrete Math., 202 (1999) 239-248.
V. Voloshin. Upper chromatic number and
C-perfect mixed hypergraphs. Paul Erdos and his
Mathematics. Research Communications of the conference held in the
memory of Paul Erdos, Budapest, Hungary, July 4-11, 1999,
p. 267-269.
A. Niculitsa and V. Voloshin. About uniquely
colorable mixed hypertrees. Preprint MATH-AL-7-1999, Technische
Universitat Dresden, 1999.
A. Niculitsa, V. Voloshin, H.-J. Voss.
Uniquely colorable and circular mixed hypergraphs. 6th
Twente Workshop on Graphs and Combinatorial Optimization, 26-28
May, 1999, H.J. Broersma, U.Faigle and J.L. Hurink (eds.).
University of Twente, May, 1999, 173-176. Electronic Notes in
Discrete Mathematics, Vol. 8 (2001).
A. Niculitsa, V. Voloshin, H.-J.Voss.
Circular and uniquely colorable mixed hypergarphs. Scientific
Annals, Faculty of Mathematics and Informatics, State University
of Moldova, 1999, p. 131-136.
A. Niculitsa, H.-J. Voss. About uniquely
colorable mixed hypergraphs. Congressus Numerantium 136 (1999),
p. 33 - 42.
T. Jiang, D. Mubayi, Zs. Tuza, V. Voloshin and D.B. West,
Chromatic spectrum is broken. 6th Twente Workshop on
Graphs and Combinatorial Optimization, 26-28 May, 1999, H.J.
Broersma, U.Faigle and J.L. Hurink (eds.). University of Twente,
May, 1999, 231--234. Electronic Notes in Discrete Mathematics,
Vol. 3 (1999).
1998
L. Milazzo, Zs. Tuza. Strict Colourings for Classes of
Steiner Triple Systems. Discrete Math., 182 (1998) 233-243.
A. Naso. Grafi - ipergrafi - sistemi di m-cicli e
colorazioni. Tesi di Laurea (M.S. Thesis). University of Messina,
1998.
A. Niculita. Caracterizarea structurii unor clase de
hipergrafe mixte. Conferinta corpului
didactico-stiintific "Bilantul activitatii
stiintifice a USM pe anii 1996-1997", 30 sept.- 5 oct.
1998, Rezumatele comunicarilor, Stiinte naturale,
Chisinau USM, 1998, p. 53.
S. Lizzio. Greedy algorithm for the upper chromatic
number. Tesi di Laurea (M.S. Thesis). Catania University, 1998.
V. Prisakaru. About the coloring of an arbitrary
co-hypergraph. Conferinta corpului didactico-stiintific a USM pe
anii 1996-97, p.46, Chishinau, 1998.
V. Voloshin. Colorings of Mixed Hypergraphs. Abstract 60.
Twenty-Ninth Southeastern International Conference on
Combinatorics, Graph Theory and Computing. March 9-13, 1998.
Program and Abstracts.
E. Flocos. Elaboration of methods and
algorithms for coloring of
some special classes of mixed hypergraphs. Ph.D. Thesis,
Moldova State University (1998) (in Romanian).
1997
V. Prisakaru. The upper chromatic number of quasi-interval
co-hypergraphs, Le Mathematiche, Vol. LII (1997) - Fasc.II,
pp. 237-260.
V. Prisakaru. Coloring quasi-interval
co-hypergraphs. Anale stiintifice ale USM, Stiinte reale.
Chisinau, 1997, p. 52-58.
V. Prisakaru. The upper chromatic number and the
chromatic classes of a hypergraph. Abstract at the confernce
''Optimal Discrete Structures and Algorithms. (ODSA-97), Rostock,
1997.
Zs. Tuza, V. Voloshin. Uncolorable Mixed
Hypergraphs. 5th Twente Workshop on Graphs and Combinatorial
Optimization, 18-20 May, 1997, U.Faigle and C.Hoede (eds.).
University of Twente, May, 1997, 231-234.
E. Flocos. Proprietati cromatice ale
co-monostelelor. Buletinul Academiei de Stiinte a RM,
Matematica. Chisinau, 1997, No 3, p.8-19.
E. Flocos. The upper chromatic number of simple
co-monostars. Anale stiintifice ale USM, Stiinte reale.
Chisinau, 1997, p.22-27.
L. Milazzo, Zs. Tuza, Upper Chromatic Number of Steiner
Triple and Quadruple Systems. Discrete Math., 174 (1997),
247-259.
V. Miagkov. The r-uniform chordal conformal
co-perfect hypergraphs.
M.S. Thesis, Moldova State University (1997),
(in Russian).
I. Murovannaia. About some properties of mixed hypergraph coloring.
M.S. Thesis,
Moldova State University, (1997) (in Russian).
1996
L. Milazzo.
Sul numero cromatico superiore nei sistemi di Steiner., Ph.D.
Thesis, University of Catania, (1996).
V. Prisakaru. The coloring algorithm for
quasi-interval co-hypergraphs. Conferinta stiintifica jubiliara
2-3 octombrie 1996, p.12-14, Chisinau, 1996.
V. Prisakaru. Upper chromatic number of a
quasi-interval co-hypergraph. Seminarul itinerant ''Tiberiu
Popoviciu'', p.143-145, Cluj-Napoca, 1996.
V. Voloshin. Three questions to biologists. International
Colloquium on Combinatorics and Graph Theory. July 15-20, 1996.
Abstracts. Balatonlelle, Hungary, p.39.
V. Voloshin. About colorings, greedy strategy and maximal life
time. l Seminarul itinerant "Tiberiu Popoviciu" de ecuatii
functionale, aproximare si convexitate. Cluj-Napoca, 21-25 Mai,
1996, p.161-164.
E. Flocos. Proprietati ale co-monostelelor.
Abstract, International Conference on mathematics and
Informatics. Chisinau, 1996, September 19-21, p.70-71.
M.F. Mammana. On the upper edge-colorings for Steiner
Systems. Journal of Combinatorics, Information and System
Sciences. Vol.21, No.1, 81-86 (1996).
M.C. Marino. Free Colorings of Distance s of a
co-hypergraph. Journal of Combinatorics, Information and System
Sciences. Vol.21,No.1,61-69 (1996).
D. Malai. Coloring of co-hypertrees. M.S. Thesis. Moldova State University, 1996.
V. Suman. Upper chromatic number of a co-hypergraph. M.S. Thesis. Moldova State University, 1996.
1995
V. Prisakaru. The coloring algorithm for the clique
co-hypergraph of an interval graph. Seminarul itinerant ''Tiberiu
Popoviciu'', Cluj-Napoca, 1995.
V. Voloshin. Hypergraph Drawing and Optimization
System. Atti Academia Peloritana dei Pericolanti Classe I di
Scienze Fis. Mat. e Nat., Vol.LXXIII (1995), p.1-3.
V.I. Voloshin. The bases of New Coloring Theory. 5eme
Colloque International Graphes et Combinatoire, Marseille, Luminy,
3-8 September, 1995, p. 86.
V.I. Voloshin. New Approach in Coloring Theory. 4th Twente
Workshop on Graphs and Combinatorial Optimization, 7-9 June, 1995,
U.Faigle and C.Hoede (eds.). University of Twente, May, 1995,
231-234.
V.I. Voloshin. Numarul chromatic superior al hipergrafurilor
intervale mixte. Materialele conferintei corpului
didactico-stiintific - bilantul activitatii stiintifice a U.S.M.
pe anii 1993-1994, 20-27 martie 1995, Stiintele naturale. Chisinau
- USM - 1995, p. 56.
E. Flocos. Unele proprietati ale hipergrafelor
intervale mixte. Bilantul activitatii stiintifice a USM pe anii
1993-1994. Chisinau, USM, 1995, p.56.
L. Milazzo. On upper chromatic number
for SQS(10) and SQS(16). Le Matematiche, Vol. L (1995) - Fasc.
I, pp. 179-193, Catania.
1994
V.I. Voloshin. On the upper chromatic number of a
hypergraph. Conference on Discrete and Computational Geometry,
Mathematical Institute of the Hungarian Academy of Sciences,
Budapest, May 30- June 3, 1994, p.19-20.
V.I. Voloshin. On the upper chromatic number of a hypergraph
and related problems. An International Conference on Incidence
Geometries and Combinatorial Structures COMBINATORICS'94, Roma,
Montesilvano (PE), 10-16 September, 1994, p.91.
V.I. Voloshin. A maximal lifetime of systems and co-perfect
hypergraphs. Advances in Modelling and Analysis, A, AMSE Press,
Vol.20, No 4, 1994, p.1-18.
E. Bulgaru. Mixed interval hypergraphs.
M.S. Thesis, Moldova State University, Kishinev, 1994.
1993
V.I. Voloshin. The mixed hypergraphs. Computer Science
Journal of Moldova, Vol.1, No 1(1), 45-52, 1993.
1992
V.I. Voloshin. On the upper chromatic number of a
hypergraph. Scientific research conference of Moldova State
University. Theses of Reports, Kishinev, 1992, V.1, p.42.
V.I. Voloshin. On the upper
chromatic number of a hypergraph. Preprint of Moldova State University
(1992).