Pages that link to "Item:Q2546051"
From MaRDI portal
The following pages link to Betweenness, orders and interval graphs (Q2546051):
Displaying 50 items.
- A characterization of substar graphs (Q401150) (← links)
- Enumerating \((\mathbf 2+\mathbf 2)\)-free posets by the number of minimal elements and other statistics (Q411853) (← links)
- Unit and single point interval graphs (Q427904) (← links)
- Modeling concurrency with interval traces (Q515576) (← links)
- On counting interval lengths of interval graphs (Q531590) (← links)
- A selection of maximal elements under non-transitive indifferences (Q618176) (← links)
- Representing preferences using intervals (Q646529) (← links)
- Fairness and partial order semantics (Q672492) (← links)
- On interprocess communication and the implementation of multi-writer atomic registers (Q672706) (← links)
- Structure of concurrency (Q685384) (← links)
- Monge and feasibility sequences in general flow problems (Q686244) (← links)
- Bounded discrete representations of interval orders (Q686255) (← links)
- A linear time and space algorithm to recognize interval orders (Q689975) (← links)
- Real interval representations (Q696944) (← links)
- Following the traces: an introduction to conjoint measurement without transitivity and additivity (Q706884) (← links)
- Ferrers dimension and boxicity (Q708404) (← links)
- A Lagrangian heuristic for satellite range scheduling with resource constraints (Q716351) (← links)
- Primary facets of order polytopes (Q730181) (← links)
- Interval dimension is a comparability invariant (Q804609) (← links)
- Representability of binary relations through fuzzy numbers (Q812596) (← links)
- Weak orders admitting a perpendicular linear order (Q861798) (← links)
- Biased extensive measurement: the general case (Q867997) (← links)
- Tangent circle graphs and `orders' (Q869563) (← links)
- Recognizing and representing proper interval graphs in parallel using merging and sorting (Q869564) (← links)
- Continuous representability of interval orders and biorders (Q882302) (← links)
- Bi-semiorders with frontiers on finite sets (Q894091) (← links)
- Normalized and strict NaP-preferences (Q894096) (← links)
- Object-oriented interaction in resource constrained scheduling (Q918388) (← links)
- Cubical token systems (Q943579) (← links)
- Minimal proper interval completions (Q963366) (← links)
- Degree bounds for linear discrepancy of interval orders and disconnected posets (Q982627) (← links)
- (2+2)-free posets, ascent sequences and pattern avoiding permutations (Q986124) (← links)
- Critically prime interval orders (Q998455) (← links)
- Extending stochastic ordering to belief functions on the real line (Q1006751) (← links)
- A characterization of cycle-free unit probe interval graphs (Q1028472) (← links)
- Representing interval orders by weighted bases: some complexity results (Q1042324) (← links)
- Interval graphs and related topics (Q1060229) (← links)
- Numerical representation of interval orders on a topological space (Q1079464) (← links)
- On ranking fuzzy sets (Q1094301) (← links)
- On numerical representations of semiorders (Q1104217) (← links)
- Trapezoid graphs and their coloring (Q1111577) (← links)
- Expected utility with an interval ordered structure (Q1116920) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- Bipartite dimensions and bipartite degrees of graphs (Q1126290) (← links)
- The duality principle in fuzzy set theory (Q1175738) (← links)
- Synthetic description of a semiorder (Q1175797) (← links)
- \((i,j)\) competition graphs (Q1179189) (← links)
- Norbert Wiener on the theory of measurement (1914, 1915, 1921) (Q1193374) (← links)
- Automorphism groups of posets with forbidden subposets (Q1199468) (← links)
- A new characterization of proper interval graphs (Q1199478) (← links)
