On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)

zbMATH Open1113.05036MaRDI QIDQ875716

N. E. Zubov

Publication date: 13 April 2007

Published in: Bulletin of the Iranian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

defining set

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15) Perfect graphs (05C17)

Related Items (3)

Title not available (Why is that?) ⋮ On the extending ofk-regular graphs and their strong defining spectrum ⋮ Colorings of the Graph K ᵐ 2 + Kn

Recommendations

• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• On defining numbers of vertex colouring of regular graphs 👍 👎
• Vertex-distinguishing total coloring of \(K_{2n+1}\backslash E(K_{2,m})\) 👍 👎
• Defining sets in (proper) vertex colorings of P_m \times K_n 👍 👎
• On N2-vertex coloring of graphs 👍 👎
• Maximum number of colorings of (2k, k²)‐graphs 👍 👎
• Colorings of the Graph K ᵐ 2 + Kn 👍 👎

This page was built for publication: On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q875716)