scientific article; zbMATH DE number 5178701

MaRDI QIDQ3595113zbMATH OpenFDO

Authors Kourosh Eshghi, Parham Azimi

Publication date 10 August 2007

zbMATH Keywords

graceful labelingedge-magic total labeling

Mathematics Subject Classification ID

Integer programming (90C10) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• A novel labeling algorithm on several classes of graphs
• On a labeling problem in graphs
• A labeling algorithm to solve the assignment problem
• A result on graph labelling
• An efficient algorithm to solve \(L(0,1)\)-labelling problem on interval graphs
• Algorithmic expedients for the \(S\)-labeling problem
• Graph labelings and complexity problems: a review
• Exact algorithms for \(L(2,1)\)-labeling of graphs
• Exact Algorithms for L(2,1)-Labeling of Graphs
• A study of graph labeling on a class of graphs

Cited in

(8)

• scientific article; zbMATH DE number 222693 (Why is no real title available?)
• An exact algorithm for the edge coloring by total labeling problem
• SAT and IP based algorithms for magic labeling with applications
• scientific article; zbMATH DE number 7564191 (Why is no real title available?)
• Parallel Processing and Applied Mathematics
• An application of mathematical programming in vertex-magic total labeling problems
• A general label search to investigate classical graph search algorithms
• Applications of mathematical programming in graceful labeling of graphs

This page was built for publication:

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