Distinguishing Cartesian products of countable graphs (Q503675): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.7151/dmgt.1902 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2418670818 / rank
 
Normal rank
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: Q3005852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5574690 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Über das schwache Kartesische Produkt von Graphen / 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: Distinguishing infinite 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: The Automorphism Group of a Product of Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Weak cartesian product of graphs / 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
Property / cites work
 
Property / cites work: Distinguishability of infinite groups and graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5589874 / rank
 
Normal rank

Latest revision as of 07:31, 13 July 2024

scientific article
Language Label Description Also known as
English
Distinguishing Cartesian products of countable graphs
scientific article

    Statements

    Distinguishing Cartesian products of countable graphs (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    23 January 2017
    0 references
    vertex coloring
    0 references
    distinguishing number
    0 references
    automorphisms
    0 references
    infinite graphs
    0 references
    Cartesian product
    0 references
    weak Cartesian product
    0 references

    Identifiers