Unmixed r-partite graphs

zbMath1405.05149arXiv1511.00228MaRDI QIDQ4613761

Rashid Jafarpour-Golzari, Reza Zaare-Nahandi

Publication date: 25 January 2019

Full work available at URL: https://arxiv.org/abs/1511.00228

zbMATH Keywords

cliqueperfect matchingwell-coveredunmixed\(r\)-partite graph

Mathematics Subject Classification ID

Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Structural characterization of families of graphs (05C75) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69)

Related Items

On the (parameterized) complexity of recognizing well-covered (\(r\),\(\ell\))-graph, Partitions and well-coveredness: the graph sandwich problem