Approximate results for rainbow labelings (Q524169)

From MaRDI portal

Jump to:navigation, search

scientific article

Language	Label	Description	Also known as
English	Approximate results for rainbow labelings	scientific article

Statements

scholarly article

0 references

Approximate results for rainbow labelings (English)

0 references

0 references

0 references

Periodica Mathematica Hungarica

0 references

publication date

25 April 2017

0 references

full work available at URL

http://hdl.handle.net/2117/112321

0 references

zbMATH Keywords

graph labeling

0 references

polynomial method

0 references

MaRDI profile type

MaRDI publication profile

0 references

Combinatorial Nullstellensatz

0 references

Additive Latin transversals.

0 references

Dense graphs are antimagic

0 references

Integer sets with prescribed pairwise differences being distinct

0 references

0 references

Lattice grids and prisms are antimagic

0 references

A new class of antimagic Cartesian product graphs

0 references

Regular bipartite graphs are antimagic

0 references

A dynamic survey of graph labeling

0 references

0 references

Anti‐magic graphs via the Combinatorial NullStellenSatz

0 references

On zero-sum partitions and anti-magic trees

0 references

Partitions of nonzero elements of a finite field into pairs

0 references

Every tree is a large subtree of a tree that decomposes \(K_n\) or \(K_{n,n}\)

0 references

0 references

On Antimagic Labeling for Generalized Web and Flower Graphs

0 references

On anti-magic labeling for graph products

0 references

The antimagicness of the Cartesian product of graphs

0 references

Identifiers

zbMATH Open document ID

0 references

Mathematics Subject Classification ID

0 references

zbMATH DE Number

0 references

0 references

10.1007/S10998-016-0151-2

0 references

Sitelinks

Mathematics(1 entry)

mardi Publication:524169

Retrieved from "https://portal.mardi4nfdi.de/w/index.php?title=Item:Q524169&oldid=38387463"