Neighbor Sum Distinguishing Total Choice Number of IC-Planar Graphs Without 4-Cycles
A neighbor sum distinguishing (NSD) total coloring of a graph <i>G</i> is a mapping <inline-formula><math xmlns="http://www.w3.org/1998/Math/MathML" display="inline"><semantics><mrow><mi>ϕ</mi><mo>:</mo><mi>T</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>=</mo><mi>V</mi><mo>(</mo><mi>G</mi><mo>)</mo><mo>∪</...
I tiakina i:
| Ngā kaituhi matua: | , |
|---|---|
| Hōputu: | Artigo |
| Reo: | Inglês |
| I whakaputaina: |
MDPI AG
2026-05-01
|
| Rangatū: | Mathematics |
| Ngā marau: | |
| Urunga tuihono: | https://www.mdpi.com/2227-7390/14/10/1663 |
| Ngā Tūtohu: |
Kāore He Tūtohu, Me noho koe te mea tuatahi ki te tūtohu i tēnei pūkete!
|