On a Häggkvist's Conjecture with the Polynomial Method
From MaRDI portal
Publication:3503519
DOI10.1016/j.endm.2007.07.089zbMath1341.05202WikidataQ123226280 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
graph decomposition; polynomial method; combinatorial Nullstellensatz; bigraceful labeling; Häggkvist's conjecture
05C70: Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.)
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
Related Items
Cites Work