scientific article; zbMATH DE number 2117210

Ann N. Trenk, Martin Charles Golumbic

Publication date: 22 November 2004

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Graph theory (05Cxx)

Related Items

NeST graphs, Chordal probe graphs, Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2, Intersection graphs of homothetic polygons, Induced Separation Dimension, What Is between Chordal and Weakly Chordal Graphs?, On containment graphs of paths in a tree, $\lambda$-coloring matrogenic graphs, Double-threshold permutation graphs, Max point-tolerance graphs, Dimension of restricted classes of interval orders, Helly EPT graphs on bounded degree trees: characterization and recognition, Homothetic polygons and beyond: maximal cliques in intersection graphs, The $t$-discrepancy of a poset, Containment graphs and posets of paths in a tree: wheels and partial wheels, Adjacency matrices of probe interval graphs, Recognizing simple-triangle graphs by restricted 2-chain subgraph cover, Recognizing Threshold Tolerance Graphs in $$O(n^2)$$ Time, Intersection graphs of orthodox paths in trees, Constant threshold intersection graphs of orthodox paths in trees, Characterizing interval graphs which are probe unit interval graphs, Generating Posets Beyond N, A recognition algorithm for simple-triangle graphs, Multithreshold multipartite graphs, A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs, On the intersection of tolerance and cocomparability graphs, A sufficient condition for boundedness of tolerance graphs, Forbidden substructure for interval digraphs/bigraphs, An optimal algorithm for the $k$-fixed-endpoint path cover on proper interval graphs, Fuzzy $\phi$-tolerance competition graphs, Unnamed Item, The recognition of triangle graphs, Recognition of probe proper interval graphs, A characterization of chain probe graphs, Co-TT graphs and a characterization of split co-TT graphs, Counting independent sets in a tolerance graph, The $k$-edge intersection graphs of paths in a tree, Recent results on containment graphs of paths in a tree, An intersection model for multitolerance graphs: efficient algorithms and hierarchy, Mutual exclusion scheduling with interval graphs or related classes. II, First-fit coloring of bounded tolerance graphs, Fractional weak discrepancy and split semiorders, Towards a comprehensive theory of conflict-tolerance graphs, A matrix characterization of interval and proper interval graphs, Dimension-2 poset competition numbers and dimension-2 poset double competition numbers, A characterization of triangle-free tolerance graphs, Exact leaf powers, Range of the fractional weak discrepancy function, Dyadic representations of graphs, On the complete width and edge clique cover problems, The induced separation dimension of a graph, On the bi-enhancement of chordal-bipartite probe graphs, A characterization of 2-tree probe interval graphs, On central max-point-tolerance graphs, Equivalences and the complete hierarchy of intersection graphs of paths in a tree, Mutual exclusion scheduling with interval graphs or related classes. I, A vertex ordering characterization of simple-triangle graphs, Fuzzy k-Competition Graphs and p-Competition Fuzzy Graphs, Two-colorable graph states with maximal Schmidt measure, New Geometric Representations and Domination Problems on Tolerance and Multitolerance Graphs, Cubicity of threshold graphs, Intersection models of weakly chordal graphs, Tolerance orders of open and closed unit intervals, Linear-Time Recognition of Probe Interval Graphs, Interval orders with two interval lengths, The Recognition of Simple-Triangle Graphs and of Linear-Interval Orders is Polynomial, Efficient Local Representations of Graphs, A polynomial algorithm for the k-cluster problem on the interval graphs, PTAS for densest $k$-subgraph in interval graphs