Neighbor sum distinguishing total coloring of sparse IC-planar graphs
From MaRDI portal
Publication:1706133
DOI10.1016/j.dam.2017.11.028zbMath1382.05019OpenAlexW2783291511MaRDI QIDQ1706133
Jing-ru Pang, Yue-ying Zhao, Jin-bo Li, Lian-Ying Miao, Wen Yao Song
Publication date: 21 March 2018
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.dam.2017.11.028
maximum degreeneighbor sum distinguishing total coloringcombinatorial NullstellensatzIC-planar graph
Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Density (toughness, etc.) (05C42)
Related Items (10)
Neighbor sum distinguishing total choice number of NIC-planar graphs with restricted conditions ⋮ Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions ⋮ Neighbor sum distinguishing total choosability of planar graphs with maximum degree at least 10 ⋮ Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24 ⋮ Neighbor sum distinguishing total choosability of cubic graphs ⋮ Neighbor sum distinguishing total coloring of triangle free IC-planar graphs ⋮ Neighbor sum distinguishing total choice number of planar graphs without 6-cycles ⋮ Acyclic edge coloring of IC-planar graphs ⋮ Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13 ⋮ Neighbor sum distinguishing total colorings of corona of subcubic graphs
Cites Work
- Unnamed Item
- Unnamed Item
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- Weighted-1-antimagic graphs of prime power order
- The adjacent vertex distinguishing total chromatic number
- Neighbor sum distinguishing total colorings via the combinatorial nullstellensatz
- Neighbor sum distinguishing total colorings of planar graphs
- On the neighbor sum distinguishing total coloring of planar graphs
- 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
- A note on the adjacent vertex distinguishing total chromatic number of graphs
- Edge weights and vertex colours
- The number of edge 3-colorings of a planar cubic graph as a permanent
- On edge colorings of \(1\)-planar graphs
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Neighbor sum distinguishing total colorings of triangle free planar graphs
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs
- 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
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- On adjacent-vertex-distinguishing total coloring of graphs
- Antimagic labelling of vertex weighted graphs
- Coloring plane graphs with independent crossings
- Chromatic number, independence ratio, and crossing number
- Combinatorial Nullstellensatz
- 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 sparse IC-planar graphs
