Hypertree-depth and minors in hypergraphs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216208%3A11320%2F12%3A10366924" target="_blank" >RIV/00216208:11320/12:10366924 - isvavai.cz</a>

Result on the web

<a href="http://dx.doi.org/10.1016/j.tcs.2012.09.007" target="_blank" >http://dx.doi.org/10.1016/j.tcs.2012.09.007</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.tcs.2012.09.007" target="_blank" >10.1016/j.tcs.2012.09.007</a>

Result language

angličtina

Original language name

Hypertree-depth and minors in hypergraphs

Original language description

We introduce two new notions for hypergraphs, hypertree-depth and minors in hypergraphs. We characterise hypergraphs of bounded hypertree-depth by the ultramonotone robber and marshals game, by vertex-hyperrankings and by centred hypercolourings. Furthermore, we show that minors in hypergraphs are &apos;well-behaved&apos; with respect to hypertree-depth and other hypergraph invariants, such as generalised hypertree-depth and generalised hyperpath-width. We work in the framework of hypergraph pairs (G, H), consisting of a graph G and a hypergraph H that share the same vertex set. This general framework allows us to obtain hypergraph minors, graph minors and induced graph minors as special cases.

Czech name

—

Czech description

—

Type

J_imp - Article in a specialist periodical, which is included in the Web of Science database

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

—

Continuities

S - Specificky vyzkum na vysokych skolach

Publication year

2012

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Name of the periodical

Theoretical Computer Science

ISSN

0304-3975

e-ISSN

—

Volume of the periodical

Neuveden

Issue of the periodical within the volume

463

Country of publishing house

NL - THE KINGDOM OF THE NETHERLANDS

Number of pages

12

Pages from-to

84-95

UT code for WoS article

000312181200008

EID of the result in the Scopus database

—