zweidimensionales bewegtes Bild
Bounds for the distinguishing index of finite graphs
- Standort
-
Hannover TIB
- Umfang
-
103MB, 00:31:13:28 (unknown)
- Sprache
-
Englisch
- Anmerkungen
-
Audiovisuelles Material
- Erschienen in
-
Symmetry Breaking in Discrete Structures (18w5050) ; (Jan. 2018)
- Ereignis
-
Veröffentlichung
- (wer)
-
Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
- (wann)
-
2018-01-01
- Beteiligte Personen und Organisationen
-
Kalinowski, Rafal
Pilśniak, Monika
- DOI
-
10.5446/58690
- Letzte Aktualisierung
-
04.12.2024, 08:09 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Technische Informationsbibliothek (TIB). Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Objekttyp
- zweidimensionales bewegtes Bild
Beteiligte
- Kalinowski, Rafal
- Pilśniak, Monika
- Banff International Research Station (BIRS) for Mathematical Innovation and Discovery
Entstanden
- 2018-01-01
Ähnliche Objekte (12)
Distinguishing Sierpiński products of graphs
A new ray distinguishing concept with applications to symmetries of locally finite graphs
Distinguishing numbers of infinite graphs with bounded degrees
Distinguishing vertices of a graph: automorphisms and palettes
Distinguishing number of vertex-transitive graphs of valency 4
The number of different distinguishing colorings of a graph
Finite time bounds for Simulated Annealing
Distinguishing and witnessing dense structures in graphs and abstract separation systems
Intrinsic Discretization Error Bounds for Geodesic Finite Elements
Bound states of anti-nucleons in finite nuclei
Degree bounds for the circumference of graphs
Rigorous error bounds for finite dimensional linear programming problems
Distinguishing Sierpiński products of graphs
A new ray distinguishing concept with applications to symmetries of locally finite graphs
Distinguishing numbers of infinite graphs with bounded degrees
Distinguishing vertices of a graph: automorphisms and palettes
Distinguishing number of vertex-transitive graphs of valency 4
The number of different distinguishing colorings of a graph
Finite time bounds for Simulated Annealing
Distinguishing and witnessing dense structures in graphs and abstract separation systems
Intrinsic Discretization Error Bounds for Geodesic Finite Elements
Bound states of anti-nucleons in finite nuclei
Degree bounds for the circumference of graphs
Rigorous error bounds for finite dimensional linear programming problems
Distinguishing Sierpiński products of graphs
A new ray distinguishing concept with applications to symmetries of locally finite graphs
Distinguishing numbers of infinite graphs with bounded degrees
Distinguishing vertices of a graph: automorphisms and palettes
Distinguishing number of vertex-transitive graphs of valency 4
The number of different distinguishing colorings of a graph
Finite time bounds for Simulated Annealing
Distinguishing and witnessing dense structures in graphs and abstract separation systems
Intrinsic Discretization Error Bounds for Geodesic Finite Elements
Bound states of anti-nucleons in finite nuclei
Degree bounds for the circumference of graphs