- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Dimensions
-
21 cm
- Extent
-
6 S.
- Language
-
Deutsch
- Notes
-
graph. Darst.
Literaturangaben
- Bibliographic citation
-
Berichte aus dem Department für Informatik der Fakultät II - Informatik, Wirtschafts- und Rechtswissenschaften / Carl von Ossietzky Universität Oldenburg ; Nr. [20]13,04
- Classification
-
Informatik
- Event
-
Veröffentlichung
- (where)
-
Oldenburg
- (who)
-
Univ., Fak. II, Dep. für Informatik
- (when)
-
2013
- Creator
- Table of contents
- Rights
-
Bei diesem Objekt liegt nur das Inhaltsverzeichnis digital vor. Der Zugriff darauf ist unbeschränkt möglich.
- Last update
-
11.03.2025, 12:28 PM CET
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Stiege, Günther
- Univ., Fak. II, Dep. für Informatik
Time of origin
- 2013
Other Objects (12)
Knuth graphs
Vertex labellings of simple graphs
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex models on random graphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Convexity in graphs: vertex order characterisations and graph searching
The costs of symmetry breaking vertex-transitive cubic graphs
On Vertex-Edge-Critically n-Connected Graphs
A note on vertex colorings of plane graphs
Distinguishing vertices of a graph: automorphisms and palettes
Declarative Graph Algorithms via Knuth-Bendix Completion
Knuth graphs
Vertex labellings of simple graphs
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex models on random graphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Convexity in graphs: vertex order characterisations and graph searching
The costs of symmetry breaking vertex-transitive cubic graphs
On Vertex-Edge-Critically n-Connected Graphs
A note on vertex colorings of plane graphs
Distinguishing vertices of a graph: automorphisms and palettes
Declarative Graph Algorithms via Knuth-Bendix Completion
Knuth graphs
Vertex labellings of simple graphs
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex models on random graphs
Independent colorful vertex sets in large dynamic vertex colored conflict graphs
Convexity in graphs: vertex order characterisations and graph searching
The costs of symmetry breaking vertex-transitive cubic graphs
On Vertex-Edge-Critically n-Connected Graphs
A note on vertex colorings of plane graphs
Distinguishing vertices of a graph: automorphisms and palettes