Approximate results for rainbow labelings
type: Item
instance of: scholarly article
title: Approximate results for rainbow labelings
zbMATH Open document ID: 1399.05191
author: Mirka Miller
author: Anna Lladó
published in: Periodica Mathematica Hungarica
publication date: 2017-04-25T00:00:00Z
full work available at URL: http://hdl.handle.net/2117/112321
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 6707850
zbMATH Keywords: graph labeling
zbMATH Keywords: polynomial method
MaRDI profile type: Publication
OpenAlex ID: W762451895
cites work: Combinatorial Nullstellensatz
cites work: Additive Latin transversals.
cites work: Dense graphs are antimagic
cites work: Integer sets with prescribed pairwise differences being distinct
cites work: Q4407942
cites work: Lattice grids and prisms are antimagic
cites work: A new class of antimagic Cartesian product graphs
cites work: Regular bipartite graphs are antimagic
cites work: A dynamic survey of graph labeling
cites work: Q4324745
cites work: Anti‐magic graphs via the Combinatorial NullStellenSatz
cites work: On zero-sum partitions and anti-magic trees
cites work: Partitions of nonzero elements of a finite field into pairs
cites work: Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)
cites work: Q4432951
cites work: On Antimagic Labeling for Generalized Web and Flower Graphs
cites work: On anti-magic labeling for graph products
cites work: The antimagicness of the Cartesian product of graphs
DOI: 10.1007/S10998-016-0151-2
description: scientific article; zbMATH DE number 6707850