Matchings and spanning trees in boolean weighted graphs

DOI10.1016/0095-8956(81)90051-4zbMath0464.05048OpenAlexW1995675925MaRDI QIDQ1153928

Kenneth A. Berman

Publication date: 1981

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(81)90051-4

zbMATH Keywords

matchingsspanning treesBoolean ring

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Ring-theoretic properties of Boolean algebras (06E20)

Cites Work

• Unnamed Item
• The parity of the number of 1-factors of a graph
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH

This page was built for publication: Matchings and spanning trees in boolean weighted graphs