The Existence of Spanning Ended System on Claw-Free Graphs
Joint Authors
Chen, Xiaodong
Xu, Meijin
Liu, Yan-Jun
Source
Mathematical Problems in Engineering
Issue
Vol. 2016, Issue 2016 (31 Dec. 2016), pp.1-4, 4 p.
Publisher
Hindawi Publishing Corporation
Publication Date
2016-09-20
Country of Publication
Egypt
No. of Pages
4
Main Subjects
Abstract EN
We prove that every connected claw-free graph G contains a spanning k-ended system if and only if cl(G) contains a spanning k-ended system, where cl(G) denotes Ryjáček closure of G.
American Psychological Association (APA)
Chen, Xiaodong& Xu, Meijin& Liu, Yan-Jun. 2016. The Existence of Spanning Ended System on Claw-Free Graphs. Mathematical Problems in Engineering،Vol. 2016, no. 2016, pp.1-4.
https://search.emarefa.net/detail/BIM-1112389
Modern Language Association (MLA)
Chen, Xiaodong…[et al.]. The Existence of Spanning Ended System on Claw-Free Graphs. Mathematical Problems in Engineering No. 2016 (2016), pp.1-4.
https://search.emarefa.net/detail/BIM-1112389
American Medical Association (AMA)
Chen, Xiaodong& Xu, Meijin& Liu, Yan-Jun. The Existence of Spanning Ended System on Claw-Free Graphs. Mathematical Problems in Engineering. 2016. Vol. 2016, no. 2016, pp.1-4.
https://search.emarefa.net/detail/BIM-1112389
Data Type
Journal Articles
Language
English
Notes
Includes bibliographical references
Record ID
BIM-1112389
