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

On a labeling problem in graphs

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

DOI10.1016/j.dam.2010.12.022zbMath1223.05259OpenAlexW2004981790MaRDI QIDQ534336

Yong-Cai Geng, Sumit K. Garg

Publication date: 17 May 2011

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.dam.2010.12.022


zbMATH Keywords

complexitygraph algorithmssoftware programming


Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85) Theory of software (68N99)




Cites Work

  • Packing and covering a tree by subtrees
  • A Linear Tree Partitioning Algorithm
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item
  • Unnamed Item


This page was built for publication: On a labeling problem in graphs

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