scientific article
From MaRDI portal
Publication:3575472
zbMath1250.05093MaRDI QIDQ3575472
Mariusz Woźniak, Jakub Przybyło
Publication date: 27 July 2010
Full work available at URL: https://www.dmtcs.org/dmtcs-ojs/index.php/dmtcs/article/view/948/0.html
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Related Items (66)
A note on adjacent vertex distinguishing colorings of graphs ⋮ Graphs are \((1, \varDelta + 1)\)-choosable ⋮ Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic ⋮ Vertex colouring edge weightings: a logarithmic upper bound on weight-choosability ⋮ Neighbor distinguishing total choice number of sparse graphs via the combinatorial nullstellensatz ⋮ Neighbour-distinguishing labellings of families of graphs ⋮ The 1,2-conjecture for powers of cycles ⋮ Neighbor sum distinguishing total choosability of planar graphs ⋮ Dense Eulerian graphs are \((1, 3)\)-choosable ⋮ Graphs with maximum average degree less than \(\frac{11}{4}\) are \((1, 3)\)-choosable ⋮ Every nice graph is (1,5)-choosable ⋮ Neighbour-distinguishing labellings of powers of paths and powers of cycles ⋮ Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz ⋮ A note on breaking small automorphisms in graphs ⋮ Distant irregularity strength of graphs ⋮ Total Weight Choosability of Trees ⋮ Colourings of graphs by labellings ⋮ 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 ⋮ Multiplicative vertex-colouring weightings of graphs ⋮ On the neighbor sum distinguishing total coloring of planar graphs ⋮ On a total version of 1-2-3 conjecture ⋮ On inducing degenerate sums through 2-labellings ⋮ Distant total irregularity strength of graphs via random vertex ordering ⋮ A solution to the 1-2-3 conjecture ⋮ Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring ⋮ On the role of 3's for the 1-2-3 conjecture ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs ⋮ On total weight choosability of graphs ⋮ Distant total sum distinguishing index of graphs ⋮ A note on face coloring entire weightings of plane graphs ⋮ The 1-2-3 conjecture almost holds for regular graphs ⋮ The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs ⋮ A note on vertex colorings of plane graphs ⋮ From the 1-2-3 conjecture to the Riemann hypothesis ⋮ Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz ⋮ A 1-2-3-4 result for the 1-2-3 conjecture in 5-regular graphs ⋮ On the role of 3s for the 1--2--3 conjecture ⋮ Neighbor sum distinguishing total colorings of planar graphs ⋮ Vertex coloring of graphs by total 2-weightings ⋮ A note on neighbor expanded sum distinguishing index ⋮ An introduction to the discharging method via graph coloring ⋮ Permanent index of matrices associated with graphs ⋮ Neighbor product distinguishing total colorings ⋮ Graphs with multiplicative vertex-coloring 2-edge-weightings ⋮ On a directed variation of the 1-2-3 and 1-2 conjectures ⋮ On weight choosabilities of graphs with bounded maximum average degree ⋮ Every graph is \((2,3)\)-choosable ⋮ The neighbour-sum-distinguishing edge-colouring game ⋮ Algorithmic complexity of weakly semiregular partitioning and the representation number ⋮ On the complexity of determining the irregular chromatic index of a graph ⋮ Decomposability of graphs into subgraphs fulfilling the 1-2-3 conjecture ⋮ Further results on an equitable 1-2-3 conjecture ⋮ Equitable neighbour-sum-distinguishing edge and total colourings ⋮ Neighbor sum distinguishing total coloring of graphs with bounded treewidth ⋮ Neighbour sum distinguishing total colourings via the combinatorial nullstellensatz ⋮ On the algorithmic complexity of adjacent vertex closed distinguishing colorings number of graphs ⋮ Total weight choosability for Halin graphs ⋮ Further evidence towards the multiplicative 1-2-3 conjecture ⋮ The 1-2-3-Conjecture for Hypergraphs ⋮ Coloring chip configurations on graphs and digraphs ⋮ 1-2-3 Conjecture in digraphs: more results and directions ⋮ Edge weights and vertex colours: minimizing sum count ⋮ 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
This page was built for publication:
