<?xml version='1.0' encoding='utf-8'?>
<resource xmlns:xsi='http://www.w3.org/2001/XMLSchema-instance' xmlns='http://datacite.org/schema/kernel-3' xsi:schemaLocation='http://datacite.org/schema/kernel-3 http://schema.datacite.org/meta/kernel-3/metadata.xsd'>
<creators>
<creator>
<creatorName>Bacso, G.</creatorName>
<affiliation>Hungarian Academy of Sciences, Ungaria</affiliation>
</creator>
<creator>
<creatorName>Bacso, G.</creatorName>
<affiliation>Hungarian Academy of Sciences, Ungaria</affiliation>
</creator>
<creator>
<creatorName>Bacso, G.</creatorName>
<affiliation>Institutul de Matematică şi Informatică al AŞM, Moldova, Republica</affiliation>
</creator>
</creators>
<titles>
<title xml:lang='en'>Unique colorings of bi-hypergraphs</title>
</titles>
<publisher>Instrumentul Bibliometric National</publisher>
<publicationYear>2003</publicationYear>
<relatedIdentifier relatedIdentifierType='ISSN' relationType='IsPartOf'>1034-4942</relatedIdentifier>
<subjects>
<subject>Edge-Colored Graph</subject>
<subject>Ramsey number</subject>
<subject>graph</subject>
</subjects>
<dates>
<date dateType='Issued'>2003-03-01</date>
</dates>
<resourceType resourceTypeGeneral='Text'>Journal article</resourceType>
<descriptions>
<description xml:lang='en' descriptionType='Abstract'><p>We discuss the properties of uniform hypergraphs which have precisely one partition (i.e., a unique coloring apart from permutation of the colors) under the condition that in each edge, there exist three vertices which belong to precisely two classes of the partition. In particular, we investigate the relation between unique colorability, number of colors, and the cardinalities of color classes.</p></description>
</descriptions>
<formats>
<format>application/pdf</format>
</formats>
</resource>