Pages that link to "Item:Q1254334"

The following pages link to A recognition algorithm for the intersection graphs of paths in trees (Q1254334):

Displaying 50 items.

• The recognition of geodetically connected graphs (Q293190) (← links)
• Graphs of edge-intersecting non-splitting paths in a tree: representations of holes. I (Q323036) (← links)
• Characterizing width two for variants of treewidth (Q344827) (← links)
• Max point-tolerance graphs (Q344833) (← links)
• On the algorithmic complexity of \(k\)-tuple total domination (Q400524) (← links)
• A characterization of substar graphs (Q401150) (← links)
• Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs (Q468443) (← links)
• Subtree and substar intersection numbers (Q686262) (← links)
• Recognizing vertex intersection graphs of paths on bounded degree trees (Q741718) (← links)
• The edge intersection graphs of paths in a tree (Q792348) (← links)
• Chronological orderings of interval graphs (Q795848) (← 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)
• Equivalences and the complete hierarchy of intersection graphs of paths in a tree (Q1003465) (← links)
• Center location problems on tree graphs with subtree-shaped customers (Q1005232) (← links)
• Edge and vertex intersection of paths in a tree (Q1060226) (← links)
• Triangulated edge intersection graphs of paths in a tree (Q1061147) (← links)
• Intersection graphs of paths in a tree (Q1077439) (← links)
• Hamiltonian circuits in interval graph generalizations (Q1092669) (← links)
• Algorithmic aspects of intersection graphs and representation hypergraphs (Q1119661) (← links)
• String graphs. I: The number of critical nonstring graphs is infinite (Q1121917) (← 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)
• NeST graphs (Q1613397) (← links)
• Total coloring of rooted path graphs (Q1708273) (← links)
• Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
• Towards a comprehensive theory of conflict-tolerance graphs (Q1759850) (← 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)
• Subpath acyclic digraphs (Q1918551) (← 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)
• Exact square coloring of certain classes of graphs: complexity and algorithms (Q2172606) (← links)
• Constant threshold intersection graphs of orthodox paths in trees (Q2184664) (← links)
• Recognizing Helly edge-path-tree graphs and their clique graphs (Q2275917) (← links)
• Extending partial representations of subclasses of chordal graphs (Q2344737) (← links)
• A faster algorithm to recognize undirected path graphs (Q2367409) (← links)
• Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2 (Q2374177) (← links)
• Intersection graphs of orthodox paths in trees (Q2413157) (← links)
• A \textit{branch} \& \textit{price} algorithm for the minimum cost clique cover problem in max-point tolerance graphs (Q2423295) (← links)
• The vertex leafage of chordal graphs (Q2442202) (← links)
• Computing a minimum outer-connected dominating set for the class of chordal graphs (Q2444768) (← links)
• A linear time algorithm for liar's domination problem in proper interval graphs (Q2445259) (← links)
• The \(k\)-edge intersection graphs of paths in a tree (Q2473042) (← links)
• Representing edge intersection graphs of paths on degree 4 trees (Q2476278) (← links)
• A Refined Analysis of Online Path Coloring in Trees (Q2971164) (← links)
• From Path Graphs to Directed Path Graphs (Q3057630) (← links)
• Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
• Characterizing path graphs by forbidden induced subgraphs (Q3652563) (← links)