On zero-trees

DOI10.1002/JGT.3190160202MaRDI QIDQ4013413zbMATH OpenOpenAlexFDO

Authors Zoltán Füredi, Daniel J. Kleitman

Publication date 27 September 1992

Published in Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1002/jgt.3190160202

zbMATH Keywords

weighted treespanning treezero-trees

Mathematics Subject Classification ID

Trees (05C05)

Recommendations

• A simpler proof and a generalization of the zero-trees theorem
• Publication:3470501
• scientific article; zbMATH DE number 4214018
• scientific article; zbMATH DE number 822737
• On zero-sum spanning trees and zero-sum connectivity

Cited in

(13)

• Zero-sum copies of spanning forests in zero-sum complete graphs
• On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
• A generalization of Kneser's addition theorem
• An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
• On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
• A five color zero-sum generalization
• On a zero-sum generalization of a variation of Schur's equation
• On zero-sum spanning trees and zero-sum connectivity
• Zero-sum problems -- a survey
• Zero-sum subsequences in Abelian non-cyclic groups
• On zero sum Ramsey numbers: Multiple copies of a graph
• A polynomial-time algorithm for finding zero-sums.
• Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)

This page was built for publication: On zero-trees

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