Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
type: Item
instance of: scholarly article
title: Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
zbMATH Open document ID: 1208.05013
published in: Discrete Mathematics
publication date: 2010-04-27T00:00:00Z
Mathematics Subject Classification ID: 05C05
Mathematics Subject Classification ID: 05C70
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 5701939
zbMATH Keywords: graph labelings
zbMATH Keywords: graph decompositions
zbMATH Keywords: combinatorial nullstellensatz
author: Anna Lladó
author: S. C. López
author: Jordi Moragas
MaRDI profile type: Publication
full work available at URL: j.disc.2009.09.021
OpenAlex ID: W2091970724
cites work: Combinatorial Nullstellensatz
cites work: Additive Latin transversals.
cites work: Relaxed graceful labellings of trees
cites work: On a conjecture of Graham and Häggkvist with the polynomial method
cites work: A dynamic survey of graph labeling
cites work: Q3480087
cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz
cites work: \(\rho\)-valuations for some stunted trees
cites work: Distinct Sums Modulo n and Tree Embeddings
cites work: Q4401957
cites work: Edge-decompositions ofKn,ninto isomorphic copies of a given tree
cites work: Q5589124
DOI: 10.1016/J.DISC.2009.09.021
description: scientific article; zbMATH DE number 5701939