Distant irregularity strength of graphs

DOI10.1016/j.disc.2013.08.031zbMath1281.05058MaRDI QIDQ394284

Jakub Przybyło

Publication date: 27 January 2014

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.disc.2013.08.031

zbMATH Keywords

irregularity strength; total vertex irregularity strength; \(1,2,3\)-conjecture; \(1,2\)-conjecture; distant irregularity strength; irregular colouring

Mathematics Subject Classification ID

05C15: Coloring of graphs and hypergraphs

05C12: Distance in graphs

Related Items

On the Neighbor Sum Distinguishing Index of Planar Graphs, Distant sum distinguishing index of graphs with bounded minimum degree, Non-proper edge-colouring of graphs and hereditary graph properties, Total Vertex Irregularity Strength of Dense Graphs, Distant set distinguishing edge colourings of graphs, Distant total irregularity strength of graphs via random vertex ordering, Distant total sum distinguishing index of graphs, Distant sum distinguishing index of graphs, On the hardness of determining the irregularity strength of graphs, Going wide with the 1-2-3 conjecture, Distant irregularity strength of graphs with bounded minimum degree, Distant set distinguishing total colourings of graphs, Neighbor Distinguishing Edge Colorings Via the Combinatorial Nullstellensatz Revisited

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• On irregular total labellings
• Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
• Irregularity strength of regular graphs
• A new upper bound for the total vertex irregularity strength of graphs
• The irregularity strength of \(K_{m,m}\) is 4 for odd m
• Irregular networks, regular graphs and integer matrices with distinct row and column sums
• Edge weights and vertex colours
• Superfluous edges and exponential expansions of de Bruijn and Kautz graphs
• The diameter of random regular graphs
• Vertex-colouring edge-weightings
• A survey on the distance-colouring of graphs
• Degree constrained subgraphs
• Moore graphs and beyond: a survey of the degree/diameter problem
• A New Upper Bound for the Irregularity Strength of Graphs
• Irregular Assignments of Trees and Forests
• A Tight Bound on the Irregularity Strength of Graphs
• On graph irregularity strength
• Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
• Irregularity strength of dense graphs