Pages that link to "Item:Q788002"
From MaRDI portal
The following pages link to Domination, independent domination, and duality in strongly chordal graphs (Q788002):
Displaying 50 items.
- The bondage and reinforcement numbers of \(\gamma_ f\) for some graphs (Q1356465) (← links)
- \(r\)-dominating cliques in graphs with hypertree structure (Q1356657) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Transversal partitioning in balanced hypergraphs (Q1372732) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q1383368) (← links)
- The bottleneck independent domination on the classes of bipartite graphs and block graphs. (Q1429835) (← links)
- The domatic number of block-cactus graphs (Q1584305) (← links)
- A characterization of strongly chordal graphs (Q1584312) (← links)
- The weakly connected independent set polytope in corona and join of graphs (Q1631656) (← links)
- On total \(f\)-domination: polyhedral and algorithmic results (Q1732100) (← links)
- Mutual transferability for \((F, B, R)\)-domination on strongly chordal graphs and cactus graphs (Q1735675) (← links)
- On complexities of minus domination (Q1751171) (← links)
- The minimum weakly connected independent set problem: polyhedral results and branch-and-cut (Q1751176) (← links)
- On the \(k\)-limited packing numbers in graphs (Q1751194) (← links)
- Complexity of distance paired-domination problem in graphs (Q1758170) (← links)
- The multiple domination and limited packing problems in graphs (Q1944215) (← links)
- On bondage numbers of graphs: a survey with some comments (Q1953664) (← links)
- Domination and total domination on asteroidal triple-free graphs (Q1962038) (← links)
- Strongly orderable graphs. A common generalization of strongly chordal and chordal bipartite graphs (Q1962062) (← links)
- Algorithmic aspects of clique-transversal and clique-independent sets (Q1971220) (← links)
- Paired-domination problem on distance-hereditary graphs (Q2006943) (← links)
- Decision and approximation complexity for identifying codes and locating-dominating sets in restricted graph classes (Q2018540) (← links)
- Extension and its price for the connected vertex cover problem (Q2072064) (← links)
- Efficient \((j, k)\)-dominating functions (Q2107745) (← links)
- Algorithms for generating strongly chordal graphs (Q2233439) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Fractional domination game (Q2327216) (← links)
- Packing and domination parameters in digraphs (Q2328107) (← links)
- On the independent dominating set polytope (Q2368719) (← links)
- Broadcast domination and multipacking in strongly chordal graphs (Q2414458) (← links)
- On the dominating set polytope (Q2426444) (← links)
- On defensive alliances and strong global offensive alliances (Q2434727) (← links)
- Strongly simplicial vertices of powers of trees (Q2455590) (← links)
- Polar SAT and related graphs (Q2466002) (← links)
- Shiftable intervals (Q2480206) (← links)
- The topology of the independence complex (Q2493109) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- On dominating set polyhedra of circular interval graphs (Q2659194) (← links)
- Graphs with unique dominating sets (Q2816086) (← links)
- Polynomial reductions between the Limited Packing and Tuple Domination problems in graphs (Q2840710) (← links)
- On Complexities of Minus Domination (Q2867118) (← links)
- The k-limited packing and k-tuple domination problems in strongly chordal, P4-tidy and split graphs (Q2883613) (← links)
- EQUITABLE DOMINATION IN GRAPHS (Q2890988) (← links)
- Broadcast Domination in Graphs (Q3384108) (← links)
- Fractional Dominating Parameters (Q3384613) (← links)
- Roman Domination in Graphs (Q3384614) (← links)
- Independent Domination in Triangle Graphs (Q3439603) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- A tight relation between series-parallel graphs and bipartite distance hereditary graphs (Q5045248) (← links)
- Sequential and parallel algorithms on compactly represented chordal and strongly chordal graphs (Q5048948) (← links)
