Some disgraceful graphs

DOI10.1080/0020739930240314zbMATH Open0796.05082OpenAlexW2318357332WikidataQ126249975 ScholiaQ126249975MaRDI QIDQ4281817FDOQ4281817

Robin Wilson, M. A. Seoud

Publication date: 20 September 1994

Published in: International Journal of Mathematical Education in Science and Technology (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1080/0020739930240314

Recommendations

• The graceful labeling of two classes of disjoint union graphs
• The graceful graphs on several kinds of union graphs
• scientific article; zbMATH DE number 1792599
• Researches on gracefulness of graphs \((P^{(1)}_1\vee P_n)\cup (P^{(2)}_1\vee P_{2n})\) and \((P_2\vee \overline{K}_n)\cup G_{n-1}\)

zbMATH Keywords

labeldisgraceful graphs

Mathematics Subject Classification ID

Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites Work

• The Largest Graceful Subgraph of the Complete Graph

Cited In (1)

• Most unbreakable murky graphs are bull-free

This page was built for publication: Some disgraceful graphs

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