Matchings and spanning trees in boolean weighted graphs

DOI10.1016/0095-8956(81)90051-4MaRDI QIDQ1153928zbMATH OpenOpenAlexFDO

Authors 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

Boolean ringmatchingsspanning trees

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

• A NOTE ON THE ENUMERATION AND LISTING OF ALL POSSIBLE TREES IN A CONNECTED LINEAR GRAPH
• scientific article; zbMATH DE number 3363588 (Why is no real title available?)
• Matrix Generalizations of Some Theorems on Trees, Cycles and Cocycles in Graphs
• The parity of the number of 1-factors of a graph

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1153928)