Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs
From MaRDI portal
Publication:6361886
DOI10.1016/J.AMC.2022.127107zbMath1510.05237arXiv2103.01402WikidataQ114210900 ScholiaQ114210900MaRDI QIDQ6361886
Jun-feng Du, Yu-Xin Li, Jian-hua Tu
Publication date: 1 March 2021
Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)
This page was built for publication: Maximal and Maximum Dissociation Sets in General and Triangle-Free Graphs