Total Weight Choosability of Trees
From MaRDI portal
Publication:5346547
DOI10.1137/15M100763XzbMath1362.05056OpenAlexW2604332568MaRDI QIDQ5346547
Tsai-Lien Wong, Guan-Huei Duh, Xuding Zhu, Gerard Jennhwa Chang
Publication date: 24 May 2017
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/15m100763x
Trees (05C05) Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78) Signed and weighted graphs (05C22)
Related Items (5)
Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Total weight choosability of graphs with bounded maximum average degree ⋮ Every nice graph is (1,5)-choosable ⋮ Total weight choosability of Cartesian product of graphs ⋮ Total weight choosability of graphs: towards the 1-2-3-conjecture
Cites Work
- Total weight choosability of Cartesian product of graphs
- Every graph is \((2,3)\)-choosable
- A nowhere-zero point in linear mappings
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- On vertex-coloring 13-edge-weighting
- Colorings and orientations of graphs
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Total weight choosability of graphs
- Unnamed Item
- Unnamed Item
This page was built for publication: Total Weight Choosability of Trees