Approximate results for rainbow labelings

DOI10.1007/S10998-016-0151-2zbMath1399.05191OpenAlexW762451895MaRDI QIDQ524169

Mirka Miller, Anna S. Lladó

Publication date: 25 April 2017

Published in: Periodica Mathematica Hungarica (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/2117/112321

zbMATH Keywords

graph labelingpolynomial method

Mathematics Subject Classification ID

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

Related Items (3)

Eulogy for Professor Mirka Miller (1949--2016) ⋮ Caterpillars are antimagic ⋮ Antimagic labelings of caterpillars

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On anti-magic labeling for graph products
• Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
• A new class of antimagic Cartesian product graphs
• The antimagicness of the Cartesian product of graphs
• Lattice grids and prisms are antimagic
• On zero-sum partitions and anti-magic trees
• A dynamic survey of graph labeling
• Additive Latin transversals.
• Integer sets with prescribed pairwise differences being distinct
• Partitions of nonzero elements of a finite field into pairs
• On Antimagic Labeling for Generalized Web and Flower Graphs
• Dense graphs are antimagic
• Regular bipartite graphs are antimagic
• Combinatorial Nullstellensatz
• Anti‐magic graphs via the Combinatorial NullStellenSatz

This page was built for publication: Approximate results for rainbow labelings