Colourings of graphs by labellings
From MaRDI portal
Publication:1687834
DOI10.1016/j.endm.2017.06.004zbMath1377.05162OpenAlexW2734011621MaRDI QIDQ1687834
Martin Bača, Stanlislav Jendroľ
Publication date: 4 January 2018
Full work available at URL: https://doi.org/10.1016/j.endm.2017.06.004
total edge irregularity strengthirregularity strengthtotal vertex irregularity strengthirregular colouringproper colouring
Coloring of graphs and hypergraphs (05C15) Graph labelling (graceful graphs, bandwidth, etc.) (05C78)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- A note on adjacent vertex distinguishing colorings of graphs
- A note on vertex colorings of plane graphs
- Total edge irregularity strength of large graphs
- Additive coloring of planar graphs
- On irregular total labellings
- Edge colouring by total labellings
- Total edge irregularity strength of complete graphs and complete bipartite graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Lucky labelings of graphs
- On vertex-coloring 13-edge-weighting
- Irregularity strength of regular graphs
- A new upper bound for the total vertex irregularity strength of graphs
- Every planar map is four colorable. I: Discharging
- Edge weights and vertex colours
- A note on face coloring entire weightings of plane graphs
- Vertex-colouring edge-weightings
- Degree constrained subgraphs
- Total Edge Irregularity Strength of Complete Graphs and Complete Bipartite 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
- On a conjecture about edge irregular total labelings
- Total Vertex Irregularity Strength of Dense Graphs
- Total edge irregularity strength of trees
- Irregularity strength of dense graphs
- 25 pretty graph colouring problems
