Hamiltonicity in multitriangular graphs

to connected objects

Location: Deutsche Nationalbibliothek Frankfurt am Main

Extent: Online-Ressource

Language: Englisch

Bibliographic citation: In: Discussiones mathematicae(15, 1995), H. 1, S.77-88

Event: Veröffentlichung

(where): Ilmenau

(who): TU Ilmenau

(when): 1995

Creator: Owens, Peter J.
Walther, Hansjoachim

DOI: 10.7151/dmgt.1009

URN: urn:nbn:de:gbv:ilm1-2020200016

Rights: Der Zugriff auf das Objekt ist unbeschränkt möglich.

Last update: 25.03.2025, 1:44 PM CET

Data provider

This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.

Show original at data provider

Associated

Owens, Peter J.
Walther, Hansjoachim
TU Ilmenau

Time of origin

1995

Other Objects (12)

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Cultural heritage institutions wishing to register will find more information here.

Fields marked * need to be filled in.

Username*

Please enter your username

Email*

Please enter your email address

Please do not fill this field

First name

Last name

Password*

Please enter your password

Confirm password*

Please enter the same password

I have read the terms of use and the privacy policy for the collection of personal data and accept them. *

This field is required.

I would like to subscribe to the newsletter of the Deutsche Digitale Bibliothek. See newsletter subscription info.

Account created

Your "My DDB" account has been successfully created. Before you can log in to your account, you must click the confirmation link in the message we just sent to the email address you provided.

Hamiltonicity in multitriangular graphs

Object Details

References and Relationships

Contributors, Places and Time

Further information

Data provider

Associated

Time of origin

Other Objects (12)

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Some news about the independence number of a graph

On short cycles through prescribed vertices of a polyhedral graph

Lightweight paths in graphs

On domination in graphs

Hamiltonicity of graphs perturbed by a random regular graph

On the H-force number of Hamiltonian graphs and cycle extendability

On double domination in graphs

A note on domination in bipartite graphs

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2012

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Modulhandbuch Master Research in Computer & Systems Engineering : Studienordnungsversion: 2016

Related objects

Reset password