Pages that link to "Item:Q5919544"
From MaRDI portal
The following pages link to Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544):
Displaying 5 items.
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack (Q635734) (← links)
- Counting the number of independent sets in chordal graphs (Q935840) (← links)
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)