scientific article; zbMATH DE number 6694457

MaRDI QIDQ2969111zbMATH OpenFDO

Authors Anton Černý, Ludovit Niepel

Publication date 14 March 2017

zbMATH Keywords

dominating setindependent setpath graph

Mathematics Subject Classification ID

Trees (05C05) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Domination, independent domination and \(k\)-independence in trees
• scientific article; zbMATH DE number 2230941
• scientific article; zbMATH DE number 1933231
• Independent and double domination in trees
• Edge domination and 2-independence in trees
• Independent domination on tree convex bipartite graphs
• Independent transversal total domination versus total domination in trees
• Independent (k + 1)-domination in k-trees
• Independence number and \(k\)-trees of graphs
• Independence and k-domination in graphs

Cited in

(10)

• Complexes of directed trees and independence complexes
• Independence number of graphs and line graphs of trees by means of omega invariant
• Complexity of independency and cliquy trees
• Cohabitation of independent sets and dominating sets in trees
• The 0-1 inverse maximum independent set problem on forests and unicyclic graphs
• scientific article; zbMATH DE number 4066936 (Why is no real title available?)
• scientific article; zbMATH DE number 1104337 (Why is no real title available?)
• Edge domination and 2-independence in trees
• Independence number in path graphs
• Maximal independent sets in caterpillar graphs

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 Q2969111)