scientific article; zbMATH DE number 3307330
From MaRDI portal
Publication:5588432
zbMath0193.24205MaRDI QIDQ5588432
Publication date: 1969
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (only showing first 100 items - show all)
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
This page was built for publication:
