Distinguishing colorings of Cartesian products of complete graphs (Q2483404): Difference between revisions
From MaRDI portal
Changed an Item |
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: Destroying symmetry by orienting edges: Complete graphs and complete bigraphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Identity orientation of complete bipartite graphs / 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: Distinguishing Cartesian powers of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cartesian powers of graphs can be distinguished by two labels / rank | |||
Normal rank |
Latest revision as of 22:24, 27 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Distinguishing colorings of Cartesian products of complete graphs |
scientific article |
Statements
Distinguishing colorings of Cartesian products of complete graphs (English)
0 references
28 April 2008
0 references
edge coloring
0 references
automorphism
0 references
distinguishing number
0 references