Maximum gap labelings of graphs

DOI10.1016/j.ipl.2010.11.010zbMath1259.05146OpenAlexW2068973955MaRDI QIDQ1944065

Tomás Feder, Carlos Subi

Publication date: 4 April 2013

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2010.11.010

zbMATH Keywords

approximation algorithmsgraceful labelling of treesmaximum gap in graphminimum edge deletion bipartition

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Graph theory (including graph drawing) in computer science (68R10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (1)

Not-all-equal and 1-in-degree decompositions: algorithmic complexity and applications

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Maximum gap labelings of graphs