Incidence matrices and interval graphs

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

Toll convexity
Representation characterizations of chordal bipartite graphs
The k-Domination and k-Stability Problems on Sun-Free Chordal Graphs
On the isomorphism problem for Helly circular-arc graphs
Approximating the \textsc{Sparsest} \(k\)-\textsc{Subgraph} in chordal graphs
A linear time algorithm for liar's domination problem in proper interval graphs
An optimal algorithm to recognize Robinsonian dissimilarities
A Dirac-type characterization of \(k\)-chordal graphs
Interval graph representation with given interval and intersection lengths
Structural results on circular-arc graphs and circle graphs: a survey and the main open problems
Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances
A Separator Theorem for Chordal Graphs
A linear time algorithm to compute a minimum restrained dominating set in proper interval graphs
A constant approximation algorithm for the densest \(k\)-subgraph problem on chordal graphs
Minimal dominating sets in graph classes: combinatorial bounds and enumeration
Decomposition by clique separators
A generalization of chordal graphs and the maximum clique problem
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
Proper interval graphs and the guard problem
Recognition of Robinsonian dissimilarities
Computing role assignments of proper interval graphs in polynomial time
Unit disk graph recognition is NP-hard
The recognition of geodetically connected graphs
Consecutive retrieval property -- revisited
Solving the all-pairs-shortest-length problem on chordal bipartite graphs
Characterizing circular-arc graphs
Minimal triangulations of graphs: a survey
Trivially perfect graphs
Complexity of approximating the oriented diameter of chordal graphs
Reduced clique graphs of chordal graphs
Unit interval editing is fixed-parameter tractable
Recognizing some subclasses of vertex intersection graphs of 0-bend paths in a grid
Algorithms for a maximum clique and a maximum independent set of a circle graph
Optimal multiple interval assignments in frequency assignment and traffic phasing
Induced matchings
Biclique graphs and biclique matrices
Some results on the target set selection problem
Analysis of upper bounds for the pallet loading problem
On the complexity of computing treelength
The clique-separator graph for chordal graphs
The complexity of manipulative attacks in nearly single-peaked electorates
Maximal chordal subgraphs
2-role assignments on triangulated graphs.
The shield that never was: societies with single-peaked preferences are more open to manipulation and control
The forbidden subgraph characterization of directed vertex graphs
A recognition algorithm for the intersection graphs of directed paths in directed trees
Computing a minimum outer-connected dominating set for the class of chordal graphs
Treewidth computations. I: Upper bounds
Recognition and characterization of chronological interval digraphs
A recognition algorithm for the intersection graphs of paths in trees
On graphs without \(P_ 5\) and \(\overline {P}_ 5\)
Finding minimum height elimination trees for interval graphs in polynomial time
Graph searches and their end vertices
On the non-unit count of interval graphs
On Robinsonian dissimilarities, the consecutive ones property and latent variable models
From path graphs to directed path graphs
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Norbert Wiener on the theory of measurement (1914, 1915, 1921)
A review of tree convex sets test
Vertex ordering characterizations of graphs of bounded asteroidal number
Homological properties of determinantal arrangements
A sufficient condition to extend polynomial results for the maximum independent set problem
Max point-tolerance graphs
Combinatorial optimization models for production scheduling in automated manufacturing systems
Intransitive indifference with unequal indifference intervals
The intersection graphs of subtrees in trees are exactly the chordal graphs
Selected combinatorial problems of computational biology
Interval digraphs: An analogue of interval graphs
Optimal decomposition by clique separators
Tree-decomposition based heuristics for the two-dimensional bin packing problem with conflicts
On the correspondence between tree representations of chordal and dually chordal graphs
Subset feedback vertex sets in chordal graphs
\texttt{PQser:} a Matlab package for spectral seriation
Triangulated graphs and the elimination process
Clique tree generalization and new subclasses of chordal graphs
The vertex leafage of chordal graphs
Higher homotopy groups of complements of complex hyperplane arrangements
On the theory of the consecutive storage of relevant records
Counting clique trees and computing perfect elimination schemes in parallel
Algorithms on circular-arc graphs
The conditional covering problem on unweighted interval graphs with nonuniform coverage radius
I-Colorings,I-Phasings, andI-Intersection assignments for graphs, and their applications
On the tree representation of chordal graphs
Characterizing directed path graphs by forbidden asteroids
A matrix characterization of interval and proper interval graphs
Characterization of the graphs with boxicity \(\leq 2\)
Recognition of some perfectly orderable graph classes
Permuting matrices to avoid forbidden submatrices
Estimating high-dimensional intervention effects from observational data
Integral mixed unit interval graphs
Normal Helly circular-arc graphs and its subclasses
Lex M versus MCS-M
On the effectiveness of the incremental approach to minimal chordal edge modification
Hardness results of global total \(k\)-domination problem in graphs
Polynomial-time algorithms for the subset feedback vertex set problem on interval graphs and permutation graphs
A characterization of signed graphs with generalized perfect elimination orderings
Hardness results of global Roman domination in graphs
Reactive and proactive single-machine scheduling to maintain a maximum number of starting times

This page was built for publication: Incidence matrices and interval graphs

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