Pages that link to "Item:Q788002"

The following pages link to Domination, independent domination, and duality in strongly chordal graphs (Q788002):

Displayed 50 items.

• Which claw-free graphs are perfectly orderable? (Q686245) ‎ (← links)
• A linear algorithm for the group path problem on chordal graphs (Q686257) ‎ (← links)
• On the computational complexity of upper fractional domination (Q753848) ‎ (← links)
• Bibliography on domination in graphs and some basic definitions of domination parameters (Q810066) ‎ (← links)
• Independent domination in hereditary classes (Q818132) ‎ (← links)
• Domination in convex and chordal bipartite graphs (Q918703) ‎ (← links)
• On \(P_4\)-transversals of chordal graphs (Q998435) ‎ (← links)
• On the parameterized complexity of multiple-interval graph problems (Q1001898) ‎ (← links)
• Characterizations of strongly chordal graphs (Q1051004) ‎ (← links)
• Location problems (Q1062596) ‎ (← links)
• Dominating sets and domatic number of circular arc graphs (Q1066921) ‎ (← links)
• A linear algorithm for finding a minimum dominating set in a cactus (Q1078205) ‎ (← links)
• Forbidden submatrices (Q1103620) ‎ (← links)
• Totally balanced and totally unimodular matrices defined by center location problems (Q1104945) ‎ (← links)
• A unified approach to domination problems on interval graphs (Q1111566) ‎ (← links)
• Labeling algorithms for domination problems in sun-free chordal graphs (Q1117254) ‎ (← links)
• Total domination in block graphs (Q1124531) ‎ (← links)
• Generalized domination and efficient domination in graphs (Q1126173) ‎ (← links)
• Independent domination in chordal graphs (Q1169487) ‎ (← links)
• Dominating sets in perfect graphs (Q1174132) ‎ (← links)
• Permutation graphs: Connected domination and Steiner trees (Q1174135) ‎ (← links)
• An optimal algorithm for finding dominating cycles in circular-arc graphs (Q1186160) ‎ (← links)
• A simple linear time algorithm for the domatic partition problem on strongly chordal graphs (Q1195488) ‎ (← links)
• An optimal parallel algorithm for the domatic partition problem on an interval graph given its sorted model (Q1195857) ‎ (← links)
• Strong elimination ordering of the total graph of a tree (Q1201815) ‎ (← links)
• Linear algorithm for domatic number problem on interval graphs (Q1262139) ‎ (← links)
• Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) ‎ (← links)
• Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithms (Q1283779) ‎ (← links)
• On the algorithmic complexity of twelve covering and independence parameters of graphs (Q1283793) ‎ (← links)
• Construction of a simple elimination scheme for a chordal comparability graph in linear time (Q1283807) ‎ (← links)
• Recognizing clique graphs of directed and rooted path graphs (Q1293208) ‎ (← links)
• Real and integer domination in graphs (Q1297432) ‎ (← links)
• The domatic number problem on some perfect graph families (Q1313715) ‎ (← links)
• Dominating cliques in chordal graphs (Q1322189) ‎ (← links)
• The domatic number problem (Q1322260) ‎ (← links)
• Fractional domination of strong direct products (Q1324692) ‎ (← links)
• A parallel algorithm for computing Steiner trees in strongly chordal graphs (Q1329803) ‎ (← links)
• The parallel solution of domination problems on chordal and strongly chordal graphs (Q1331893) ‎ (← links)
• Characterizations of two classes of digraphs (Q1336693) ‎ (← links)
• 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)
• 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)