Matchings in graphs and groups

DOI10.1016/J.DAM.2018.03.051zbMath1394.05102OpenAlexW2795574160MaRDI QIDQ1671337

Vadim E. Levit, Adi Jarden, Robert Shwartz

Publication date: 6 September 2018

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2018.03.051

zbMATH Keywords

stable setindependent setnon-commuting graphKönig-Egerváry

Mathematics Subject Classification ID

Graphs and abstract algebra (groups, rings, fields, etc.) (05C25) 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)

Related Items (2)

MAXIMAL HEREDITARY KÖNIG-EGERVÁRY SET-SYSTEMS ⋮ CRITICAL DUAL SET-SYSTEMS

Cites Work

• A set and collection lemma
• Perfect commuting graphs
• A note on commuting graphs for symmetric groups
• Non-commuting graph of a group.
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Matchings in graphs and groups