-valuations for some stunted trees

DOI10.1016/J.DISC.2006.05.026zbMATH Open1103.05072OpenAlexW2010363941MaRDI QIDQ2433736FDOQ2433736

Authors André E. Kézdy 

Publication date 30 October 2006

Published in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.disc.2006.05.026

zbMATH Keywords

combinatorial Nullstellensatz

Mathematics Subject Classification ID

Trees (05C05) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• New attack on Kotzig's conjecture
• On \(\rho\)-labeling up to ten vertex disjoint \(C_{4x+1}\)
• scientific article; zbMATH DE number 5954411
• scientific article; zbMATH DE number 3891392
• Decomposition of complete graphs and complete bipartite graphs into \(\alpha \)-labelled trees

Cites Work

• scientific article; zbMATH DE number 3815667 (Why is no real title available?)
• scientific article; zbMATH DE number 3435497 (Why is no real title available?)
• scientific article; zbMATH DE number 3308125 (Why is no real title available?)
• Combinatorial Nullstellensatz

Cited In (9)

• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• On a conjecture of Graham and Häggkvist with the polynomial method
• Punctured combinatorial Nullstellensätze
• Decomposing almost complete graphs by random trees
• Almost every tree with \(m\) edges decomposes \(K_{2m,2m}\)
• Decomposing almost complete graphs by random trees
• New attack on Kotzig's conjecture
• Almost every tree with \(n\) edges decomposes \(K_{2n,2n}\)
• Rigidity of valuative trees under Henselization

This page was built for publication: \(\rho\)-valuations for some stunted trees

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