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

DOI10.1007/S10878-015-9832-7MaRDI QIDQ281776zbMATH OpenOpenAlexFDO

Authors Renyu Xu, Jian-Liang Wu, Jin Xu

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

surfaceEuler characteristicneighbor sum distinguishing total coloring

Mathematics Subject Classification ID

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

Recommendations

• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Entire coloring of graphs embedded in a surface of nonnegative characteristic
• Edge coloring of graphs embedded in a surface of nonnegative characteristic
• Neighbor sum distinguishing total colorings of planar graphs
• On the Total Coloring of Graphs Embeddable in Surfaces
• On the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing total colorings of triangle free planar graphs
• A note on the neighbor sum distinguishing total coloring of planar graphs
• Neighbor sum distinguishing coloring of some graphs
• Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)

Cites work

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

Cited in

(3)

• Total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
• Neighbor sum distinguishing total coloring of IC-planar graphs
• Neighbor sum distinguishing total coloring of sparse IC-planar graphs

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q281776)