Decompositions into linear forests and difference labelings of graphs

DOI10.1016/0166-218X(94)90201-1zbMath0811.90107MaRDI QIDQ1327218

Sergio Ruiz, Gary S. Bloom

Publication date: 1 May 1995

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

zbMATH Keywords

labeled graphcommon-weight decomposition

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Related Items (3)

On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs ⋮ Difference Labeling and Decomposition ⋮ BI-MAGIC AND OTHER GENERALIZATIONS OF SUPER EDGE-MAGIC LABELINGS

Cites Work

• On the problem of bandsize
• Extremal f-trees and embedding spaces for molecular graphs
• The bandwidth problem for graphs and matrices—a survey
• Complexity Results for Bandwidth Minimization
• A survey: Recent results, conjectures, and open problems in labeling graphs
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Decompositions into linear forests and difference labelings of graphs