On defining numbers of vertex colouring of regular graphs
From MaRDI portal
(Redirected from Publication:1292860)
Recommendations
Cites work
- scientific article; zbMATH DE number 91032 (Why is no real title available?)
- scientific article; zbMATH DE number 90345 (Why is no real title available?)
- scientific article; zbMATH DE number 1146235 (Why is no real title available?)
- scientific article; zbMATH DE number 1792651 (Why is no real title available?)
- scientific article; zbMATH DE number 828012 (Why is no real title available?)
- A characterization of uniquely 2-list colorable graphs
- Defining sets in vertex colorings of graphs and latin rectangles
Cited in
(13)- scientific article; zbMATH DE number 5053295 (Why is no real title available?)
- On the defining sets of some special graphs
- Lower and upper bound on defining spectrum of regular graphs
- On the defining number for vertex colorings of a family of graphs
- Determination of the size of defining set for Steiner triple systems
- On the defining number of \((2n-2)\)-vertex colorings of \(K_n\times K_n\)
- Defining numbers in some of the Harary graphs
- Generalized Latin squares and their defining sets
- Constructing regular graphs with smallest defining number
- Defining sets in vertex colorings of graphs and latin rectangles
- On defining numbers of \(k\)-chromatic \(k\)-regular graphs.
- On the extending ofk-regular graphs and their strong defining spectrum
- When is a partial Latin square uniquely completable, but not its completable product?
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)
