Weight choosability of graphs
From MaRDI portal
Publication:3608322
Recommendations
Cites work
- A nowhere-zero point in linear mappings
- Colorings and orientations of graphs
- Degree constrained subgraphs
- Edge weights and vertex colours
- On graph irregularity strength
- Regular subgraphs of almost regular graphs
- The permanent rank of a matrix
- Vertex colouring edge partitions
- Vertex-colouring edge-weightings
Cited in
(51)- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- Digraphs are 2-weight choosable
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
- Local antimagic orientations of \(d\)-degenerate graphs
- A note on edge weight choosability of graphs
- Bounding the distant irregularity strength of graphs via a non-uniformly biased random weight assignment
- Graphs are \((1, \varDelta + 1)\)-choosable
- Additive coloring of planar graphs
- Neighbor sum distinguishing list total coloring of subcubic graphs
- Lucky labelings of graphs
- Every nice graph is (1,5)-choosable
- Total weight choosability of cone graphs
- An oriented version of the 1-2-3 conjecture
- On a list variant of the multiplicative 1-2-3 conjecture
- Total weight choosability for Halin graphs
- Total weight choosability of graphs
- Total weight choosability of graphs
- Total weight choosability of Cartesian product of graphs
- Weight choosability of graphs with maximum degree 4
- Permanent index of matrices associated with graphs
- Total weight choosability of Mycielski graphs
- 2-connected chordal graphs and line graphs are \((1,5)\)-choosable
- Every graph is \((2,3)\)-choosable
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Total Weight Choosability of Trees
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- Dense Eulerian graphs are (1, 3)-choosable
- The 1-2-3-conjecture for hypergraphs
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- On the standard \((2,2)\)-conjecture
- Algorithmic complexity of proper labeling problems
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- From the 1-2-3 conjecture to the Riemann hypothesis
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- The 1-2-3 conjecture almost holds for regular graphs
- A solution to the 1-2-3 conjecture
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- List total weighting of graphs
- On total weight choosability of graphs
- 1-2-3 Conjecture in digraphs: more results and directions
- On \(\{a, b\}\)-edge-weightings of bipartite graphs with odd \(a, b\)
- List neighbor sum distinguishing edge coloring of subcubic graphs
- Total weight choosability of graphs: towards the 1-2-3-conjecture
- Weight choosability of oriented hypergraphs
- An improved upper bound on edge weight choosability of graphs
- Total weight choosability of graphs with bounded maximum average degree
- On weight choosabilities of graphs with bounded maximum average degree
- scientific article; zbMATH DE number 10422 (Why is no real title available?)
- Going wide with the 1-2-3 conjecture
- Essential positive covers of the cube
- Coloring chip configurations on graphs and digraphs
This page was built for publication: Weight choosability of graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3608322)
