Neighbor sum distinguishing total coloring of IC-planar graphs
From MaRDI portal
Publication:2185920
DOI10.1016/j.disc.2020.111918zbMath1445.05043OpenAlexW3016247843MaRDI QIDQ2185920
Wen Yao Song, Lian-Ying Miao, Yuan-Yuan Duan
Publication date: 8 June 2020
Published in: Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.disc.2020.111918
maximum degreeneighbor sum distinguishing total coloringcombinatorial NullstellensatzIC-planar graph
Extremal problems in graph theory (05C35) Planar graphs; geometric and topological aspects of graph theory (05C10) Coloring of graphs and hypergraphs (05C15) Vertex degrees (05C07)
Related Items (1)
Cites Work
- Unnamed Item
- Neighbor sum distinguishing total coloring of graphs embedded in surfaces of nonnegative Euler characteristic
- 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
- Neighbor sum distinguishing total coloring and list neighbor sum distinguishing total coloring
- Neighbor sum distinguishing total chromatic number of planar graphs with maximum degree 10
- Neighbor sum distinguishing total choosability of IC-planar graphs
- Neighbor sum distinguishing total chromatic number of planar graphs
- Neighbor sum distinguishing total colorings of planar graphs with maximum degree \(\varDelta\)
- Asymptotically optimal neighbor sum distinguishing total colorings of graphs
- Neighbor sum distinguishing total colorings of graphs with bounded maximum average degree
- Neighbor sum distinguishing total colorings of \(K_4\)-minor free graphs
- Chromatic number, independence ratio, and crossing number
- Combinatorial Nullstellensatz
This page was built for publication: Neighbor sum distinguishing total coloring of IC-planar graphs
