Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
DOI10.1007/S10878-015-9832-7zbMATH Open1339.05149OpenAlexW2021079395MaRDI QIDQ281776FDOQ281776
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
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\)
Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Coloring of graphs and hypergraphs (05C15)
Cites Work
- Graph theory
- Edge weights and vertex colours
- On adjacent-vertex-distinguishing total coloring of graphs
- On a \(1,2\) conjecture
- Linear bound on the irregularity strength and the total vertex irregularity strength of graphs
- Vertex-coloring edge-weightings: towards the 1-2-3-conjecture
- Irregularity strength of regular graphs
- Concise proofs for adjacent vertex-distinguishing total colorings
- 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
- Neighbor sum distinguishing edge colorings of graphs with bounded maximum average degree
- Antimagic labelling of vertex weighted graphs
- 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 coloring of some graphs
- Neighbor sum distinguishing total colorings of planar graphs
- Adjacent vertex distinguishing total coloring of planar graphs with large maximum degree
- Total weight choosability of graphs
- Total weight choosability of 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\)
- Adjacent vertex distinguishing total colorings of outerplanar graphs
Cited In (3)
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)
