Skip to main content
Journal ArticleOPEN ACCESS

9-Connected Claw-Free Graphs Are Hamilton-Connected

Journal of Combinatorial Theory. Series B (1999) 75(2) 167-173
DOI: 10.1006/jctb.1998.1871
16Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

A graph is Hamilton-connected if any pair of vertices is joined by a hamiltonian path. In this note it is shown that 9-connected graphs which contain no induced clawK1,3are Hamilton-connected, by reformulating and localizing a closure concept due to Ryjáček, which turns claw-free graphs into line graphs. © 1999 Academic Press.

Cite

CITATION STYLE

APA

Brandt, S. (1999). 9-Connected Claw-Free Graphs Are Hamilton-Connected. Journal of Combinatorial Theory. Series B, 75(2), 167–173. https://doi.org/10.1006/jctb.1998.1871

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free