On defining numbers of vertex colouring of regular graphs

DOI10.1016/S0012-365X(99)90113-9zbMath0924.05025OpenAlexW4212769193MaRDI QIDQ1292860

Eric Mendelsohn, Ebadollah S. Mahmoodian

Publication date: 3 November 1999

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0012-365x(99)90113-9

zbMATH Keywords

colouringregular graphdefining setdefining number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Related Items (5)

Determination of the size of defining set for Steiner triple systems ⋮ Generalized Latin squares and their defining sets ⋮ When is a partial Latin square uniquely completable, but not its completable product? ⋮ On the extending ofk-regular graphs and their strong defining spectrum ⋮ Defining numbers in some of the Harary graphs

Cites Work

• Defining sets in vertex colorings of graphs and latin rectangles
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On defining numbers of vertex colouring of regular graphs