Pages that link to "Item:Q794174"

The following pages link to Dominating sets for split and bipartite graphs (Q794174):

Displayed 50 items.

• Computing role assignments of split graphs (Q287443) ‎ (← links)
• \((1, j)\)-set problem in graphs (Q294556) ‎ (← links)
• A complexity dichotomy and a new boundary class for the dominating set problem (Q328713) ‎ (← links)
• Graphs with maximal induced matchings of the same size (Q344824) ‎ (← links)
• A decidability result for the dominating set problem (Q410736) ‎ (← links)
• On graphs for which the connected domination number is at most the total domination number (Q423952) ‎ (← links)
• Independent dominating set problem revisited (Q476836) ‎ (← links)
• On the complexity of the minimum domination problem restricted by forbidden induced subgraphs of small size (Q499360) ‎ (← links)
• Restricted optimal pebbling and domination in graphs (Q512538) ‎ (← links)
• The complexity of dominating set reconfiguration (Q517018) ‎ (← links)
• The algorithmic complexity of mixed domination in graphs (Q533883) ‎ (← links)
• Maximal cliques in \(\{P_{2} \cup P_{3},C_{4}\}\)-free graphs (Q712269) ‎ (← links)
• Algorithmic aspects of \(b\)-disjunctive domination in graphs (Q721940) ‎ (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) ‎ (← links)
• Satgraphs and independent domination. I (Q818113) ‎ (← links)
• Independent domination in hereditary classes (Q818132) ‎ (← links)
• The neighborhood polynomial of chordal graphs (Q832856) ‎ (← links)
• The weighted perfect domination problem (Q912630) ‎ (← links)
• Variations of \(Y\)-dominating functions on graphs (Q941347) ‎ (← links)
• Dominating sets in perfect graphs (Q1174132) ‎ (← links)
• Representations of graphs and networks (coding, layouts and embeddings) (Q1174904) ‎ (← links)
• On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) ‎ (← links)
• The geodetic number of a graph (Q1310238) ‎ (← links)
• One-node cutsets and the dominating set polytope (Q1356733) ‎ (← links)
• Domination in some subclasses of bipartite graphs (Q1630774) ‎ (← links)
• And/or-convexity: a graph convexity based on processes and deadlock models (Q1639288) ‎ (← links)
• Algorithm complexity of neighborhood total domination and \((\rho,\gamma_{\mathrm{nt}})\)-graphs (Q1702824) ‎ (← links)
• The complexity of secure domination problem in graphs (Q1708386) ‎ (← links)
• On the geodetic number of complementary prisms (Q1721934) ‎ (← links)
• Vertex deletion problems on chordal graphs (Q1786595) ‎ (← links)
• Secure total domination in graphs: bounds and complexity (Q1786876) ‎ (← links)
• Right angle free subsets in the plane (Q1895818) ‎ (← links)
• Algorithmic aspects of the generalized clique-transversal problem on chordal graphs (Q1917287) ‎ (← 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)
• Dominating sets reconfiguration under token sliding (Q2032965) ‎ (← links)
• Algorithmic aspects of secure connected domination in graphs (Q2042631) ‎ (← links)
• Coloring a dominating set without conflicts: \(q\)-subset square coloring (Q2097209) ‎ (← links)
• Well-partitioned chordal graphs (Q2144581) ‎ (← links)
• Reducing the domination number of graphs via edge contractions and vertex deletions (Q2219962) ‎ (← links)
• The numerical invariants concerning the total domination for generalized Petersen graphs (Q2221869) ‎ (← links)
• Structural domination and coloring of some \(( P_7 , C_7)\)-free graphs (Q2222949) ‎ (← links)
• The complexity of the defensive domination problem in special graph classes (Q2279988) ‎ (← links)
• Vector domination in split-indifference graphs (Q2281167) ‎ (← links)
• Layered graphs: applications and algorithms (Q2287476) ‎ (← links)
• Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width (Q2304548) ‎ (← links)
• Bounds on the bend number of split and cocomparability graphs (Q2322713) ‎ (← links)
• On the complexity of \(\{k\}\)-domination and \(k\)-tuple domination in graphs (Q2345849) ‎ (← links)
• Approximation algorithms for clique transversals on some graph classes (Q2346555) ‎ (← links)
• On secure domination in graphs (Q2348710) ‎ (← links)