The following pages link to (Q3206969):
Displaying 23 items.
- A note on an induced subgraph characterization of domination perfect graphs (Q516908) (← links)
- On approximating the minimum independent dominating set (Q750159) (← links)
- Domination, independent domination, and duality in strongly chordal graphs (Q788002) (← links)
- What is the difference between the domination and independent domination numbers of a cubic graph? (Q804588) (← links)
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Cores of simplicial complexes (Q958242) (← links)
- Independent domination in chordal graphs (Q1169487) (← links)
- Dominating sets in perfect graphs (Q1174132) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) (← links)
- Efficient edge domination problems in graphs (Q1313728) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- Domination and irredundance in cubic graphs (Q1356461) (← links)
- Independent domination in finitely defined classes of graphs (Q1399990) (← links)
- On independent \([1, 2]\)-sets in trees (Q1649903) (← links)
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF) (Q1786864) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Unique irredundance, domination and independent domination in graphs (Q2581412) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- The Private Neighbor Concept (Q3384113) (← links)
- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS (Q4820130) (← links)
- Anti-forcing numbers of perfect matchings of graphs (Q5962519) (← links)