Mathematical Research Data Initiative
Main page
Recent changes
Random page
Help about MediaWiki
Create a new Item
Create a new Property
Merge two items
In other projects
Discussion
View source
View history
Purge
English
Log in

Graceful labelings of nearly complete graphs

From MaRDI portal
Publication:1601392
Jump to:navigation, search

DOI10.1007/BF03322754zbMath0993.05126MaRDI QIDQ1601392

Detlev Beutner, Heiko Harborth

Publication date: 3 September 2002

Published in: Results in Mathematics (Search for Journal in Brave)


zbMATH Keywords

graph labellingcomplete multipartite graphsgraceful graphs


Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)


Related Items (3)

The gracefulness of the join of graphs ⋮ On graceful antimagic graphs ⋮ Constraint models for graceful graphs




Cites Work

  • Unnamed Item
  • Unnamed Item
  • Strongly graceful graphs
  • On the Representation of 1, 2, …, n by Differences
  • The Largest Graceful Subgraph of the Complete Graph




This page was built for publication: Graceful labelings of nearly complete graphs

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Publication:1601392&oldid=13901116"
Tools
What links here
Related changes
Special pages
Printable version
Permanent link
Page information
MaRDI portal item
This page was last edited on 1 February 2024, at 02:44.
Privacy policy
About MaRDI portal
Disclaimers
Imprint
Powered by MediaWiki