- Standort
-
Deutsche Nationalbibliothek Frankfurt am Main
- Umfang
-
Online-Ressource
- Sprache
-
Englisch
- Erschienen in
-
In: Discussiones mathematicae(34, 2014), H. 4, S.849-855
- Ereignis
-
Veröffentlichung
- (wo)
-
Ilmenau
- (wer)
-
TU Ilmenau
- (wann)
-
2014
- Urheber
- DOI
-
10.7151/dmgt.1771
- URN
-
urn:nbn:de:101:1-2020021702082453336075
- 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
- Fabrici, Igor
- Jendrol', Stanislav
- Harant, Jochen
- Soták, Roman
- TU Ilmenau
Entstanden
- 2014
Ähnliche Objekte (12)
On short cycles through prescribed vertices of a polyhedral graph
Computing vertex-disjoint paths in large graphs using MAOs
On long cycles through four prescribed vertices of a polyhedral graph
A note on domination in bipartite graphs
On vertices enforcing a Hamiltonian cycle
Some news about the independence number of a graph
Hamiltonicity of graphs perturbed by a random regular graph
A note on Barnette's conjecture
On the H-force number of Hamiltonian graphs and cycle extendability
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs
On domination in graphs
On short cycles through prescribed vertices of a polyhedral graph
Computing vertex-disjoint paths in large graphs using MAOs
On long cycles through four prescribed vertices of a polyhedral graph
A note on domination in bipartite graphs
On vertices enforcing a Hamiltonian cycle
Some news about the independence number of a graph
Hamiltonicity of graphs perturbed by a random regular graph
A note on Barnette's conjecture
On the H-force number of Hamiltonian graphs and cycle extendability
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs
On domination in graphs
On short cycles through prescribed vertices of a polyhedral graph
Computing vertex-disjoint paths in large graphs using MAOs
On long cycles through four prescribed vertices of a polyhedral graph
A note on domination in bipartite graphs
On vertices enforcing a Hamiltonian cycle
Some news about the independence number of a graph
Hamiltonicity of graphs perturbed by a random regular graph
A note on Barnette's conjecture
On the H-force number of Hamiltonian graphs and cycle extendability
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs