Pages that link to "Item:Q738877"
From MaRDI portal
The following pages link to Enumerating minimal dominating sets in chordal graphs (Q738877):
Displaying 9 items.
- Enumeration of maximal irredundant sets for claw-free graphs (Q1628586) (← links)
- Acyclic edge coloring of chordal graphs with bounded degree (Q2053722) (← links)
- An improved exact algorithm for minimum dominating set in chordal graphs (Q2059888) (← links)
- Bounds for the connected domination number of maximal outerplanar graphs (Q2166232) (← links)
- Enumeration of minimal connected dominating sets for chordal graphs (Q2174551) (← links)
- Enumeration and maximum number of minimal dominating sets for chordal graphs (Q2317861) (← links)
- Enumeration of Maximal Irredundant Sets for Claw-Free Graphs (Q5283376) (← links)
- Linear-Time Generation of Random Chordal Graphs (Q5283388) (← links)
- Enumeration and maximum number of maximal irredundant sets for chordal graphs (Q5919544) (← links)
