scientific article; zbMATH DE number 3375519

MaRDI QIDQ5646916zbMATH OpenFDO

Authors Pierre Martin, Michel Chein

Publication date 1972

Mathematics Subject Classification ID

Trees (05C05) Directed graphs (digraphs), tournaments (05C20) Extremal problems in graph theory (05C35) Total orders (06A05)

Cited in

(9)

• Computing the bump number is easy
• A structure theory for ordered sets
• Computing the jump number on semi-orders is polynomial
• Minimizing Setups for Ordered Sets: A Linear Algebraic Approach
• Minimizing Setups for Cycle-Free Ordered Sets
• scientific article; zbMATH DE number 3641455 (Why is no real title available?)
• The connection between the bump number problem and flow-shop scheduling with precedence constraints
• Jump number of dags having Dilworth number 2
• Chain dominated orders

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646916)