scientific article; zbMATH DE number 1057882
From MaRDI portal
Publication:4352951
zbMath0877.06001MaRDI QIDQ4352951
Publication date: 8 December 1997
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
surveyRamsey theoryextremal problemsinterval graphsinterval orderson-line coloringdimension estimatestolerance ordershamiltonian pathsbalancing pairsfractional parameters
Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Combinatorics of partially ordered sets (06A07) Graph theory (05C99) Research exposition (monographs, survey articles) pertaining to ordered structures (06-02)
Related Items (17)
Uniquely orderable interval graphs ⋮ Posets and planar graphs ⋮ Dimension of restricted classes of interval orders ⋮ A simple linear time algorithm to solve the MIST problem on interval graphs ⋮ Extending partial representations of interval graphs ⋮ Interval-valued rank in finite ordered sets ⋮ The proof of the removable pair conjecture for fractional dimension. ⋮ The longest cycle problem is polynomial on interval graphs ⋮ A Mazur–Orlicz Type Theorem in Interval Analysis and Its Consequences ⋮ Unit and proper tube orders ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs ⋮ The graph of critical pairs of a crown ⋮ Dimension and matchings in comparability and incomparability graphs. ⋮ Online and quasi-online colorings of wedges and intervals ⋮ Hereditary semiorders and enumeration of semiorders by dimension ⋮ A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs ⋮ Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs
This page was built for publication:
