Pages that link to "Item:Q3639254"
From MaRDI portal
The following pages link to Polynomial-Time Algorithm for the Leafage of Chordal Graphs (Q3639254):
Displayed 17 items.
- Strictly interval graphs: characterization and linear time recognition (Q325435) (← links)
- Reduced clique graphs of chordal graphs (Q412263) (← links)
- The neighborhood polynomial of chordal graphs (Q832856) (← 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)
- Neighborhood inclusion posets and tree representations for chordal and dually chordal graphs (Q2184677) (← links)
- On the tractability of optimization problems on \(H\)-graphs (Q2196605) (← links)
- The vertex leafage of chordal graphs (Q2442202) (← links)
- On asteroidal sets in chordal graphs (Q2448883) (← links)
- An efficient algorithm for counting Markov equivalent DAGs (Q2667829) (← links)
- A Decomposition Theorem for Chordal Graphs and its Applications (Q2851517) (← links)
- <i>k</i>-separator chordal graphs: leafage and subfamilies (Q2862158) (← links)
- (Q5009589) (← links)
- Testing isomorphism of chordal graphs of bounded leafage is fixed-parameter tractable (extended abstract) (Q6043177) (← links)
- The Neighborhood Polynomial of Chordal Graphs (Q6045410) (← links)
- The firebreak problem (Q6065343) (← links)
- Computing a minimum subset feedback vertex set on chordal graphs parameterized by leafage (Q6119835) (← links)