The distinguishing chromatic number of Cartesian products of two complete graphs (Q973145): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the hypercube / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of the direct product and wreath product action. / rank
 
Normal rank
Property / cites work
 
Property / cites work: On computing the distinguishing numbers of trees and forests / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Chromatic Number of Cartesian Products of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing colorings of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5574690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing number of Cartesian products of complete graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4523707 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing Cartesian powers of graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing infinite graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishing labellings of group action on vector spaces and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Cartesian powers of graphs can be distinguished by two labels / rank
 
Normal rank
Property / cites work
 
Property / cites work: On distinquishing numbers / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Automorphism Group of a Product of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Graphs with Given Group and Given Graph-Theoretical Properties / rank
 
Normal rank
Property / cites work
 
Property / cites work: Distinguishability of locally finite trees / rank
 
Normal rank

Revision as of 20:43, 2 July 2024

scientific article
Language Label Description Also known as
English
The distinguishing chromatic number of Cartesian products of two complete graphs
scientific article

    Statements

    The distinguishing chromatic number of Cartesian products of two complete graphs (English)
    0 references
    0 references
    0 references
    28 May 2010
    0 references
    distinguishing chromatic number
    0 references
    graph automorphism
    0 references
    Cartesian product of graphs
    0 references

    Identifiers