Every snowflake graph is conservative exactly when its edge count is 0 or 3 modulo 4, and large two-nested-cycle graphs admit matching graceful or near-graceful labelings.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2024 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Gracefulness of two nested cycles: a first approach
Every snowflake graph is conservative exactly when its edge count is 0 or 3 modulo 4, and large two-nested-cycle graphs admit matching graceful or near-graceful labelings.