Decompositions into linear forests and difference labelings of graphs

DOI10.1016/0166-218X(94)90201-1zbMATH Open0811.90107MaRDI QIDQ1327218FDOQ1327218

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)

Cites Work

• Complexity Results for Bandwidth Minimization
• A survey: Recent results, conjectures, and open problems in labeling graphs
• The bandwidth problem for graphs and matrices—a survey
• On the problem of bandsize
• Extremal f-trees and embedding spaces for molecular graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (4)

• BI-MAGIC AND OTHER GENERALIZATIONS OF SUPER EDGE-MAGIC LABELINGS
• Cycles and paths related vertex-equitable graphs
• Difference Labeling and Decomposition
• On \(\lambda\)-fold Rosa-type labelings of bipartite multigraphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1327218)