Cartesian powers of graphs can be distinguished by two labels (Q854831): 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: Q2716030 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Associative products of graphs / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4523707 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on the asymptotic and computational complexity of graph distinguishability / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graph multiplication / rank | |||
Normal rank |
Latest revision as of 09:56, 25 June 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Cartesian powers of graphs can be distinguished by two labels |
scientific article |
Statements
Cartesian powers of graphs can be distinguished by two labels (English)
0 references
7 December 2006
0 references