Citations: An nc algorithm to recognize hhd-free graphs

Views

CrossRef citations to date

Altmetric

Citations (2)

Keep up to date with the latest research on this topic with citation updates for this article.

Read on this site (1)

Feodor F. Dragan, Falk Nicolai & Andreas Brandstädt. (1998) Powers of hhd-free graphs . International Journal of Computer Mathematics 69:3-4, pages 217-242.
Read now

Articles from other publishers (1)

Andreas Brandstädt, Van Bang Le & Thomas Szymczak. (1997) Duchet-type theorems for powers of HHD-free graphs. Discrete Mathematics 177:1-3, pages 9-16.
Crossref

Reprints and Corporate Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

To request a reprint or corporate permissions for this article, please click on the relevant link below:

Order Reprints Request Corporate Permissions

Academic Permissions

Please note: Selecting permissions does not provide access to the full text of the article, please see our help page How do I view content?

Obtain permissions instantly via Rightslink by clicking on the button below:

Request Academic Permissions

If you are unable to obtain permissions via Rightslink, please complete and submit this Permissions form. For more information, please visit our Permissions help page.

An nc algorithm to recognize hhd-free graphs

Articles from other publishers (1)

Information for

Open access

Opportunities

Help and information

Your download is now in progress and you may close this window

Login or register to access this feature

An nc algorithm to recognize hhd-free graphs

Citations (2)

Read on this site (1)

Articles from other publishers (1)

Reprints and Corporate Permissions

Academic Permissions

Related research

To cite this article:

Download citation

Information for

Open access

Opportunities

Help and information

Keep up to date