On total weight choosability of graphs
From MaRDI portal
Publication:1956254
DOI10.1007/s10878-012-9491-xzbMath1294.90053MaRDI QIDQ1956254
Publication date: 13 June 2013
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-012-9491-x
90C35: Programming involving graphs or networks
90C27: Combinatorial optimization
05C15: Coloring of graphs and hypergraphs
Related Items
Total weight choosability for Halin graphs, Total weight choosability of cone graphs, An improved upper bound on edge weight choosability of graphs, Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability, On a list variant of the multiplicative 1-2-3 conjecture, Total weight choosability of graphs with bounded maximum average degree
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Vertex-coloring 2-edge-weighting of graphs
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- A note on neighbour-distinguishing regular graphs total-weighting
- Edge weights and vertex colours
- Vertex-colouring edge-weightings
- Weight choosability of graphs
- Combinatorial Nullstellensatz
- Total weight choosability of graphs
- Total weight choosability of graphs