Publication:5588432
From MaRDI portal
zbMath0193.24205MaRDI QIDQ5588432
Publication date: 1969
Related Items
From a Circular-Arc Model to a Proper Circular-Arc Model, Dynamic storage allocation with known durations, Asteroidal triples of moplexes, An approximation result for a periodic allocation problem, Space graphs and sphericity, Reconstructibility and perfect graphs, A linear-time algorithm for proper interval graph recognition, Simple linear time recognition of unit interval graphs, \(\phi\)-threshold and \(\phi\)-tolerance chain graphs, Interval competition graphs of symmetric digraphs, On the sphericity and cubicity of graphs, Interval line graphs, Tolerance graphs, Clique graphs of time graphs, Minimal separators in \(P_4\)-sparse graphs, Gridline indifference graphs, Tangent circle graphs and `orders', Recognizing and representing proper interval graphs in parallel using merging and sorting, Unit and proper tube orders, Finding Hamiltonian circuits in proper interval graphs, Interval graphs and interval orders, Applications of the theory of meaningfulness to psychology, On the null-homotopy of bridged graphs, A characterization of interval catch digraphs, Difference measurement spaces, Lukasiewicz logic and the foundations of measurement, An application of vertex packing to data analysis in the evaluation of pavement deterioration, Norbert Wiener on the theory of measurement (1914, 1915, 1921), A new characterization of proper interval graphs, Efficient parallel recognition of some circular arc graphs. I, A recognition algorithm for the intersection graphs of directed paths in directed trees, Comparability graphs and a new matroid, A short proof that `proper = unit', On chordal proper circular arc graphs, Characterizations and algorithmic applications of chordal graph embeddings, On properties of unit interval graphs with a perceptual motivation, Short proofs for interval digraphs, Proper and unit bitolerance orders and graphs, Unit disk graph recognition is NP-hard, Satisfiability problems on intervals and unit intervals, Separability generalizes Dirac's theorem, 2-role assignments on triangulated graphs., NeST graphs, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, The subchromatic number of a graph, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, AT-free graphs: Linear bounds for the oriented diameter, A characterisation of rigid circuit graphs, Representing a concept lattice by a graph, Proper and unit tolerance graphs, On edge transitivity of directed graphs, The Roberts characterization of proper and unit interval graphs, Packing triangles in low degree graphs and indifference graphs, Precoloring extension on unit interval graphs, Sphericity, cubicity, and edge clique covers of graphs, Non-unit free triangle orders, A finite non-unit free triangle order, On the compatibility between a graph and a simple order, Intransitive indifference with unequal indifference intervals, On nontransitive indifference, A structure theorem for the consecutive 1's property, Betweenness, orders and interval graphs, Conditions for the representation of absolute judgment and pair comparison isosensitivity curves by cumulative distributions, The intersection graphs of subtrees in trees are exactly the chordal graphs, Structure theorems for some circular-arc graphs, A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs, Random Generation and Enumeration of Proper Interval Graphs, The Interval Count of a Graph, Double Semiorders and Double Indifference Graphs, Maximum Semiorders in Interval Orders
