Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic

DOI10.1007/S10878-015-9832-7zbMath1339.05149OpenAlexW2021079395MaRDI QIDQ281776

Publication date: 11 May 2016

Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10878-015-9832-7

zbMATH Keywords

surface Euler characteristic neighbor sum distinguishing total coloring

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60)

Related Items (2)

Neighbor sum distinguishing total coloring of IC-planar graphs ⋮ Neighbor sum distinguishing total coloring of sparse IC-planar graphs

Cites Work

Unnamed Item
Unnamed Item
Neighbor sum distinguishing index of planar graphs
An improved upper bound for the neighbor sum distinguishing index of graphs
Weighted-1-antimagic graphs of prime power order
Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
Neighbor sum distinguishing total colorings of planar graphs
Neighbor sum distinguishing edge colorings of graphs with small maximum average degree
On the adjacent vertex distinguishing total coloring numbers of graphs with \(\varDelta =3\)
Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
Adjacent vertex distinguishing total colorings of outerplanar graphs
Irregularity strength of regular graphs
Concise proofs for adjacent vertex-distinguishing total colorings
Edge weights and vertex colours
On the total-neighbor-distinguishing index by sums
Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
Neighbor sum (set) distinguishing total choosability via the combinatorial Nullstellensatz
The adjacent vertex distinguishing total coloring of planar graphs
Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
On the adjacent vertex-distinguishing total chromatic numbers of the graphs with \(\Delta (G) = 3\)
Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
On adjacent-vertex-distinguishing total coloring of graphs
Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
Antimagic labelling of vertex weighted graphs
NEIGHBOR SUM DISTINGUISHING COLORING OF SOME GRAPHS
Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
Linear Bound on the Irregularity Strength and the Total Vertex Irregularity Strength of Graphs
Total weight choosability of graphs
Total weight choosability of graphs

This page was built for publication: Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic