Pages that link to "Item:Q1837213"
From MaRDI portal
The following pages link to A linear algorithm for the domination number of a series-parallel graph (Q1837213):
Displaying 31 items.
- Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) (← links)
- Dominating sets and domatic number of circular arc graphs (Q1066921) (← links)
- A compact labelling scheme for series-parallel graphs (Q1079115) (← links)
- Minimum-maximal matching in series-parallel graphs (Q1099085) (← links)
- Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) (← links)
- Total domination in block graphs (Q1124531) (← links)
- Permutation graphs: Connected domination and Steiner trees (Q1174135) (← links)
- On minimum dominating sets with minimum intersection (Q1174139) (← links)
- Deciding whether graph \(G\) has page number one is in NC (Q1195855) (← links)
- Parallel recognition of series-parallel graphs (Q1201288) (← links)
- A linear time algorithm to solve the weighted perfect domination problem in series-parallel graphs (Q1328622) (← links)
- A recurrence template for several parameters in series-parallel graphs (Q1336624) (← links)
- One-node cutsets and the dominating set polytope (Q1356733) (← links)
- Perfect edge domination and efficient edge domination in graphs (Q1613347) (← links)
- Perfect Italian domination in graphs: complexity and algorithms (Q2161253) (← links)
- A polynomial-time approximation to a minimum dominating set in a graph (Q2166772) (← links)
- On \(f\)-domination: polyhedral and algorithmic results (Q2274147) (← links)
- Perfect Roman domination in graphs (Q2333784) (← links)
- On the dominating set polytope (Q2426444) (← links)
- Some advances on the set covering polyhedron of circulant matrices (Q2636828) (← links)
- A Survey of the Game “Lights Out!” (Q2848975) (← links)
- On the \(k\)-dominating set polytope of web graphs (Q2861547) (← links)
- Minimum Linear Arrangement of Series-Parallel Graphs (Q3453293) (← links)
- A Dynamic Programming Approach to the Dominating Set Problem on <i>k</i>-Trees (Q3773922) (← links)
- MAXIMUM INDEPENDENT, MINIMALLY REDUNDANT SETS IN SERIES-PARALLEL GRAPHS (Q4288050) (← links)
- Conflict-Free Coloring of Graphs (Q4556952) (← links)
- Counting dominating sets in generalized series-parallel graphs (Q5207508) (← links)
- (Q5376962) (← links)
- Total domination in interval graphs (Q5903156) (← links)
- Minimum <scp>color‐degree</scp> perfect <i>b</i>‐matchings (Q6087129) (← links)
- The price of anarchy in series-parallel network congestion games (Q6120906) (← links)