scientific article; zbMATH DE number 3307330
From MaRDI portal
zbMath0193.24205MaRDI QIDQ5588432
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items
Maximum Semiorders in Interval Orders, The chromatic index of proper circular-arc graphs of odd maximum degree which are chordal, Tuple domination on graphs with the consecutive-zeros property, On some applications of the selective graph coloring problem, From a Circular-Arc Model to a Proper Circular-Arc Model, Unit ball graphs on geodesic spaces, Hamiltonian paths, unit-interval complexes, and determinantal facet ideals, Polynomial fixed-parameter algorithms: a case study for longest path on interval graphs, On Strict (Outer-)Confluent Graphs, Characterization of interval graphs that are unpaired 2-disjoint path coverable, Succinct encodings for families of interval graphs, Perfect elimination orderings for symmetric matrices, Extending partial representations of interval graphs, On the thinness and proper thinness of a graph, Distributed minimum vertex coloring and maximum independent set in chordal graphs, Completion of the Mixed Unit Interval Graphs Hierarchy, Characterizing interval graphs which are probe unit interval graphs, Intersection models and forbidden pattern characterizations for 2-thin and proper 2-thin graphs, Similarity-First Search: A New Algorithm with Application to Robinsonian Matrix Recognition, Linear‐time algorithms for eliminating claws in graphs, Interval graphs with side (and size) constraints, Approximating the bandwidth for asteroidal triple-free graphs, Maximum cut on interval graphs of interval count four is NP-complete, Maximizing the strong triadic closure in split graphs and proper interval graphs, The \(k\)-in-a-path problem for claw-free graphs, A Simple Linear Time Algorithm for the Isomorphism Problem on Proper Circular-Arc Graphs, Integral mixed unit interval graphs, Normal Helly circular-arc graphs and its subclasses, Proper interval vertex deletion, On strict (outer-)confluent graphs, Counting and enumerating unlabeled split–indifference graphs, Recognition of probe proper interval graphs, An Optimization Parameter for Seriation of Noisy Data, On coloring problems with local constraints, On coloring problems with local constraints, Structural results on circular-arc graphs and circle graphs: a survey and the main open problems, Characterization of classical graph classes by weighted clique graphs, Random geometric complexes and graphs on Riemannian manifolds in the thermodynamic limit, Computing Role Assignments of Proper Interval Graphs in Polynomial Time, The Roberts characterization of proper and unit interval graphs, Solving problems on generalized convex graphs via mim-width, A characterization of 2-tree proper interval 3-graphs, Packing triangles in low degree graphs and indifference graphs, Weighted domination of independent sets, Dynamic storage allocation with known durations, Unnamed Item, Unnamed Item, Asteroidal triples of moplexes, Precoloring extension on unit interval graphs, Graphs of interval count two with a given partition, Sphericity, cubicity, and edge clique covers of graphs, An approximation result for a periodic allocation problem, A characterization of interval orders with semiorder dimension two, Unnamed Item, Non-unit free triangle orders, A finite non-unit free triangle order, Measuring Indifference: Unit Interval Vertex Deletion, Random Generation and Enumeration of Proper Interval Graphs, Completing colored graphs to meet a target property, On the Carathéodory and exchange numbers of geodetic convexity in graphs, Declawing a graph: polyhedra and branch-and-cut algorithms, Query minimization under stochastic uncertainty, The parameterized complexity of cycle packing: indifference is not an issue, A Subexponential Parameterized Algorithm for Proper Interval Completion, Hardness and structural results for half-squares of restricted tree convex bipartite graphs, 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, \(\mathcal{U}\)-bubble model for mixed unit interval graphs and its applications: the MaxCut problem revisited, Conditions for the representation of absolute judgment and pair comparison isosensitivity curves by cumulative distributions, Circularly Compatible Ones, $D$-Circularity, and Proper Circular-Arc Bigraphs, Kernelization of Graph Hamiltonicity: Proper $H$-Graphs, Unnamed Item, A new representation of proper interval graphs with an application to clique-width, Short Models for Unit Interval Graphs, Probe interval and probe unit interval graphs on superclasses of cographs, The hull number in the convexity of induced paths of order \(3\), The Interval Count of a Graph, The co-secure domination in proper interval graphs, The intersection graphs of subtrees in trees are exactly the chordal graphs, Structure theorems for some circular-arc graphs, Block-indifference graphs: characterization, structural and spectral properties, Using contracted solution graphs for solving reconfiguration problems, New algorithms for weighted \(k\)-domination and total \(k\)-domination problems in proper interval graphs, Double Semiorders and Double Indifference Graphs, Precedence thinness in graphs, Graph Classes and Forbidden Patterns on Three Vertices, Clique-width of full bubble model graphs, The weighted sitting closer to friends than enemies problem in the line, Extending partial representations of subclasses of chordal graphs, Fully dynamic recognition of proper circular-arc graphs, NeST graphs, On the minimum and maximum selective graph coloring problems in some graph classes, Clique-width of path powers, Algorithms for finding disjoint path covers in unit interval graphs, Minimal separators in \(P_4\)-sparse graphs, Thinness of product graphs, Uniform embeddings for Robinson similarity matrices, Applications of the theory of meaningfulness to psychology, Representing a concept lattice by a graph, Consecutive retrieval property -- revisited, The difference between the metric dimension and the determining number of a graph, Proper and unit tolerance graphs, On edge transitivity of directed graphs, On the null-homotopy of bridged graphs, On unit interval graphs with integer endpoints, Strictly interval graphs: characterization and linear time recognition, Threshold-coloring and unit-cube contact representation of planar graphs, Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection, Thin strip graphs, Gridline indifference graphs, Characterizations and algorithmic applications of chordal graph embeddings, Tangent circle graphs and `orders', Recognizing and representing proper interval graphs in parallel using merging and sorting, Space graphs and sphericity, Reconstructibility and perfect graphs, A characterization of interval catch digraphs, 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, Minimal dominating sets in graph classes: combinatorial bounds and enumeration, Satisfiability problems on intervals and unit intervals, Separability generalizes Dirac's theorem, New characterizations of proper interval bigraphs, Graph classes with and without powers of bounded clique-width, 2-role assignments on triangulated graphs., Random generation and enumeration of bipartite permutation graphs, Computing minimum distortion embeddings into a path for bipartite permutation graphs and threshold graphs, Unit and single point interval graphs, Further hardness results on rainbow and strong rainbow connectivity, A new graph parameter to measure linearity, Difference measurement spaces, Computing role assignments of proper interval graphs in polynomial time, Lukasiewicz logic and the foundations of measurement, An application of vertex packing to data analysis in the evaluation of pavement deterioration, Subgraph isomorphism in graph classes, Minimal classes of graphs of unbounded clique-width, Tractabilities and intractabilities on geometric intersection graphs, On the classes of interval graphs of limited nesting and count of lengths, A faster algorithm for the cluster editing problem on proper interval graphs, Complexity of the cluster deletion problem on subclasses of chordal graphs, On the non-unit count of interval graphs, A linear-time algorithm for proper interval graph recognition, Simple linear time recognition of unit interval graphs, Complexity of rainbow vertex connectivity problems for restricted graph classes, Chromatic quasisymmetric functions of directed graphs, Norbert Wiener on the theory of measurement (1914, 1915, 1921), Unit interval vertex deletion: fewer vertices are relevant, Unit and proper tube orders, Unit interval editing is fixed-parameter tractable, Recognition and characterization of unit interval graphs with integer endpoints, \(\phi\)-threshold and \(\phi\)-tolerance chain graphs, A new characterization of proper interval graphs, Interval competition graphs of symmetric digraphs, Extending partial representations of proper and unit interval graphs, A structural characterization for certifying Robinsonian matrices, Powers of cycles, powers of paths, and distance graphs, Fractional weak discrepancy and split semiorders, Towards a comprehensive theory of conflict-tolerance graphs, Some remarks on the geodetic number of a graph, Certifying algorithms for recognizing proper circular-arc graphs and unit circular-arc graphs, Characterising \((k,\ell )\)-leaf powers, Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs, Efficient parallel recognition of some circular arc graphs. I, A recognition algorithm for the intersection graphs of directed paths in directed trees, Treewidth and minimum fill-in on permutation graphs in linear time, Mixed unit interval graphs, Graphs of linear clique-width at most 3, Comparability graphs and a new matroid, A Lex-BFS-based recognition algorithm for Robinsonian matrices, Koszul binomial edge ideals of pairs of graphs, Paired threshold graphs, The clique-separator graph for chordal graphs, The subchromatic number of a graph, On sum coloring and sum multi-coloring for restricted families of graphs, On-line chain partitions of orders: a survey, A simple 3-sweep LBFS algorithm for the recognition of unit interval graphs, AT-free graphs: Linear bounds for the oriented diameter, Characterizations and recognition of circular-arc graphs and subclasses: a survey, On the computation of the hull number of a graph, A dynamic distributed approach to representing proper interval graphs, Finding Hamiltonian circuits in proper interval graphs, On the sphericity and cubicity of graphs, A characterisation of rigid circuit graphs, A short proof that `proper = unit', Interval line graphs, Tolerance graphs, Clique graphs of time graphs, Interval graphs and interval orders, On chordal proper circular arc graphs
