Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs

A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs 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. http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png Mathematics in Computer Science Springer Journals

A Note on Degree Conditions for Traceability in Locally Claw-Free Graphs

Loading next page...
 
/lp/springer-journals/a-note-on-degree-conditions-for-traceability-in-locally-claw-free-VpnCVP1Qcx

References (7)

Publisher
Springer Journals
Copyright
Copyright © 2011 by Springer Basel AG
Subject
Mathematics; Mathematics, general; Computer Science, general
ISSN
1661-8270
eISSN
1661-8289
DOI
10.1007/s11786-011-0074-5
Publisher site
See Article on Publisher Site

Abstract

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.

Journal

Mathematics in Computer ScienceSpringer Journals

Published: Oct 12, 2011

There are no references for this article.