On a conjecture of Graham and Häggkvist with the polynomial method

DOI10.1016/j.ejc.2009.03.008zbMath1218.05122OpenAlexW2022351850WikidataQ123230727 ScholiaQ123230727MaRDI QIDQ1039430

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

Publication date: 30 November 2009

Published in: European Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ejc.2009.03.008

zbMATH Keywords

bigraceful labelings

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 (6)

Alon's nullstellensatz for multisets ⋮ Decomposing almost complete graphs by random trees ⋮ Decomposing almost complete graphs by random trees ⋮ Almost Every Tree With m Edges Decomposes K_2m,2m ⋮ Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\) ⋮ Unnamed Item

Cites Work

• Unnamed Item
• A dynamic survey of graph labeling
• Additive Latin transversals.
• \(\rho\)-valuations for some stunted trees
• Edge-decompositions ofK_n,ninto isomorphic copies of a given tree
• Combinatorial Nullstellensatz
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: On a conjecture of Graham and Häggkvist with the polynomial method