On defining numbers of vertex colouring of regular graphs

DOI10.1016/S0012-365X(99)90113-9zbMATH Open0924.05025OpenAlexW4212769193MaRDI QIDQ1292860FDOQ1292860

E. S. Mahmoodian, Eric Mendelsohn

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

Recommendations

• Constructing regular graphs with smallest defining number
• scientific article; zbMATH DE number 5064065
• On defining numbers of \(k\)-chromatic \(k\)-regular graphs.

zbMATH Keywords

colouringregular graphdefining setdefining number

Mathematics Subject Classification ID

Coloring of graphs and hypergraphs (05C15)

Cites Work

• Defining sets in vertex colorings of graphs and latin rectangles
• Title not available (Why is that?)
• A characterization of uniquely 2-list colorable graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)

Cited In (10)

• Determination of the size of defining set for Steiner triple systems
• Title not available (Why is that?)
• On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
• Defining numbers in some of the Harary graphs
• On the extending ofk-regular graphs and their strong defining spectrum
• Defining sets in vertex colorings of graphs and latin rectangles
• On the defining sets of some special graphs
• When is a partial Latin square uniquely completable, but not its completable product?
• On defining numbers of \(k\)-chromatic \(k\)-regular graphs.
• Generalized Latin squares and their defining sets

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

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