- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Discussiones mathematicae(25, 2005), H. 3, S.419-426
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2005
- Urheber
-
Hexel, Erhard
- DOI
-
10.7151/dmgt.1293
- URN
-
urn:nbn:de:gbv:ilm1-2020200129
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:48 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
- Hexel, Erhard
- TU Ilmenau
Entstanden
- 2005
Ähnliche Objekte (12)
On long cycles through four prescribed vertices of a polyhedral graph
Short disjoint cycles in cubic bridgeless graphs
Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments
Geometric Graphs: Reachability, Long Trees and Short Cycles
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex labellings of simple 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
Vertex coloring the complements of Knuth graphs
On Vertex-Edge-Critically n-Connected Graphs
On long cycles through four prescribed vertices of a polyhedral graph
Short disjoint cycles in cubic bridgeless graphs
Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments
Geometric Graphs: Reachability, Long Trees and Short Cycles
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex labellings of simple 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
Vertex coloring the complements of Knuth graphs
On Vertex-Edge-Critically n-Connected Graphs
On long cycles through four prescribed vertices of a polyhedral graph
Short disjoint cycles in cubic bridgeless graphs
Hamiltonian cycles in certain graphs and out-arc pancyclic vertices in tournaments
Geometric Graphs: Reachability, Long Trees and Short Cycles
Vertex reconstruction in Cayley graphs
Vertex models on random graphs
Vertex labellings of simple 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
Vertex coloring the complements of Knuth graphs