On total weight choosability of graphs
From MaRDI portal
Recommendations
Cites work
- A note on neighbour-distinguishing regular graphs total-weighting
- Combinatorial Nullstellensatz
- Edge weights and vertex colours
- scientific article; zbMATH DE number 5158511 (Why is no real title available?)
- List total weighting of graphs
- On a 1,2 conjecture
- Total weight choosability of graphs
- Total weight choosability of graphs
- Vertex-coloring edge-weightings of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
- Weight choosability of graphs
Cited in
(16)- Graphs are \((1, \varDelta + 1)\)-choosable
- Total list weighting of graphs with bounded maximum average degree
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- On a list variant of the multiplicative 1-2-3 conjecture
- Dense Eulerian graphs are (1, 3)-choosable
- Total weight choosability of graphs with bounded maximum average degree
- Total weight choosability of cone graphs
- List total weighting of graphs
- Total weight choosability of Cartesian product of graphs
- Total weight choosability for Halin graphs
- An improved upper bound on edge weight choosability of graphs
- Permanent index of matrices associated with graphs
- Weight choosability of oriented hypergraphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
This page was built for publication: On total weight choosability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1956254)
