The tree profile problem and optimal edge labeling.

MaRDI QIDQ3617549zbMATH OpenFDO

Authors V. V. Lepin

Publication date 29 March 2009

Mathematics Subject Classification ID

Computational methods for sparse matrices (65F50) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• The Profile Minimization Problem in Trees
• A tree labeling problem
• Profile minimization problem for matrices and graphs
• Algorithmic aspects of the S-labeling problem
• The \(L(h,1,1)\)-labelling problem for trees

Cited in

(4)

• The Profile Minimization Problem in Trees
• A tree labeling problem
• The profile of the corona G H, where G is a Halin graph, whose tree is a caterpillar
• The profile of the Cartesian product of graphs

This page was built for publication: The tree profile problem and optimal edge labeling.

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