Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph

DOI10.7151/DMGT.1301zbMath1102.05023OpenAlexW2151971887MaRDI QIDQ5492686

Doost Ali Mojdeh

Publication date: 16 October 2006

Published in: Discussiones Mathematicae Graph Theory (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a6a370e6aa31448bf0d9f4cb744a0651b684bda1

Mathematics Subject Classification ID

Paths and cycles (05C38) Coloring of graphs and hypergraphs (05C15)

Related Items (2)

Determination of the size of defining set for Steiner triple systems ⋮ Defining numbers in some of the Harary graphs

This page was built for publication: Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph