Total Weight Choosability of Trees
From MaRDI portal
Recommendations
- scientific article; zbMATH DE number 3862455
- Thue choosability of trees
- The expected additive weight of trees
- Weighted height of random trees
- The weighted arborescence constraint
- Trees with exponential height dependent weight
- Trees with power-like height dependent weight
- Optimal weight allocation in rooted trees
- Balancing weight-balanced trees
Cites work
- A nowhere-zero point in linear mappings
- Colorings and orientations of graphs
- Combinatorial Nullstellensatz
- Degree constrained subgraphs
- Edge weights and vertex colours
- Every graph is (2,3)-choosable
- List total weighting of graphs
- On a 1,2 conjecture
- On vertex-coloring 13-edge-weighting
- Total weight choosability of Cartesian product of graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Vertex-colouring edge-weightings
- Weight choosability of graphs
Cited in
(7)- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Trees with power-like height dependent weight
- Dense Eulerian graphs are (1, 3)-choosable
- Every nice graph is (1,5)-choosable
- Total weight choosability of graphs with bounded maximum average degree
- Total weight choosability of Cartesian product of graphs
- Weighted Rooted Trees: Fat or Tall?
This page was built for publication: Total Weight Choosability of Trees
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5346547)
