scientific article; zbMATH DE number 5920059

MaRDI QIDQ3015985zbMATH OpenFDO

Authors Wei Feng, Chunlei Xu, Jirimutu

Publication date 13 July 2011

Full work available at URL http://ijpam.eu/contents/2011-69-3/2/index.html

zbMATH Keywords

conjecturedigraphdirected circuitgraceful graphgraceful labeling

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to combinatorics (05-02) Directed graphs (digraphs), tournaments (05C20) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Recommendations

• Further results on graceful digraphs
• On the gracefulness of the digraphs \(n-\vec C_m\)
• On the gracefulness of the digraphs n- C_m
• On the gracefulness of the digraphs \(n-\vec{C}_{m}\)
• Graceful labeling of digraphs -- a survey
• On the gracefulness of the digraphs \(n-\vec {C}_{m}\).
• On \(k\)-graceful digraphs
• scientific article; zbMATH DE number 2247217
• scientific article; zbMATH DE number 6712558
• Proof of a conjecture on the gracefulness of a digraph

Cited in

(4)

• On the Readability of Overlap Digraphs
• The surviving rate of digraphs
• Computer search for graceful labeling: a survey
• On gracefulness of directed trees with short diameters

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