A Characterization of Comparability Graphs and of Interval Graphs

Cited In (only showing first 100 items - show all)

The Dimension of a Comparability Graph
Some sequences associated with combinatorial structures
Incidence matrices with the consecutive 1’s property
A Characterisation of the Minimal Triangulations of Permutation Graphs
A characterization of \(P_{4}\)-comparability graphs
Characterizations of fuzzy interval graphs
The circular dimension of a graph
Counting endpoint sequences for interval orders and interval graphs
Sources in posets and comparability graphs
Interval competition graphs of symmetric digraphs
Separator orders in interval, cocomparability, and AT-free graphs
String graphs. I: The number of critical nonstring graphs is infinite
\(P_ 4\)-comparability graphs
Extremal values of the interval number of a graph. II
Independent packings in structured graphs
OptimalI-Intersection assignments for graphs: A linear programming approach
The frame dimension and the complete overlap dimension of a graph
A census of infinite distance-transitive graphs
On double and multiple interval graphs
Matrix sandwich problems
On the complexity of the k-chain subgraph cover problem
A Lex-BFS-based recognition algorithm for Robinsonian matrices
Dual parameterization of Weighted Coloring
Combining overlap and containment for gene assembly in ciliates
Characterizations of graphs having orientations satisfying local degree restrictions
Some remarks on interval graphs
Convex geometry and group choice
Extremal Values of the Interval Number of a Graph
Minimal triangulation of a graph and optimal pivoting order in a sparse matrix
Computing feasible toolpaths for 5-axis machines
SIMPLE MAX-CUT for unit interval graphs and graphs with few \(P4\)s
Simultaneous dominance representation of multiple posets
Almost all comparability graphs are UPO
Comparability graphs with constraint, partial semi-orders and interval orders
Adjacency matrices of probe interval graphs
Dual parameterization of weighted coloring
Acyclic orientations of a graph and the chromatic and independence numbers
The relationship between the threshold dimension of split graphs and various dimensional parameters
Finding the minimum bandwidth of an interval graph
Dimension transitiv orientierbarer graphen
Contact Representations of Planar Graphs: Extending a Partial Representation is Hard
Paths in interval graphs and circular arc graphs
Extremal values of the interval number of a graph, II
Cubicity of interval graphs and the claw number
Preference Structures and Co-comparability Graphs
Restrictions of minimum spanner problems
Simplicial decompositions of graphs: A survey of applications
Proof of Ding's conjecture on maximal stable sets and maximal cliques in planar graphs
A structure theory for ordered sets
Representing graphs via pattern avoiding words
Extending partial representations of proper and unit interval graphs
Algorithmic aspects of intersection graphs and representation hypergraphs
The structure of obstructions to treewidth and pathwidth
Cleaning interval graphs
Total domination in interval graphs
Complexity of rainbow vertex connectivity problems for restricted graph classes
A simple linear-time algorithm for computing the center of an interval graph
Tree loop graphs
Mixed Search Number of Permutation Graphs
Mixed Search Number and Linear-Width of Interval and Split Graphs
Total domination in interval graphs revisited
Compact Spaces and Spaces of Maximal Complete Subgraphs
The Interval Count of a Graph
Information storage and retrieval - mathematical foundations. II: Combinatorial problems
Split graphs of Dilworth number 2
Strict chordal and strict split digraphs
Line-distortion, bandwidth and path-length of a graph
On lexicographic semi-commutations
Structure of concurrency
On nontransitive indifference
Characterization and complexity of uniformly nonprimitive labeled 2-structures
A faster algorithm to recognize undirected path graphs
Counting Interval Graphs
An \(\mathcal O(n^2)\)-time algorithm for the minimal interval completion problem
Graphs Orientable as Distributive Lattices
A sequential algorithm for finding a maximum weightK-independent set on interval graphs
An optimal algorithm to recognize Robinsonian dissimilarities
Orienting graphs to optimize reachability
Flots et tensions dans un graphe
Strengthened 0-1 linear formulation for the daily satellite mission planning
Chronological orderings of interval graphs
Minimal interval completion through graph exploration
Computing the boxicity of a graph by covering its complement by cointerval graphs
Interval graphs and maps of DNA
On minimal augmentation of a graph to obtain an interval graph
Transitiv orientierbare Graphen
Parameterized dominating set problem in chordal graphs: Complexity and lower bound
Further hardness results on rainbow and strong rainbow connectivity
Dimension-2 poset competition numbers and dimension-2 poset double competition numbers
Proof of Chvátal's conjecture on maximal stable sets and maximal cliques in graphs
Intersection graphs of paths in a tree
A linear time recognition algorithm for proper interval graphs
On orientations and shortest paths
Complement reducible graphs
Comparability graphs and intersection graphs
Generalizations of semiorders: A review note
A relationship between triangulated graphs, comparability graphs, proper interval graphs, proper circular-arc graphs, and nested interval graphs
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Partial orders of dimension 2
Periodic assignment and graph colouring

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)