- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Anmerkungen
-
Ulm, Universität Ulm, Dissertation, 2023
- Schlagwort
-
Graph
Graphentheorie
Ramsey-Theorie
- DOI
-
10.18725/OPARU-49331
- URN
-
urn:nbn:de:bsz:289-oparu-49407-8
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:53 MEZ
Datenpartner
Dieses Objekt wird bereitgestellt von:
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Deutsche Nationalbibliothek. Bei Fragen zum Objekt wenden Sie sich bitte an den Datenpartner.
Beteiligte
- Pardey, Johannes
- Universität Ulm
Entstanden
- 2023
Ähnliche Objekte (12)
Critical edges in perfect graphs
Edge partitions in undirected graphs
Cutting-edge concepts in perinatal brain damage
Contractible edges in locally finite graphs
Shortest edge disjoint paths in graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Signed Roman edge k-domination in graphs
Repeated patterns in properly edge-coloured graphs
Edge search in graphs using incidence tests
On Vertex-Edge-Critically n-Connected Graphs
Edge Label Placement in Layered Graph Drawing
Multi-Edge Graph Visualizations for Fostering Software Comprehension
Critical edges in perfect graphs
Edge partitions in undirected graphs
Cutting-edge concepts in perinatal brain damage
Contractible edges in locally finite graphs
Shortest edge disjoint paths in graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Signed Roman edge k-domination in graphs
Repeated patterns in properly edge-coloured graphs
Edge search in graphs using incidence tests
On Vertex-Edge-Critically n-Connected Graphs
Edge Label Placement in Layered Graph Drawing
Multi-Edge Graph Visualizations for Fostering Software Comprehension
Critical edges in perfect graphs
Edge partitions in undirected graphs
Cutting-edge concepts in perinatal brain damage
Contractible edges in locally finite graphs
Shortest edge disjoint paths in graphs
Sufficient conditions for maximally edge-connected and super-edge-connected graphs
Signed Roman edge k-domination in graphs
Repeated patterns in properly edge-coloured graphs
Edge search in graphs using incidence tests
On Vertex-Edge-Critically n-Connected Graphs
Edge Label Placement in Layered Graph Drawing