On a 1,2 conjecture
From MaRDI portal
Publication:3575472
zbMATH Open1250.05093MaRDI QIDQ3575472FDOQ3575472
Authors: Jakub Przybyło, Mariusz Woźniak 
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/948/0.html
Recommendations
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cited In (75)
- On inducing degenerate sums through 2-labellings
- Further results on an equitable 1-2-3 conjecture
- Neighbour-distinguishing labellings of families of graphs
- Asymptotic confirmation of the Faudree–Lehel conjecture on irregularity strength for all but extreme degrees
- On the total versions of 1-2-3-conjecture for graphs and hypergraphs
- Dense Eulerian graphs are \((1, 3)\)-choosable
- From the 1-2-3 conjecture to the Riemann hypothesis
- A solution to the 1-2-3 conjecture
- Equitable neighbour-sum-distinguishing edge and total colourings
- Neighbour-distinguishing labellings of powers of paths and powers of cycles
- Distant total sum distinguishing index of graphs
- Edge weights and vertex colours: minimizing sum count
- A note on face coloring entire weightings of plane graphs
- On the complexity of determining the irregular chromatic index of a graph
- Distant irregularity strength of graphs
- Multiplicative vertex-colouring weightings of graphs
- On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs
- A note on adjacent vertex distinguishing colorings of graphs
- Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability
- A note on vertex colorings of plane graphs
- On the role of 3's for the 1-2-3 conjecture
- Graphs are \((1, \varDelta + 1)\)-choosable
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz
- Neighbor sum distinguishing total choosability of planar graphs
- Distant total irregularity strength of graphs via random vertex ordering
- Every nice graph is (1,5)-choosable
- Further evidence towards the multiplicative 1-2-3 conjecture
- Vertex-coloring edge-weighting of complete \(r\)-partite graphs
- Total weight choosability for Halin graphs
- Neighbor sum distinguishing total coloring of graphs with bounded treewidth
- An oriented version of the 1-2-3 conjecture
- On a total version of 1-2-3 conjecture
- On the neighbor sum distinguishing total coloring of planar graphs
- Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture
- Permanent index of matrices associated with graphs
- Every graph is \((2,3)\)-choosable
- Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz
- Total Weight Choosability of Trees
- Title not available (Why is that?)
- The 1-2-3-conjecture for hypergraphs
- The 1,2-conjecture for powers of cycles
- The 3-flow conjecture, factors modulo \(k\), and the 1-2-3-conjecture
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable
- The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs
- The 1-2-3 conjecture almost holds for regular graphs
- A note on breaking small automorphisms in graphs
- Vertex coloring of graphs by total 2-weightings
- Graphs with multiplicative vertex-coloring 2-edge-weightings
- Springer conjecture on \(N=17\)
- On Besicovitch's ½-Problem
- 1,2 conjecture-the multiplicative version
- A note on neighbour-distinguishing regular graphs total-weighting
- On the total-neighbor-distinguishing index by sums
- On decomposing regular graphs into locally irregular subgraphs
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- On total weight choosability of graphs
- 1-2-3 Conjecture in digraphs: more results and directions
- Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
- Colourings of graphs by labellings
- A note on neighbor expanded sum distinguishing index
- An introduction to the discharging method via graph coloring
- Neighbor product distinguishing total colorings
- Neighbor sum distinguishing total coloring of sparse IC-planar graphs
- A relaxed case on 1-2-3 conjecture
- A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs
- On a directed variation of the 1-2-3 and 1-2 conjectures
- On weight choosabilities of graphs with bounded maximum average degree
- On the role of 3s for the 1-2-3 conjecture
- Coloring chip configurations on graphs and digraphs
- The neighbour-sum-distinguishing edge-colouring game
- Algorithmic complexity of weakly semiregular partitioning and the representation number
This page was built for publication: On a \(1,2\) conjecture
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3575472)
