On a Häggkvist's Conjecture with the Polynomial Method

DOI10.1016/j.endm.2007.07.089zbMath1341.05202OpenAlexW2086470176WikidataQ123226280 ScholiaQ123226280MaRDI QIDQ3503519

M. Cámara, Jordi Moragas, Anna S. Lladó

Publication date: 5 June 2008

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2007.07.089

zbMATH Keywords

graph decompositionpolynomial methodcombinatorial Nullstellensatzbigraceful labelingHäggkvist's conjecture

Mathematics Subject Classification ID

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

Related Items (1)

Punctured combinatorial Nullstellensätze

Cites Work

• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• Combinatorial Nullstellensatz
• Unnamed Item

This page was built for publication: On a Häggkvist's Conjecture with the Polynomial Method