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 25 items.
- CONVEXITY OF MINIMAL DOMINATING FUNCTIONS OF TREES: A SURVEY (Q4288047) (← links)
- (Q4443258) (← links)
- EXTREMUM AGGREGATES OF MINIMAL 0-DOMINATING FUNCTIONS OF GRAPHS (Q4886301) (← links)
- Independent domination in directed graphs (Q4957541) (← links)
- Semi-dynamic algorithms for strongly chordal graphs (Q5013507) (← links)
- Semipaired Domination in Some Subclasses of Chordal Graphs (Q5038198) (← 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)
- Dually and strongly chordal graphs (Q5058671) (← links)
- Deferred-query—An efficient approach for problems on interval and circular-arc graphs (Q5060115) (← links)
- Common extremal graphs for three inequalities involving domination parameters (Q5134523) (← links)
- A linear‐time algorithm for broadcast domination in a tree (Q5191137) (← links)
- Broadcast domination and multipacking: bounds and the integrality gap (Q5197586) (← links)
- Weighted Upper Edge Cover: Complexity and Approximability (Q5216282) (← links)
- It Is All Labeling (Q5506785) (← links)
- Strong Chordality of Graphs with Possible Loops (Q5854465) (← links)
- Linear programming approach for various domination parameters (Q5859511) (← links)
- Product throttling for power domination (Q5883635) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- A linear-time algorithm for semitotal domination in strongly chordal graphs (Q6110593) (← links)
- Mobility offer allocations in corporate settings (Q6114908) (← links)
- The algorithmic use of hypertree structure and maximum neighbourhood orderings (Q6184359) (← links)
- Strong Cocomparability Graphs and Slash-Free Orderings of Matrices (Q6202755) (← links)
- Parameterized algorithms for Steiner tree and (connected) dominating set on path graphs (Q6599055) (← links)
- Approximation hardness of domination problems on generalized convex graphs (Q6664063) (← links)
