Degree bounds for linear discrepancy of interval orders and disconnected posets

DOI10.1016/j.disc.2010.04.016zbMath1190.06005OpenAlexW2103781183MaRDI QIDQ982627

Stephen J. Young, Mitchel T. Keller

Publication date: 7 July 2010

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2010.04.016

zbMATH Keywords

bandwidthinterval orderinterval graphlinear discrepancycritical pairdisconnected poset

Mathematics Subject Classification ID

Combinatorics of partially ordered sets (06A07)

Related Items (2)

Linear discrepancy of chain products and posets with bounded degree ⋮ The total linear discrepancy of an ordered set

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Irreducible width 2 posets of linear discrepancy \(3\)
• Interval degree and bandwidth of a graph
• Linear discrepancy and weak discrepancy of partially ordered sets
• Linear discrepancy and bandwidth
• A characterization of partially ordered sets with linear discrepancy equal to \(2\)
• Betweenness, orders and interval graphs
• Computing the Bandwidth of Interval Graphs
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• A survey of solved problems and applications on bandwidth, edgesum, and profile of graphs
• Research problems

This page was built for publication: Degree bounds for linear discrepancy of interval orders and disconnected posets