scientific article; zbMATH DE number 3943870

MaRDI QIDQ3715153zbMATH OpenFDO

Authors Andreas Brandstädt, Dieter Kratsch

Publication date 1985

zbMATH Keywords

weighted domination clique problemsweighted feedback vertex set problemweighted independent domination problem on permutation graphs

Mathematics Subject Classification ID

Graph theory (05C99) Graph theory (including graph drawing) in computer science (68R10)

Recommendations

• On domination problems for permutation and other graphs
• Domination in permutation graphs
• A new approach for the domination problem on permutation graphs
• On the domination number of permutation graphs and an application to strong fixed points
• On Domination in Graphs
• Power domination on permutation graphs
• On perfect and quasiperfect dominations in graphs
• On the broadcast domination number of permutation graphs
• Some results on domination in graphs

Cited in

(15)

• Bipartite permutation graphs
• On domination problems for permutation and other graphs
• Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs
• On the feedback vertex set problem in permutation graphs
• Weighted domination of cocomparability graphs
• On the broadcast domination number of permutation graphs
• scientific article; zbMATH DE number 3900817 (Why is no real title available?)
• scientific article; zbMATH DE number 3919840 (Why is no real title available?)
• Domination in permutation graphs
• scientific article; zbMATH DE number 4049081 (Why is no real title available?)
• scientific article; zbMATH DE number 512913 (Why is no real title available?)
• Maximum weightk-independent set problem on permutation graphs
• A new approach for the domination problem on permutation graphs
• Domination in convex and chordal bipartite graphs
• Combinatorial properties of a general domination problem with parity constraints

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3715153)