Skip to main content
SpringerLink
Log in

Are all polyominoes arbitrarily graceful?

  • Conference paper
  • First Online:
Graph Theory Singapore 1983

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 1073))

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. B. D. Acharya, On d-sequential graphs, J. Math. Phys. Sci., 17(1) (1983), 21–35.

    MathSciNet  MATH  Google Scholar 

  2. B. D. Acharya, Two theorems on d-graceful graphs, Proc. 51st Session, Nat. Acad. Sci. (India), Ser. A(1981), 55.

    Google Scholar 

  3. B. D. Acharya and M. K. Gill, On the index of gracefulness of a graph and the gracefulness of two-dimensional square lattice graphs, Indian J. Math., 23(1981), 81–94.

    MathSciNet  MATH  Google Scholar 

  4. C. Berge, C. C. Chen, V. Chvatal and C. S. Seow, Combinatorial properties of polyominoes, Combinatorica, 1(3) (1981), 217–224.

    Article  MathSciNet  MATH  Google Scholar 

  5. J. C. Bermond, Graceful graphs, radio-antennae and French windmills, ‘One-day Combinatorial Conference', Open University, 1978. pp 18–37.

    Google Scholar 

  6. G. S. Bloom, Numbered graphs and their applications to X-ray crystallography and other science-engineering problems, Ph. D. Thesis, University of California, 1975.

    Google Scholar 

  7. G. S. Bloom, Personal communication.

    Google Scholar 

  8. M. K. Gill, Contributions to some topics in graph theory and its applications, Ph. D. Thesis, Indian Institute of Technology, Bombay, 1982.

    Google Scholar 

  9. S. W. Golomb, How to number a graph, in ‘Graph Theory and Computing’ (ed.: R. C. Read), Academic Press, New York, 1972, 23–27.

    Chapter  Google Scholar 

  10. F. Harary, Graph Theory, Addison-Wesley, Reading, Massachusetts, 1972.

    MATH  Google Scholar 

  11. M. Maheo, Strongly graceful graphs, Discrete Math., 29(1) (1980), 39–46.

    Article  MathSciNet  MATH  Google Scholar 

  12. M. Maheo and H. Thuillier, d-graceful graphs, Ars Comb., 13(1982), 181–192.

    MathSciNet  MATH  Google Scholar 

  13. A. Rosa, On certain valuations of the vertices of a graph, in ‘Theorie des Graphes', Journees Internationales d'etude, Rome (Juillet 1966), Dunod, Paris, 1967, 349–355.

    Google Scholar 

  14. D. A. Sheppard, The factorial representation of balanced labelled graphs, Discrete Math., 15(1976), 379–388.

    Article  MathSciNet  MATH  Google Scholar 

  15. P. J. Slater, On sequential and other numbered graphs, Discrete Math., 34(1981), 185–193.

    Article  MathSciNet  MATH  Google Scholar 

  16. P. J. Slater, On k-graceful countable infinite graphs, Preprint (National University of Singapore), October 1982.

    Google Scholar 

  17. C. Thomassen, Personal communcation.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. C.M.S., M.S.H., E.R. 175 ‘Combinatoire’, 54 Bd. Raspail, 75270, Paris Cedex 06, France

    B. Devadas Acharya

  2. The Mehta Research Institute of Mathematics and Mathematical Physics, 26, Dilkusha, New Katra, 211 002, Allahabad, India

    B. Devadas Acharya

Authors
  1. B. Devadas Acharya
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Khee Meng Koh Hian Poh Yap

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag

About this paper

Cite this paper

Acharya, B.D. (1984). Are all polyominoes arbitrarily graceful?. In: Koh, K.M., Yap, H.P. (eds) Graph Theory Singapore 1983. Lecture Notes in Mathematics, vol 1073. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0073118

Download citation

  • DOI: https://doi.org/10.1007/BFb0073118

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13368-1

  • Online ISBN: 978-3-540-38924-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation