scientific article; zbMATH DE number 3648727
From MaRDI portal
Publication:3206969
Cited in
(24)- THE PARALLEL ALGORITHMS FOR DETERMINING EDGE-PACKING AND EFFICIENT EDGE DOMINATING SETS IN INTERVAL GRAPHS
- The private neighbor concept
- A recurrence template for several parameters in series-parallel graphs
- On minimum dominating sets with minimum intersection
- On independent \([1, 2]\)-sets in trees
- Cores of simplicial complexes
- On the independent dominating set polytope
- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Upper Clique Transversals in Graphs
- Domination, independent domination, and duality in strongly chordal graphs
- Dominating sets in perfect graphs
- Unique irredundance, domination and independent domination in graphs
- Efficient edge domination problems in graphs
- On approximating the minimum independent dominating set
- What is the difference between the domination and independent domination numbers of a cubic graph?
- A Survey of the Game “Lights Out!”
- Independent domination in finitely defined classes of graphs
- A note on an induced subgraph characterization of domination perfect graphs
- An analysis of root functions -- a subclass of the impossible class of faulty functions (ICFF)
- Paired-domination problem on distance-hereditary graphs
- Domination and irredundance in cubic graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
- Independent domination in chordal graphs
- Anti-forcing numbers of perfect matchings of graphs
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3206969)
