Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
From MaRDI portal
(Redirected from Publication:831336)
Recommendations
Cites work
- A note on edge weight choosability of graphs
- An improved upper bound on edge weight choosability of graphs
- Bounding the monomial index and \((1,l)\)-weight choosability of a graph
- Edge weights and vertex colours
- Every graph is \((2,3)\)-choosable
- Graphs are \((1, \varDelta + 1)\)-choosable
- On a \(1,2\) conjecture
- On total weight choosability of graphs
- Weight choosability of graphs
Cited in
(5)
This page was built for publication: Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q831336)