Orderings of uniquely colorable hypergraphs

Csilla Bujtás, Z. Tuza

Research output: Contribution to journalArticle

2 Citations (Scopus)

Abstract

For a mixed hypergraph H = (X, C, D), where C and D are set systems over the vertex set X, a coloring is a partition of X into 'color classes' such that every C ∈ C meets some class in more than one vertex, and every D ∈ D has a nonempty intersection with at least two classes. A vertex-orderx1, x2, ..., xn on X (n =

Original languageEnglish
Pages (from-to)1395-1407
Number of pages13
JournalDiscrete Applied Mathematics
Volume155
Issue number11
DOIs
Publication statusPublished - Jun 1 2007

Fingerprint

Coloring
Hypergraph
Color
Mixed Hypergraphs
Vertex of a graph
Set Systems
Colouring
Intersection
Partition
Class

Keywords

  • Algorithmic complexity
  • Mixed hypergraph
  • Uniquely colourable
  • Vertex-order

ASJC Scopus subject areas

  • Computational Theory and Mathematics
  • Applied Mathematics
  • Discrete Mathematics and Combinatorics
  • Theoretical Computer Science

Cite this

Orderings of uniquely colorable hypergraphs. / Bujtás, Csilla; Tuza, Z.

In: Discrete Applied Mathematics, Vol. 155, No. 11, 01.06.2007, p. 1395-1407.

Research output: Contribution to journalArticle

Bujtás, Csilla ; Tuza, Z. / Orderings of uniquely colorable hypergraphs. In: Discrete Applied Mathematics. 2007 ; Vol. 155, No. 11. pp. 1395-1407.
@article{99551ae92ea443a0b5c0227b9adcacb8,
title = "Orderings of uniquely colorable hypergraphs",
abstract = "For a mixed hypergraph H = (X, C, D), where C and D are set systems over the vertex set X, a coloring is a partition of X into 'color classes' such that every C ∈ C meets some class in more than one vertex, and every D ∈ D has a nonempty intersection with at least two classes. A vertex-orderx1, x2, ..., xn on X (n =",
keywords = "Algorithmic complexity, Mixed hypergraph, Uniquely colourable, Vertex-order",
author = "Csilla Bujt{\'a}s and Z. Tuza",
year = "2007",
month = "6",
day = "1",
doi = "10.1016/j.dam.2007.02.008",
language = "English",
volume = "155",
pages = "1395--1407",
journal = "Discrete Applied Mathematics",
issn = "0166-218X",
publisher = "Elsevier",
number = "11",

}

TY - JOUR

T1 - Orderings of uniquely colorable hypergraphs

AU - Bujtás, Csilla

AU - Tuza, Z.

PY - 2007/6/1

Y1 - 2007/6/1

N2 - For a mixed hypergraph H = (X, C, D), where C and D are set systems over the vertex set X, a coloring is a partition of X into 'color classes' such that every C ∈ C meets some class in more than one vertex, and every D ∈ D has a nonempty intersection with at least two classes. A vertex-orderx1, x2, ..., xn on X (n =

AB - For a mixed hypergraph H = (X, C, D), where C and D are set systems over the vertex set X, a coloring is a partition of X into 'color classes' such that every C ∈ C meets some class in more than one vertex, and every D ∈ D has a nonempty intersection with at least two classes. A vertex-orderx1, x2, ..., xn on X (n =

KW - Algorithmic complexity

KW - Mixed hypergraph

KW - Uniquely colourable

KW - Vertex-order

UR - http://www.scopus.com/inward/record.url?scp=34250319318&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=34250319318&partnerID=8YFLogxK

U2 - 10.1016/j.dam.2007.02.008

DO - 10.1016/j.dam.2007.02.008

M3 - Article

AN - SCOPUS:34250319318

VL - 155

SP - 1395

EP - 1407

JO - Discrete Applied Mathematics

JF - Discrete Applied Mathematics

SN - 0166-218X

IS - 11

ER -