Representation of a finite graph by a set of intervals on the real line

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

Toll convexity
d-collapsing and nerves of families of convex sets
Representation characterizations of chordal bipartite graphs
Title not available (Why is that?)
A characterization of interval catch digraphs
A structural characterization for certifying Robinsonian matrices
Graphs with induced-saturation number zero
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Relationships between the class of unit grid intersection graphs and other classes of bipartite graphs
Fully dynamic recognition of proper circular-arc graphs
NP-completeness results for edge modification problems
Linear-time recognition of Helly circular-arc models and graphs
Interval graphs and maps of DNA
Linear time algorithms for dominating pairs in asteroidal triple-free graphs
On minimal augmentation of a graph to obtain an interval graph
Diameter determination on restricted graph families
Transitiv orientierbare Graphen
Castelnuovo-Mumford regularity under reduction processes on graphs and hypergraphs
On CCE graphs of doubly partial orders
Characterizations and algorithmic applications of chordal graph embeddings
Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
Periodic assignment and graph colouring
On models of directed path graphs non rooted directed path graphs
On the structure of (\(P_{5}\),\,gem)-free graphs
Computing role assignments of proper interval graphs in polynomial time
Bandwidth of chain graphs
Vertex ranking of asteroidal triple-free graphs
End vertices in interval graphs
Triangulating graphs without asteroidal triples
Vertex ranking of asteroidal triple-free graphs
Characterizing circular-arc graphs
Minimal triangulations of graphs: a survey
Reduced clique graphs of chordal graphs
Interval graphs and interval orders
Some properties of edge intersection graphs of single-bend paths on a grid
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
Induced matchings
Asteroidal quadruples in non rooted path graphs
Classes of graphs with \(e\)-positive chromatic symmetric function
Subexponential parameterized algorithms and kernelization on almost chordal graphs
Asteroidal triple-free graphs
On unit interval graphs with integer endpoints
Strictly interval graphs: characterization and linear time recognition
Largest chordal and interval subgraphs faster than \(2^n\)
2-role assignments on triangulated graphs.
The forbidden subgraph characterization of directed vertex graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Comparability graphs and a new matroid
Recognition and characterization of chronological interval digraphs
Optimal greedy algorithms for indifference graphs
On the non-unit count of interval graphs
Induced matchings in asteroidal triple-free graphs
A note on path domination
An evolution of interval graphs
Proper Interval Vertex Deletion
Title not available (Why is that?)
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Random interval graphs
Norbert Wiener on the theory of measurement (1914, 1915, 1921)
An optimal greedy heuristic to color interval graphs
Vertex ordering characterizations of graphs of bounded asteroidal number
Forbidden induced subgraphs of normal Helly circular-arc graphs: characterization and detection
Max point-tolerance graphs
Intransitive indifference with unequal indifference intervals
The intersection graphs of subtrees in trees are exactly the chordal graphs
Detecting induced minors in AT-free graphs
Asteroidal-triple-free interval \(k\)-graphs
Finding Hamiltonian circuits in interval graphs
Optimal decomposition by clique separators
Information storage and retrieval systems: Mathematical foundations
A Turan type problem for interval graphs
On distance-3 matchings and induced matchings
Recognition and characterization of unit interval graphs with integer endpoints
On dimensional properties of graphs
AT-free graphs: Linear bounds for the oriented diameter
On grid intersection graphs
Counting clique trees and computing perfect elimination schemes in parallel
Characterizing path graphs by forbidden induced subgraphs
Asteroids in rooted and directed path graphs
Induced matchings in intersection graphs.
Unrelated parallel machine scheduling problem with precedence constraints: polyhedral analysis and branch-and-cut
On stable cutsets in graphs
Characterizing directed path graphs by forbidden asteroids
Characterization of the graphs with boxicity \(\leq 2\)
Two strikes against perfect phylogeny
Normal Helly circular-arc graphs and its subclasses
Incidence matrices with the consecutive 1’s property
Minimal obstructions for partial representations of interval graphs
The circular dimension of a graph
Interval competition graphs of symmetric digraphs
Two-step graphs of trees
Interval graphs, adjusted interval digraphs, and reflexive list homomorphisms
Separator orders in interval, cocomparability, and AT-free graphs
Interval hypergraphs and D-interval hypergraphs
On end-vertices of lexicographic breadth first searches
Reconstruction of Interval Graphs
Computing the boxicity of a graph by covering its complement by cointerval graphs
Extremal values of the interval number of a graph. II

This page was built for publication: Representation of a finite graph by a set of intervals on the real line

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