Pages that link to "Item:Q2928589"
From MaRDI portal
The following pages link to Bounding the weight choosability number of a graph (Q2928589):
Displayed 17 items.
- Neighbor sum distinguishing total choosability of planar graphs without 4-cycles (Q277657) (← links)
- Decomposing graphs into a constant number of locally irregular subgraphs (Q338587) (← links)
- Forcing \(k\)-repetitions in degree sequences (Q405103) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Neighbour-sum-2-distinguishing edge-weightings: doubling the 1-2-3 conjecture (Q1627846) (← links)
- List neighbor sum distinguishing edge coloring of subcubic graphs (Q1686014) (← links)
- A note on a directed version of the 1-2-3 conjecture (Q1693177) (← links)
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Weight choosability of graphs with maximum degree 4 (Q2194741) (← links)
- Neighbor sum distinguishing total colorings of triangle free planar graphs (Q2355461) (← links)
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz (Q2409525) (← links)
- A relaxed case on 1-2-3 conjecture (Q2631083) (← links)
- A solution to the 1-2-3 conjecture (Q6196158) (← links)