TY  - GEN 
AU  - Samadi, Babak
AU  - Soltankhah, Nasrin
AU  - González Yero, Ismael
A4  - Matemáticas
PY  - 2024
SN  - 2180-4206
SN  - 0126-6705
UR  - http://hdl.handle.net/10498/33750
AB  - The problem of injective coloring in graphs can be revisited through two different
approaches: coloring the two-step graphs and vertex partitioning of graphs into open
packing sets, each of which is equivalent to the injective coloring problem...
LA  - eng
PB  - Springer
KW  - Injective coloring
KW  - Open packing partitions ·
KW  - Two-step graphs
KW  - Vertex coloring
KW  - Lexicographic product
KW  - Direct product
KW  - Strong product
KW  - Cartesian product
KW  - Open packing
KW  - 2-Distance coloring
TI  - Injective Coloring of Product Graphs
DO  - 10.1007/S40840-024-01682-8
ER  -