An improved upper bound on edge weight choosability of graphs
type: Item
instance of: scholarly article
title: An improved upper bound on edge weight choosability of graphs
zbMATH Open document ID: 1326.05051
published in: Graphs and Combinatorics
publication date: 2015-09-24T00:00:00Z
Mathematics Subject Classification ID: 05C15
Mathematics Subject Classification ID: 05C22
Mathematics Subject Classification ID: 05C78
zbMATH DE Number: 6484845
zbMATH Keywords: 1-2-3 conjecture
zbMATH Keywords: edge weight choosability
author: Guanghui Wang
author: Guiying Yan
MaRDI profile type: Publication
full work available at URL: s00373-014-1479-0
OpenAlex ID: W2065669620
cites work: Weight choosability of graphs
cites work: Q3097395
cites work: A NOTE ON EDGE WEIGHT CHOOSABILITY OF GRAPHS
cites work: Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
cites work: Edge weights and vertex colours
cites work: On total weight choosability of graphs
DOI: 10.1007/S00373-014-1479-0
description: scientific article; zbMATH DE number 6484845