On zero-trees
From MaRDI portal
Publication:4013413
DOI10.1002/JGT.3190160202zbMATH Open0772.05033OpenAlexW2094893230MaRDI QIDQ4013413FDOQ4013413
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
Cited In (13)
- On zero-sum and almost zero-sum subgraphs over \(\mathbb Z\)
- A polynomial-time algorithm for finding zero-sums.
- A generalization of Kneser's addition theorem
- A five color zero-sum generalization
- On a zero-sum generalization of a variation of Schur's equation
- Zero-sum problems -- a survey
- Zero-sum copies of spanning forests in zero-sum complete graphs
- An extension of the Erdős-Ginzburg-Ziv theorem to hypergraphs
- Zero-sum \(K_m\) over \(\mathbb{Z}\) and the story of \(K_4\)
- Zero-sum subsequences in Abelian non-cyclic groups
- On zero-sum spanning trees and zero-sum connectivity
- On four colored sets with nondecreasing diameter and the Erdős-Ginzburg-Ziv theorem
- On zero sum Ramsey numbers: Multiple copies of a graph
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)
