A Characterization of Comparability Graphs and of Interval Graphs

Cited in

(only showing first 100 items - show all)

Minimal interval completion through graph exploration
The neighbour-scattering number can be computed in polynomial time for interval graphs
A linear time recognition algorithm for proper interval graphs
Characterizations and recognition of circular-arc graphs and subclasses: a survey
Some remarks on interval graphs
On realizable biorders and the biorder dimension of a relation
Split graphs of Dilworth number 2
Finding Hamiltonian circuits in interval graphs
Comparability graphs with constraint, partial semi-orders and interval orders
Interval graphs and maps of DNA
Some sequences associated with combinatorial structures
Intersection graphs of paths in a tree
Schedule-induced posets
Finding the minimum bandwidth of an interval graph
Bipartite permutation graphs
Fuzzy intersection graphs
On lexicographic semi-commutations
Random interval graphs
Total domination in interval graphs revisited
Is there a diagram invariant?
Simplicial decompositions of graphs: A survey of applications
Algorithmic aspects of intersection graphs and representation hypergraphs
On dimensional properties of graphs
String graphs. I: The number of critical nonstring graphs is infinite
\(P_ 4\)-comparability graphs
On orientations and shortest paths
On maximal independent sets of vertices in claw-free graphs
Extremal values of the interval number of a graph. II
An algorithm for generating all maximal independent subsets of posets
Extremal values of the interval number of a graph, II
A structure theory for ordered sets
Complement reducible graphs
On minimal augmentation of a graph to obtain an interval graph
Comparability graphs and intersection graphs
Representations of graphs and networks (coding, layouts and embeddings)
A condition for a family of triangles to be orientable to a cyclic order
Norbert Wiener on the theory of measurement (1914, 1915, 1921)
Generalized transitive tournaments and doubly stochastic matrices
Constructing a stochastic critical path network given the slacks: Representation
Thresholds for classes of intersection graphs
On sources in comparability graphs, with applications
Paths in interval graphs and circular arc graphs
An algorithm for testing chordality of graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Acyclic orientations of a graph and the chromatic and independence numbers
Comparability graphs and a new matroid
Information storage and retrieval - mathematical foundations. II: Combinatorial problems
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
The complexity of comparability graph recognition and coloring
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
On a class of posets and the corresponding comparability graphs
The circular dimension of a graph
The seriation problem and the travelling salesman problem
A recognition algorithm for the intersection graphs of paths in trees
Optimal circular arc representations: Properties, recognition, and construction
On the complexity of the k-chain subgraph cover problem
Matrix sandwich problems
On the pathwidth of chordal graphs
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Periodic assignment and graph colouring
Compatibility between interval structures and partial orderings
Treewidth of cocomparability graphs and a new order-theoretic parameter
Finding minimum height elimination trees for interval graphs in polynomial time
Claw-free graphs---a survey
Simultaneous dominance representation of multiple posets
Restrictions of minimum spanner problems
*-graphs of vertices of the generalized transitive tournament polytope
Generalizations of semiorders: A review note
Satisfiability problems on intervals and unit intervals
Matching and multidimensional matching in chordal and strongly chordal graphs
Efficient minus and signed domination in graphs
The mutual exclusion scheduling problem for permutation and comparability graphs.
Induced matchings in intersection graphs.
Concordance graphs
A census of infinite distance-transitive graphs
The structure of obstructions to treewidth and pathwidth
Homothetic polygons and beyond: maximal cliques in intersection graphs
Necessary and possible indifferences
Fully dynamic representations of interval graphs
Towards a comprehensive theory of conflict-tolerance graphs
On forcibly hereditary P-graphical sequences
\((0,{1\over 2},1)\) matrices which are extreme points of the generalized transitive tournament polytope
Characterizations of fuzzy interval graphs
MPQ-trees for the orthogonal packing problem
Cleaning interval graphs
The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
Integral mixed unit interval graphs
Normal Helly circular-arc graphs and its subclasses
Graph isomorphism and identification matrices: Sequential algorithms
New results on induced matchings
Worpitzky-compatible subarrangements of braid arrangements and cocomparability graphs
Characterization of \(\mathrm{B}_0\)-VPG cocomparability graphs and a 2D visualization of their posets
Double-threshold permutation graphs
Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
Characterization of interval graphs that are unpaired 2-disjoint path coverable
Biclique graphs of interval bigraphs
On the minimum clique partitioning problem on weighted chordal graphs
Computing the weighted isolated scattering number of interval graphs in polynomial time
On the canonical ideal of the Ehrhart ring of the chain polytope of a poset

This page was built for publication: A Characterization of Comparability Graphs and of Interval Graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5732670)