Set-sequential labelings of odd trees

DOI10.7151/DMGT.2439MaRDI QIDQ6985945zbMATH OpenFDO

Authors Emily N. Eckels, Ervin Győri, Junsheng Liu, Sohaib Nasir

Publication date 12 May 2025

Published in Discussiones Mathematicae. Graph Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.7151/DMGT.2439

zbMATH Keywords

treescaterpillarscoloring graphs by sets

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)

Cites work

• A note on ternary sequences of strings of 0 and 1
• Coloring vertices and edges of a graph by nonempty subsets of a set
• New classes of set-sequential trees
• Set colorings of graphs
• Set sequential graphs
• Set-valued graphs
• Set-valued graphs. II

This page was built for publication: Set-sequential labelings of odd trees

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