The following pages link to The leafage of a chordal graph (Q4222379):
Displaying 32 items.
- On models of directed path graphs non rooted directed path graphs (Q292267) (← links)
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- The neighborhood polynomial of chordal graphs (Q832856) (← links)
- Asteroidal quadruples in non rooted path graphs (Q891307) (← links)
- Subgraph trees in graph theory (Q1406544) (← 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)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- Semilattice polymorphisms and chordal graphs (Q2441663) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- Characterization of classical graph classes by weighted clique graphs (Q2448923) (← links)
- An efficient algorithm for counting Markov equivalent DAGs (Q2667829) (← links)
- Linear Algorithms for Chordal Graphs of Bounded Directed Vertex Leafage (Q2839217) (← links)
- Non-separating cliques, asteroidal number and leafage. The minimal 4-asteroidal split graphs (Q2840688) (← links)
- A Decomposition Theorem for Chordal Graphs and its Applications (Q2851517) (← links)
- <i>k</i>-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- Minimum Average Distance Clique Trees (Q2947438) (← links)
- Characterizing directed path graphs by forbidden asteroids (Q3174239) (← links)
- Clique trees of chordal graphs: leafage and 3-asteroidals (Q3503559) (← links)
- Independent sets in asteroidal triple-free graphs (Q4572004) (← links)
- Intersection representation of digraphs in trees with few leaves (Q4719324) (← links)
- On strict-double-bound numbers of graphs and cut sets (Q5061697) (← links)
- The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
- Parameterized complexity of multicut in weighted trees (Q6050131) (← links)
- The diameter of AT‐free graphs (Q6057658) (← links)
- Recognizing Proper Tree-Graphs (Q6089652) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)
- Domination and Cut Problems on Chordal Graphs with Bounded Leafage (Q6492086) (← links)
- Graphs with at most two moplexes (Q6595515) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
- Approximation ratio of the min-degree greedy algorithm for maximum independent set on interval and chordal graphs (Q6648269) (← links)
