An improved upper bound on edge weight choosability of graphs
From MaRDI portal
Publication:497381
DOI10.1007/s00373-014-1479-0zbMath1326.05051MaRDI QIDQ497381
Publication date: 24 September 2015
Published in: Graphs and Combinatorics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00373-014-1479-0
05C15: Coloring of graphs and hypergraphs
05C78: Graph labelling (graceful graphs, bandwidth, etc.)
05C22: Signed and weighted graphs