scientific article; zbMATH DE number 1439432

MaRDI QIDQ4949809zbMATH OpenFDO

Authors Gwong C. Sun, Yung-Nien Yang, Yueh-Hsiang Liao

Publication date 2 July 2001

zbMATH Keywords

NP-completemagic graphlabeling algorithmHamilton circuit

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• scientific article; zbMATH DE number 1156651
• Publication:4862899
• scientific article; zbMATH DE number 5711450
• scientific article; zbMATH DE number 6685481
• Magic labelings of graphs
• Edge-magic total labelling of bicyclic graphs
• The super edge-magic labeling and an algorithm of a class of graphs
• scientific article; zbMATH DE number 7339040
• Computing edge weights of magic labeling on rooted products of graphs
• scientific article; zbMATH DE number 125627

Cited in

(2)

• scientific article; zbMATH DE number 5711450 (Why is no real title available?)
• Enhancement of an algorithm for finding a Hamiltonian cycle

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 Q4949809)