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...

Full description

Saved in:
Bibliographic Details
Published in:Mathematics in computer science 2011-03, Vol.5 (1), p.21-25
Main Authors: Čada, Roman, Flandrin, Evelyne, Kang, Haiyan
Format: Article
Language:English
Subjects:
Computer Science
Mathematics
Mathematics and Statistics
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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 .
ISSN:1661-8270
1661-8289
DOI:10.1007/s11786-011-0074-5