### 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-orderx_{1}, x_{2}, ..., x_{n} on X (n =

Original language | English |
---|---|

Pages (from-to) | 1395-1407 |

Number of pages | 13 |

Journal | Discrete Applied Mathematics |

Volume | 155 |

Issue number | 11 |

DOIs | |

Publication status | Published - Jun 1 2007 |

### Fingerprint

### 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

*Discrete Applied Mathematics*,

*155*(11), 1395-1407. https://doi.org/10.1016/j.dam.2007.02.008

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

Research output: Contribution to journal › Article

*Discrete Applied Mathematics*, vol. 155, no. 11, pp. 1395-1407. https://doi.org/10.1016/j.dam.2007.02.008

}

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 -