The following pages link to (Q4138414):
Displayed 50 items.
- Some remarks on conflict analysis (Q555902) (← links)
- Analysis of an ecological niche (Q581302) (← links)
- Computing the boxicity of a graph by covering its complement by cointerval graphs (Q585228) (← links)
- The influence of graph structure on generalized dimension exchange (Q672977) (← links)
- Sources in posets and comparability graphs (Q687177) (← links)
- Representation theorems for graphs whose vertex set is partially ordered (Q762181) (← links)
- Applications of edge coverings by cliques (Q762498) (← links)
- Some results about the interval number of a graph (Q788005) (← links)
- A lower bound for the interval number of a graph (Q788751) (← links)
- Synthesizing partial orders given comparability information: Partitive sets and slack in critical path networks (Q793664) (← links)
- Interval line graphs (Q795846) (← links)
- Chronological orderings of interval graphs (Q795848) (← links)
- Some questions of reachability in natural-resource management (Q799545) (← links)
- The relationship between the threshold dimension of split graphs and various dimensional parameters (Q803177) (← links)
- A folk meta-theorem in the foundations of utility theory (Q808975) (← links)
- Gridline indifference graphs (Q868216) (← links)
- Extensions of graph inversion to support an artificially intelligent modeling environment (Q918394) (← links)
- New sequential and parallel algorithms for interval graph recognition (Q922725) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- Mutual exclusion scheduling with interval graphs or related classes. I (Q1003752) (← links)
- Finding Hamiltonian circuits in proper interval graphs (Q1050117) (← links)
- Determining the interval number of a triangle-free graph (Q1052345) (← links)
- A mathematical analysis of a natural class of partitions of a graph (Q1053643) (← links)
- Complexity of compartmental models (Q1066826) (← links)
- Eigenvalues and structure of compartmental models (Q1066827) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- Homogeneously representable interval graphs (Q1066922) (← links)
- The theorem on planar graphs (Q1071005) (← links)
- Social influence models with ranking alternatives and local election rules (Q1072418) (← links)
- Interval representations of planar graphs (Q1077425) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Size identifiability of compartmental models (Q1081544) (← links)
- On an extremal problem concerning the interval number of a graph (Q1084408) (← links)
- The sensitivity of eigenvalues under elementary matrix perturbations (Q1085244) (← links)
- On pre-periods of discrete influence systems (Q1087853) (← links)
- Applications of the theory of meaningfulness to psychology (Q1088612) (← links)
- Reduction in problem size for ranking alternatives in group decision- making (Q1088864) (← links)
- Some parallel algorithms on interval graphs (Q1098312) (← links)
- On the problem of how to represent a graph taking into account an additional structure (Q1101469) (← links)
- Fuzzy intersection graphs (Q1107547) (← links)
- Dominating sets in social network graphs (Q1108233) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Transitivity of fuzzy matrices under generalized connectedness (Q1120594) (← links)
- On the unit interval number of a graph (Q1120600) (← links)
- On dimensional properties of graphs (Q1121914) (← links)
- Stability and structure of compartmental models of ecosystems (Q1149395) (← links)
- On the stabilization of iterative processes (Q1162797) (← links)
- The median procedure in cluster analysis and social choice theory (Q1164937) (← links)
- The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph (Q1166545) (← links)
- Combined stress and human performance: A weighted digraph model (Q1168258) (← links)