A recognition algorithm for the intersection graphs of paths in trees

Cites Work

Title not available (Why is that?)
Testing for the consecutive ones property, interval graphs, and graph planarity using PQ-tree algorithms
Incidence matrices and interval graphs
Transitive Orientation of Graphs and Identification of Permutation Graphs
The intersection graphs of subtrees in trees are exactly the chordal graphs
A Characterization of Comparability Graphs and of Interval Graphs
Title not available (Why is that?)
Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
A recognition algorithm for the intersection graphs of directed paths in directed trees
Title not available (Why is that?)
Intersection representations of graphs by arcs

Cited In (61)

Truly non-trivial graphoidal graphs
Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
Exactly hittable interval graphs
Two new characterizations of path graphs
Monotonic Representations of Outerplanar Graphs as Edge Intersection Graphs of Paths on a Grid
Constant threshold intersection graphs of orthodox paths in trees
On the algorithmic complexity of \(k\)-tuple total domination
A characterization of substar graphs
A linear time algorithm for liar's domination problem in proper interval graphs
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2
String graphs. I: The number of critical nonstring graphs is infinite
Towards a comprehensive theory of conflict-tolerance graphs
Subtree and substar intersection numbers
On the complexity of recognizing directed path families
Chronological orderings of interval graphs
Algorithms and complexity of sandwich problems in graphs (extended abstract)
Exact square coloring of certain classes of graphs: complexity and algorithms
Optimal tree 3-spanners in directed path graphs
The edge intersection graphs of paths in a tree
NeST graphs
A refined analysis of online path coloring in trees
Edge and vertex intersection of paths in a tree
Triangulated edge intersection graphs of paths in a tree
Intersection graphs of paths in a tree
Center location problems on tree graphs with subtree-shaped customers
The recognition of geodetically connected graphs
Subpath acyclic digraphs
Complexity of distance paired-domination problem in graphs
What Is between Chordal and Weakly Chordal Graphs?
Extending partial representations of subclasses of chordal graphs
Equivalences and the complete hierarchy of intersection graphs of paths in a tree
An algorithm for constructing edge-trees from hypergraphs
Intersection graphs of non-crossing paths
Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I
Recognizing Helly edge-path-tree graphs and their clique graphs
The forbidden subgraph characterization of directed vertex graphs
Computing a minimum outer-connected dominating set for the class of chordal graphs
Recognition algorithm for intersection graphs of edge disjoint paths in a tree
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
Representing edge intersection graphs of paths on degree 4 trees
Recognizing vertex intersection graphs of paths on bounded degree trees
From path graphs to directed path graphs
Algorithmic aspects of the generalized clique-transversal problem on chordal graphs
Characterizing width two for variants of treewidth
Max point-tolerance graphs
Intersection graphs of vertex disjoint paths in a tree
Intersection graphs of orthodox paths in trees
Hamiltonian circuits in interval graph generalizations
Algorithmic aspects of intersection graphs and representation hypergraphs
The \(k\)-edge intersection graphs of paths in a tree
The vertex leafage of chordal graphs
On the Algorithmic Complexity of Total Domination
Intersection representations of matrices by subtrees and unicycles on graphs
Characterizing path graphs by forbidden induced subgraphs
Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs
Total coloring of rooted path graphs
Characterizing directed path graphs by forbidden asteroids
Revising Johnson's table for the 21st century
A faster algorithm to recognize undirected path graphs

This page was built for publication: A recognition algorithm for the intersection graphs of paths in trees

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