scientific article

zbMATH Open1389.05128MaRDI QIDQ2969111

Anton Černý, Ludovit Niepel

Publication date: 14 March 2017

Title of this publication is not available (Why is that?)

zbMATH Keywords

independent setpath graphdominating set

Mathematics Subject Classification ID

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

Related Items (3)

Independence number of graphs and line graphs of trees by means of omega invariant ⋮ Complexes of directed trees and independence complexes ⋮ Edge domination and 2-independence in trees

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Independent \((k + 1)\)-domination in \(k\)-trees 👍 👎
• Independence number and \(k\)-trees of graphs 👍 👎
• Domination, independent domination and \(k\)-independence in trees 👍 👎
• Independent transversal total domination versus total domination in trees 👍 👎
• Independent Domination on Tree Convex Bipartite Graphs 👍 👎
• Independence andk-domination in graphs 👍 👎
• Edge domination and 2-independence in trees 👍 👎

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)