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

Cited in

(only showing first 100 items - show all)

Two minimal forbidden subgraphs for double competition graphs of posets of dimension at most two
Some remarks on interval graphs
Interval graphs and interval orders
Finding Hamiltonian circuits in interval graphs
Homogeneously representable interval graphs
Interval graphs and maps of DNA
Neighborhood perfect graphs
Finding the minimum bandwidth of an interval graph
On the problem of how to represent a graph taking into account an additional structure
Posets with interval upper bound graphs
Fuzzy intersection graphs
Random interval graphs
A characterization of interval catch digraphs
Simplicial decompositions of graphs: A survey of applications
End vertices in interval graphs
On dimensional properties of graphs
A characterization of Robert's inequality for boxicity
Extremal values of the interval number of a graph. II
Extremal values of the interval number of a graph, II
On minimal augmentation of a graph to obtain an interval graph
The asymptotic probability that a random graph is a unit interval graph, indifference graph, or proper interval graph
On grid intersection graphs
Short-chorded and perfect graphs
Representations of graphs and networks (coding, layouts and embeddings)
Intersection properties of graphs
Norbert Wiener on the theory of measurement (1914, 1915, 1921)
A new characterization of proper interval graphs
d-collapsing and nerves of families of convex sets
A recognition algorithm for the intersection graphs of directed paths in directed trees
Comparability graphs and a new matroid
Information storage and retrieval - mathematical foundations. II: Combinatorial problems
Information storage and retrieval systems: Mathematical foundations
Characterization problems for graphs, partially ordered sets, lattices, and families of sets
Interval hypergraphs and D-interval hypergraphs
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
A Turan type problem for interval graphs
The circular dimension of a graph
Representing triangulated graphs in stars
Counting clique trees and computing perfect elimination schemes in parallel
Induced matchings
Phylogeny numbers
Classes and recognition of curve contact graphs
An optimal algorithm for solving the searchlight guarding problem on weighted interval graphs
Optimal cell flipping to minimize channel density in VLSI design and pseudo-Boolean optimization
The forbidden subgraph characterization of directed vertex graphs
Periodic assignment and graph colouring
Compatibility between interval structures and partial orderings
Characterizations of two classes of digraphs
Characterizations and algorithmic applications of chordal graph embeddings
Recognizing interval digraphs and interval bigraphs in polynomial time
The maximal clique and colourability of curve contact graphs
Separability generalizes Dirac's theorem
Matching and multidimensional matching in chordal and strongly chordal graphs
2-role assignments on triangulated graphs.
On linear and circular structure of (claw, net)-free graphs
Interval degree and bandwidth of a graph
Induced matchings in asteroidal triple-free graphs
Interval numbers of powers of block graphs
Hereditary dominating pair graphs
Induced matchings in intersection graphs.
On stable cutsets in graphs
Completeness for intersection classes
The structure of obstructions to treewidth and pathwidth
On the m-clique free interval subgraphs polytope: polyhedral analysis and applications
Graph extremities defined by search algorithms
A short note on the complexity of computing strong pathbreadth
On the classes of interval graphs of limited nesting and count of lengths
Convex and isometric domination of (weak) dominating pair graphs
Recognition and characterization of unit interval graphs with integer endpoints
Towards a comprehensive theory of conflict-tolerance graphs
Recognition and computation of minimal triangulations for AT-free claw-free and co-comparability graphs
On the structure of (\(P_{5}\),\,gem)-free graphs
Constant tolerance intersection graphs of subtrees of a tree
On the Steiner, geodetic and hull numbers of graphs
Dyadic representations of graphs
AT-free graphs: Linear bounds for the oriented diameter
Representing a concept lattice by a graph
Chordal probe graphs
Triangulating graphs without asteroidal triples
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Subpath acyclic digraphs
Normal Helly circular-arc graphs and its subclasses
Proper interval vertex deletion
On the \(e\)-positivity of \((claw, 2K_2)\)-free graphs
Subexponential parameterized algorithms and kernelization on almost chordal graphs
On superperfection of edge intersection graphs of paths
Small one-dimensional Euclidean preference profiles
Optimal patchings for consecutive ones matrices
Faster FPT algorithms for deletion to pairs of graph classes
Uniquely orderable interval graphs
Double-threshold permutation graphs
Vertex deletion into bipartite permutation graphs
Structural properties of Toeplitz graphs
Complexity of paired domination in AT-free and planar graphs
Hamiltonian paths, unit-interval complexes, and determinantal facet ideals
The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality
The niche graphs of bipartite tournaments
A note on the geodetic number and the Steiner number of AT-free graphs
Polynomial treedepth bounds in linear colorings

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)