The defining numbers for vertex colorings of certain graphs
From MaRDI portal
(Redirected from The defining numbers for vertex colorings of certain graphs)
Recommendations
- On the defining number for vertex colorings of a family of graphs
- Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
- On the defining number of (2n-2)-vertex colorings of K_n K_n
- Defining sets in (proper) vertex colorings of P_m \times K_n
- Defining numbers in some of the Harary graphs
Cited in
(15)- Defining numbers in some of the Harary graphs
- Constructing regular graphs with smallest defining number
- Set-vertex coloring of general-Mycielski graph
- Defining sets in (proper) vertex colorings of P_m \times K_n
- Graph coloring applications and defining sets in graph theory
- On the defining number and strong defining number for vertex colourings of Jahangir graphs
- Determination of the size of defining set for Steiner triple systems
- On the defining number for vertex colorings of a family of graphs
- A new graph coloring scheme
- On the defining number of \(K_{2n}\;1\)-factors
- scientific article; zbMATH DE number 2197901 (Why is no real title available?)
- On the extending ofk-regular graphs and their strong defining spectrum
- scientific article; zbMATH DE number 5053295 (Why is no real title available?)
- Defining sets in (proper) vertex colorings of the Cartesian product of a cycle with a complete graph
- On the defining number of (2n-2)-vertex colorings of K_n K_n
This page was built for publication: The defining numbers for vertex colorings of certain graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5480697)
