Pages that link to "Item:Q1219893"
From MaRDI portal
The following pages link to A recognition algorithm for the intersection graphs of directed paths in directed trees (Q1219893):
Displaying 31 items.
- On the algorithmic complexity of edge total domination (Q300244) (← links)
- Towards a characterization of leaf powers by clique arrangements (Q343767) (← links)
- On the model-checking of monadic second-order formulas with edge set quantifications (Q415286) (← links)
- Computing residual connectedness reliability for restricted networks (Q686266) (← links)
- Finding dominating cliques efficiently, in strongly chordal graphs and undirected path graphs (Q805638) (← links)
- Intersection representations of matrices by subtrees and unicycles on graphs (Q935839) (← links)
- On the complexity of recognizing directed path families (Q967290) (← links)
- Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
- Tree 3-spanners in 2-sep directed path graphs: Characterization, recognition, and construction (Q1026118) (← links)
- Intersection graphs of paths in a tree (Q1077439) (← links)
- Finding the minimum bandwidth of an interval graph (Q1090458) (← links)
- Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
- Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) (← links)
- A recognition algorithm for the intersection graphs of paths in trees (Q1254334) (← 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)
- The complexity of the locally connected spanning tree problem (Q1408813) (← links)
- Intersection graphs of vertex disjoint paths in a tree (Q1903730) (← links)
- Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) (← links)
- Parameterized algorithms for Steiner tree and dominating set: bounding the leafage by the vertex leafage (Q2154102) (← links)
- Results on vertex-edge and independent vertex-edge domination (Q2168729) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q2169982) (← links)
- Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
- A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
- Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217) (← links)
- Pairwise Compatibility Graphs: A Survey (Q3186100) (← links)
- Intersection graphs of non-crossing paths (Q6041577) (← links)
- Two new characterizations of path graphs (Q6056699) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Classes of intersection digraphs with good algorithmic properties (Q6201028) (← links)
