On zero-trees

DOI10.1002/jgt.3190160202zbMath0772.05033OpenAlexW2094893230MaRDI QIDQ4013413

Zoltan Fueredi, 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

spanning treeweighted treezero-trees

Mathematics Subject Classification ID

Trees (05C05)

Related Items (13)

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

This page was built for publication: On zero-trees