Neighbor Sum Distinguishing Total Choosability of IC-Planar Graphs
Two distinct crossings are independent if the end-vertices of the crossed pair of edges are mutually different. If a graph G has a drawing in the plane such that every two crossings are independent, then we call G a plane graph with independent crossings or IC-planar graph for short. A proper total-...
| Published in: | Discussiones Mathematicae Graph Theory |
|---|---|
| Main Authors: | , , |
| Format: | Article |
| Language: | English |
| Published: |
University of Zielona Góra
2020-02-01
|
| Subjects: | |
| Online Access: | https://doi.org/10.7151/dmgt.2145 |