Pages that link to "Item:Q1077439"
From MaRDI portal
The following pages link to Intersection graphs of paths in a tree (Q1077439):
Displaying 50 items.
- Strong cliques and equistability of EPT graphs (Q260014) (← links)
- End simplicial vertices in path graphs (Q274693) (← links)
- On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
- On basic chordal graphs and some of its subclasses (Q299101) (← links)
- Characterizing width two for variants of treewidth (Q344827) (← links)
- Directed acyclic graphs with the unique dipath property (Q393144) (← links)
- A characterization of substar graphs (Q401150) (← links)
- Decomposition by maxclique separators (Q465285) (← links)
- Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
- Counting independent sets in a tolerance graph (Q479039) (← links)
- Solving coloring, minimum clique cover and kernel problems on arc intersection graphs of directed paths on a tree (Q548676) (← links)
- Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
- Clique graphs and Helly graphs (Q802632) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Asteroidal quadruples in non rooted path graphs (Q891307) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- A parallel algorithm for generating bicompatible elimination orderings of proper interval graphs (Q989571) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- The clique-separator graph for chordal graphs (Q1026133) (← links)
- A superclass of edge-path-tree graphs with few cliques (Q1038105) (← links)
- Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- An algorithm for fraternal orientation of graphs (Q1197981) (← links)
- Counting clique trees and computing perfect elimination schemes in parallel (Q1262131) (← links)
- A note on the Hamiltonian circuit problem on directed path graphs (Q1262132) (← links)
- Recognizing clique graphs of directed and rooted path graphs (Q1293208) (← links)
- The forbidden subgraph characterization of directed vertex graphs (Q1297413) (← links)
- Recognition algorithm for intersection graphs of edge disjoint paths in a tree (Q1318763) (← links)
- Intersection graphs of concatenable subtrees of graphs (Q1331898) (← links)
- Completeness for intersection classes (Q1584399) (← links)
- Total coloring of rooted path graphs (Q1708273) (← links)
- On spectrum assignment in elastic optical tree-networks (Q1730219) (← links)
- Constant tolerance intersection graphs of subtrees of a tree (Q1764901) (← links)
- The separator theorem for rooted directed vertex graphs (Q1850517) (← links)
- Recognizing clique graphs of directed edge path graphs (Q1861580) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Intersection graphs of Helly families of subtrees (Q1917300) (← links)
- Subpath acyclic digraphs (Q1918551) (← links)
- Modular intersection graphs (Q1923781) (← links)
- Counting maximal independent sets in directed path graphs (Q2015155) (← links)
- Revising Johnson's table for the 21st century (Q2091799) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Characterization of 2-path signed network (Q2221636) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- Perfect graphs with polynomially computable kernels (Q2283107) (← links)
- Computing the \(K\)-terminal reliability of directed path graphs (Q2348708) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Helly EPT graphs on bounded degree trees: characterization and recognition (Q2404370) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
