- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Discussiones mathematicae(19, 1999), H. 2, S.159-166
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2020
- Urheber
- DOI
-
10.7151/dmgt.1092
- URN
-
urn:nbn:de:gbv:ilm1-2020200032
- Rechteinformation
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Letzte Aktualisierung
-
25.03.2025, 13:41 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
- Borowiecki, Mieczysław
- Mihók, Peter
- Tuza, Zsolt
- Voigt, Margit
- TU Ilmenau
Entstanden
- 2020
Ähnliche Objekte (12)
Paths of low weight in planar graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
On longest cycles in essentially 4-connected planar graphs
Longer cycles in essentially 4-connected planar graphs
Some news about the independence number of a graph
On short cycles through prescribed vertices of a polyhedral graph
On the H-force number of Hamiltonian graphs and cycle extendability
Hamiltonicity of graphs perturbed by a random regular graph
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs
On domination in graphs
On double domination in graphs
Paths of low weight in planar graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
On longest cycles in essentially 4-connected planar graphs
Longer cycles in essentially 4-connected planar graphs
Some news about the independence number of a graph
On short cycles through prescribed vertices of a polyhedral graph
On the H-force number of Hamiltonian graphs and cycle extendability
Hamiltonicity of graphs perturbed by a random regular graph
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs
On domination in graphs
On double domination in graphs
Paths of low weight in planar graphs
Longest cycles in cyclically 4-edge-connected cubic planar graphs
On longest cycles in essentially 4-connected planar graphs
Longer cycles in essentially 4-connected planar graphs
Some news about the independence number of a graph
On short cycles through prescribed vertices of a polyhedral graph
On the H-force number of Hamiltonian graphs and cycle extendability
Hamiltonicity of graphs perturbed by a random regular graph
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs
On domination in graphs