TY - JOUR
ID - 14618
TI - Simultaneous coloring of vertices and incidences of hypercubes
JO - Communications in Combinatorics and Optimization
JA - CCO
LA - en
SN - 2538-2128
AU - Mozafari-Nia, Mahsa
AU - N. Iradmusa, Moharram
AD - Department of Mathematical Sciences, Shahid Beheshti University
G.C., P.O. Box 19839-63113, Tehran, Iran
Y1 - 2024
PY - 2024
VL - 9
IS - 1
SP - 67
EP - 77
KW - Incidence of graph
KW - simultaneous coloring of graph
KW - hypercube
DO - 10.22049/cco.2023.27843.1367
N2 - An element $i=(v,e)$ of a graph $G$ is called an incidence of $G$, if $v\in V(G)$, $e\in E(G)$ and $v\in e$. The simultaneous coloring of vertices and incidences of a graph is coloring the vertices and incidences of the graph properly at the same time such that any two adjacent or incident elements receive distinct colors. In this paper, we investigate the simultaneous coloring of vertices and incidences of hypercubes.
UR - https://comb-opt.azaruniv.ac.ir/article_14618.html
L1 - https://comb-opt.azaruniv.ac.ir/article_14618_faa7a557f561944ebf780cd7170ff722.pdf
ER -