scientific article; zbMATH DE number 7302453

zbMath1453.05114MaRDI QIDQ5147550

Katarína Kotul'Ová, Miroslav Haviar

Publication date: 27 January 2021

Full work available at URL: https://actamath.savbb.sk/acta2803.shtml

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

simple graphgraceful labellinggraph chessboardlabelling relationlabelling sequence

Mathematics Subject Classification ID

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

Related Items (1)

Unnamed Item

Cites Work

• New classes of graceful unicyclic graphs
• Graceful and cordial labeling of subdivision of graphs
• Generating graceful trees from caterpillars by recursive attachment
• Gracefulness of families of spiders
• On graceful spider graphs with at most four legs of lengths greater than one
• Some graceful lobsters with all three types of branches incident on the vertices of the central path
• The factorial representation of balanced labelled graphs
• Embedding rainbow trees with applications to graph labelling and decomposition
• Optimal packings of bounded degree trees
• All uniform bow graphs are graceful
• On the corona of two graphs
• A Dirac-Type Theorem for 3-Uniform Hypergraphs
• Cycles with a chord are graceful
• On certain classes of graceful lobsters
• On Graceful Labeling of the Generalization of Cyclic Snakes
• A class of diameter six trees exhibiting graceful labeling
• Almost all trees are almost graceful
• Lobsters with an almost perfect matching are graceful
• All trees of diameter five are graceful
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: