scientific article; zbMATH DE number 3871413
From MaRDI portal
Publication:3338291
Recommendations
Cited in
(9)- On the algorithmic complexity of twelve covering and independence parameters of graphs
- Using maximality and minimality conditions to construct inequality chains
- Some results on graph parameters in weighted graphs
- Matching number, edge covering number and edge dominating number on joined graphs
- Models of domination in graphs
- scientific article; zbMATH DE number 1124594 (Why is no real title available?)
- scientific article; zbMATH DE number 1990679 (Why is no real title available?)
- Upper Clique Transversals in Graphs
- Bibliography on domination in graphs and some basic definitions of domination parameters
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 Q3338291)