The following pages link to (Q3575472):
Displayed 50 items.
- A note on adjacent vertex distinguishing colorings of graphs (Q266908) (← links)
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic (Q281776) (← links)
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz (Q287913) (← links)
- The 1,2-conjecture for powers of cycles (Q324730) (← links)
- Neighbor sum distinguishing total choosability of planar graphs (Q326491) (← links)
- Distant irregularity strength of graphs (Q394284) (← links)
- Multiplicative vertex-colouring weightings of graphs (Q413281) (← links)
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs (Q472134) (← links)
- A note on vertex colorings of plane graphs (Q472144) (← links)
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz (Q477256) (← links)
- Neighbor sum distinguishing total colorings of planar graphs (Q498443) (← links)
- Vertex coloring of graphs by total 2-weightings (Q503639) (← links)
- A note on neighbor expanded sum distinguishing index (Q505462) (← links)
- An introduction to the discharging method via graph coloring (Q507506) (← links)
- Permanent index of matrices associated with graphs (Q510339) (← links)
- Neighbor product distinguishing total colorings (Q512884) (← links)
- Graphs with multiplicative vertex-coloring 2-edge-weightings (Q512893) (← links)
- On a directed variation of the 1-2-3 and 1-2 conjectures (Q516801) (← links)
- On weight choosabilities of graphs with bounded maximum average degree (Q516900) (← links)
- Every graph is \((2,3)\)-choosable (Q519997) (← links)
- The neighbour-sum-distinguishing edge-colouring game (Q526242) (← links)
- Algorithmic complexity of weakly semiregular partitioning and the representation number (Q528476) (← links)
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth (Q724731) (← links)
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs (Q730489) (← links)
- Coloring chip configurations on graphs and digraphs (Q763476) (← links)
- 1-2-3 Conjecture in digraphs: more results and directions (Q777370) (← links)
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability (Q831336) (← links)
- On the neighbor sum distinguishing total coloring of planar graphs (Q897872) (← links)
- Graphs are \((1, \varDelta + 1)\)-choosable (Q1618249) (← links)
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable (Q1660241) (← links)
- Colourings of graphs by labellings (Q1687834) (← links)
- Distant total irregularity strength of graphs via random vertex ordering (Q1699557) (← links)
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring (Q1701100) (← links)
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs (Q1706133) (← links)
- Distant total sum distinguishing index of graphs (Q1712511) (← links)
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs (Q1730218) (← links)
- Equitable neighbour-sum-distinguishing edge and total colourings (Q1786869) (← links)
- On total weight choosability of graphs (Q1956254) (← links)
- Further results on an equitable 1-2-3 conjecture (Q2022502) (← links)
- Further evidence towards the multiplicative 1-2-3 conjecture (Q2057599) (← links)
- Neighbour-distinguishing labellings of families of graphs (Q2141099) (← links)
- Dense Eulerian graphs are \((1, 3)\)-choosable (Q2152793) (← links)
- Every nice graph is (1,5)-choosable (Q2171030) (← links)
- Neighbour-distinguishing labellings of powers of paths and powers of cycles (Q2175048) (← links)
- On a total version of 1-2-3 conjecture (Q2194539) (← links)
- The 1-2-3 conjecture almost holds for regular graphs (Q2222048) (← links)
- From the 1-2-3 conjecture to the Riemann hypothesis (Q2225418) (← links)
- On the role of 3s for the 1--2--3 conjecture (Q2235774) (← links)
- On the complexity of determining the irregular chromatic index of a graph (Q2253909) (← links)
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture (Q2274072) (← links)