Access the full text.
Sign up today, get DeepDyve free for 14 days.
O. Kovárík, M. Mulac, Z. Ryjáček (2002)
A note on degree conditions for hamiltonicity in 2-connected claw-free graphsDiscret. Math., 244
D. Froncek, Z. Ryjáček, Z. Skupien (2004)
On traceability and 2-factors in claw-free graphsDiscuss. Math. Graph Theory, 24
G. Dirac (1952)
Some Theorems on Abstract GraphsProceedings of The London Mathematical Society
Roman Cada, E. Flandrin, Hao Li, Z. Ryjáček (2004)
Cycles through given vertices and closuresDiscret. Math., 276
Roman Ada (2008)
The *-closure for graphs and claw-free graphsDiscrete Mathematics, 308
W. Frydrych, Z. Skupien (1998)
Non-traceability of large connected claw-free graphsJ. Graph Theory, 27
Zdeněk Ryjáčk (1997)
On a Closure Concept in Claw-Free GraphsJournal of Combinatorial Theory, Series B, 70
We say that a set S of vertices is traceable in a graph G whenever there is a path in G containing all vertices of S. In this paper we study the problem of traceability of a prescribed set of vertices in a locally claw-free graph (i.e. a graph in which some specified vertices are not centers of an induced claw). In particular we give sufficient degree conditions restricted to the given set S of vertices for the traceability of S.
Mathematics in Computer Science – Springer Journals
Published: Oct 12, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.