Smallest maximal matchings in the graph of the d-dimensional cube
From MaRDI portal
Publication:2560426
DOI10.1016/0095-8956(73)90059-2zbMath0261.05123OpenAlexW2038742408MaRDI QIDQ2560426
Publication date: 1973
Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/0095-8956(73)90059-2
Related Items
Edge Domination in Graphs of Cubes, A survey of the theory of hypercube graphs, Maximal matching and edge domination in complete multipartite graphs, Unnamed Item, Towards a problem of Ruskey and Savage on matching extendability, Irreducible subcube partitions, 2-(edge-)connected edge domination number and matching number
Cites Work