The following pages link to (Q4352951):
Displaying 18 items.
- The proof of the removable pair conjecture for fractional dimension. (Q405169) (← links)
- Unit and proper tube orders (Q953272) (← links)
- Interval-valued rank in finite ordered sets (Q1686200) (← links)
- A simple optimal algorithm for \(k\)-tuple dominating problem in interval graphs (Q2102897) (← links)
- Polynomial time algorithm for \(k\)-vertex-edge dominating problem in interval graphs (Q2111523) (← links)
- Uniquely orderable interval graphs (Q2144484) (← links)
- Dimension of restricted classes of interval orders (Q2163840) (← links)
- A simple linear time algorithm to solve the MIST problem on interval graphs (Q2166762) (← links)
- The longest cycle problem is polynomial on interval graphs (Q2227488) (← links)
- The graph of critical pairs of a crown (Q2279688) (← links)
- Hereditary semiorders and enumeration of semiorders by dimension (Q2309220) (← links)
- Extending partial representations of interval graphs (Q2408095) (← links)
- Online and quasi-online colorings of wedges and intervals (Q2520715) (← links)
- A Mazur–Orlicz Type Theorem in Interval Analysis and Its Consequences (Q4645861) (← links)
- Posets and planar graphs (Q5311917) (← links)
- Dimension and matchings in comparability and incomparability graphs. (Q5965146) (← links)
- Concepts of dimension for convex geometries (Q6552469) (← links)
- The \(k\)-th Roman domination problem is polynomial on interval graphs (Q6646735) (← links)
