scientific article

zbMath0904.05050MaRDI QIDQ3838186

Douglas B. West, András Gyárfás

Publication date: 9 August 1998

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completeinterval graphsintersection graphstrack numberarboricitymultitrack interval number

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Graph theory (including graph drawing) in computer science (68R10)

Related Items (20)

Caterpillar arboricity of planar graphs ⋮ Recognizing \(d\)-interval graphs and \(d\)-track interval graphs ⋮ Online scheduling of car-sharing request pairs between two locations ⋮ Using fractional primal-dual to schedule split intervals with demands ⋮ The \(k\)-strong induced arboricity of a graph ⋮ On the parameterized complexity of some optimization problems related to multiple-interval graphs ⋮ Temporal interval cliques and independent sets ⋮ Interval scheduling and colorful independent sets ⋮ Three ways to cover a graph ⋮ Local and union boxicity ⋮ Edge-intersection graphs of grid paths: the bend-number ⋮ Interval numbers of powers of block graphs ⋮ On the bend-number of planar and outerplanar graphs ⋮ On interval representations of graphs ⋮ On the parameterized complexity of multiple-interval graph problems ⋮ On star and caterpillar arboricity ⋮ On Covering Numbers, Young Diagrams, and the Local Dimension of Posets ⋮ Inductive \(k\)-independent graphs and \(c\)-colorable subgraphs in scheduling: a review ⋮ Precedence thinness in graphs ⋮ On some arboricities in planar graphs

This page was built for publication: