Distinguishing graphs by edge-colourings (Q482130): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Symmetry breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: On Computing the Distinguishing Numbers of Planar Graphs and Beyond: A Counting Approach / 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: Bounds on the distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: The distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Nordhaus-Gaddum theorem for the distinguishing chromatic number / rank
 
Normal rank
Property / cites work
 
Property / cites work: Motion and distinguishing number two / rank
 
Normal rank
Property / cites work
 
Property / cites work: Asymmetric 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: Endomorphism breaking in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: How to personalize the vertices of a graph? / 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: Distinguishability of infinite groups and graphs / rank
 
Normal rank

Latest revision as of 11:03, 9 July 2024

scientific article
Language Label Description Also known as
English
Distinguishing graphs by edge-colourings
scientific article

    Statements

    Identifiers