- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Bibliographic citation
-
In: Discussiones mathematicae(34, 2014), H. 4, S.849-855
- Event
-
Veröffentlichung
- (where)
-
Ilmenau
- (who)
-
TU Ilmenau
- (when)
-
2014
- Creator
- DOI
-
10.7151/dmgt.1771
- URN
-
urn:nbn:de:101:1-2020021702082453336075
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
25.03.2025, 1:53 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
- Fabrici, Igor
- Jendrol', Stanislav
- Harant, Jochen
- Soták, Roman
- TU Ilmenau
Time of origin
- 2014
Other Objects (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
On the H-force number of Hamiltonian graphs and cycle extendability
A note on Barnette's conjecture
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
On the H-force number of Hamiltonian graphs and cycle extendability
A note on Barnette's conjecture
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
On the H-force number of Hamiltonian graphs and cycle extendability
A note on Barnette's conjecture
Lightweight paths in graphs
Hamiltonicity in multitriangular graphs