Intersection graphs of paths in a tree
From MaRDI portal
Redirect page
Redirect to:
Cites work
- scientific article; zbMATH DE number 3859178 (Why is no real title available?)
- scientific article; zbMATH DE number 3758364 (Why is no real title available?)
- scientific article; zbMATH DE number 3566474 (Why is no real title available?)
- scientific article; zbMATH DE number 3639680 (Why is no real title available?)
- scientific article; zbMATH DE number 3322854 (Why is no real title available?)
- scientific article; zbMATH DE number 3020563 (Why is no real title available?)
- A Characterization of Comparability Graphs and of Interval Graphs
- A New Algorithm for Generating All the Maximal Independent Sets
- A characterisation of rigid circuit graphs
- A recognition algorithm for the intersection graphs of directed paths in directed trees
- A recognition algorithm for the intersection graphs of paths in trees
- A slice genus lower bound from \(sl(n)\) Khovanov-Rozansky homology
- Algorithms for Minimum Coloring, Maximum Clique, Minimum Covering by Cliques, and Maximum Independent Set of a Chordal Graph
- An Optimal Algorithm to Detect a Line Graph and Output Its Root Graph
- An algorithm for constructing edge-trees from hypergraphs
- An algorithm for finding clique cut-sets
- An efficient PQ-graph algorithm for solving the graph-realization problem
- Decomposition by clique separators
- Edge and vertex intersection of paths in a tree
- Incidence matrices with the consecutive 1’s property
- Intersection representations of graphs by arcs
- Line perfect graphs
- Matrix characterizations of circular-arc graphs
- The NP-Completeness of Edge-Coloring
- The intersection graphs of subtrees in trees are exactly the chordal graphs
- Triangulated edge intersection graphs of paths in a tree
Cited in
(75)- Directed acyclic graphs with the unique dipath property
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree
- A characterization of substar graphs
- Strong cliques and equistability of EPT graphs
- Path Partitions, Cycle Covers and Integer Decomposition
- Recognizing clique graphs of directed edge path graphs
- On the complexity of recognizing directed path families
- Characterization of 2-path signed network
- End simplicial vertices in path graphs
- Truly non-trivial graphoidal graphs
- On asteroidal sets in chordal graphs
- Simpler and unified recognition algorithm for path graphs and directed path graphs
- scientific article; zbMATH DE number 5763164 (Why is no real title available?)
- A superclass of edge-path-tree graphs with few cliques
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- On spectrum assignment in elastic optical tree-networks
- Coloring all directed paths in a symmetric tree, with an application to optical networks
- Représentations en arbre de proximités relatives
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs
- On models of directed path graphs non rooted directed path graphs
- Intersection graphs of concatenable subtrees of graphs
- On basic chordal graphs and some of its subclasses
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs
- Exactly hittable interval graphs
- Subpath acyclic digraphs
- Two new characterizations of path graphs
- scientific article; zbMATH DE number 2230209 (Why is no real title available?)
- Equivalences and the complete hierarchy of intersection graphs of paths in a tree
- Asteroidal quadruples in non rooted path graphs
- Succinct data structure for path graphs
- Clique graphs and Helly graphs
- Decomposition by maxclique separators
- The clique-separator graph for chordal graphs
- Intersection graphs of non-crossing paths
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage
- Recognising the overlap graphs of subtrees of restricted trees is hard
- Recognizing Helly edge-path-tree graphs and their clique graphs
- The forbidden subgraph characterization of directed vertex graphs
- Clique-coloring UE and UEH graphs
- Intersection graphs of non-crossing paths
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree
- Recognizing clique graphs of directed and rooted path graphs
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs
- Modular intersection graphs
- Finding maximum matchings in RDV graphs efficiently
- Counting independent sets in a tolerance graph
- Recognizing vertex intersection graphs of paths on bounded degree trees
- Directed path graph isomorphism
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage
- From path graphs to directed path graphs
- Characterizing width two for variants of treewidth
- An algorithm for fraternal orientation of graphs
- Intersection graphs of Helly families of subtrees
- Perfect graphs with polynomially computable kernels
- On the correspondence between tree representations of chordal and dually chordal graphs
- Intersection graphs of vertex disjoint paths in a tree
- The separator theorem for rooted directed vertex graphs
- Algorithmic aspects of intersection graphs and representation hypergraphs
- Succinct data structure for chordal graphs with bounded vertex leafage
- Helly EPT graphs on bounded degree trees: characterization and recognition
- Path Problems in Complex Networks
- The vertex leafage of chordal graphs
- A note on the Hamiltonian circuit problem on directed path graphs
- Constant tolerance intersection graphs of subtrees of a tree
- Counting clique trees and computing perfect elimination schemes in parallel
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs
- Total coloring of rooted path graphs
- Counting maximal independent sets in directed path graphs
- Characterizing directed path graphs by forbidden asteroids
- Computing the \(K\)-terminal reliability of directed path graphs
- Completeness for intersection classes
- Revising Johnson's table for the 21st century
- Representations of graphs and networks (coding, layouts and embeddings)
- A faster algorithm to recognize undirected path graphs
This page was built for publication: Intersection graphs of paths in a tree
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1077439)
