scientific article; zbMATH DE number 3375519
From MaRDI portal
Publication:5646916
zbMath0237.05107MaRDI QIDQ5646916
Publication date: 1972
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Trees (05C05) Extremal problems in graph theory (05C35) Directed graphs (digraphs), tournaments (05C20) Total orders (06A05)
Related Items (9)
Computing the jump number on semi-orders is polynomial ⋮ Computing the bump number is easy ⋮ Chain dominated orders ⋮ A structure theory for ordered sets ⋮ Unnamed Item ⋮ Minimizing Setups for Cycle-Free Ordered Sets ⋮ The connection between the bump number problem and flow-shop scheduling with precedence constraints ⋮ Minimizing Setups for Ordered Sets: A Linear Algebraic Approach ⋮ Jump number of dags having Dilworth number 2
This page was built for publication:
