CSpace
Odd wheels in graphs
Xu, BG; Jin, GP; Liu, ZH
2002-03-01
Source PublicationJOURNAL OF COMBINATORIAL THEORY SERIES B
ISSN0095-8956
Volume84Issue:2Pages:213-224
AbstractFor k greater than or equal to 1 the odd it-heel of 2k + 1 spokes, denoted by W2k+1 is the graph obtained from a cycle of length 2k + 1 by adding a new vertex and joining it to all vertices of the cycle. In this paper it is shown that if a graph G of order n with minimum degree greater than 7n/12 is at least 4-chromatic then G contains an odd wheel with at most 5 spokes. (C) 2001 Elsevier Science (USA).
DOI10.1006/jctb.2001.2073
Language英语
WOS Research AreaMathematics
WOS SubjectMathematics
WOS IDWOS:000174627100003
PublisherACADEMIC PRESS INC ELSEVIER SCIENCE
Citation statistics
Cited Times:1[WOS]   [WOS Record]     [Related Records in WOS]
Document Type期刊论文
Identifierhttp://ir.amss.ac.cn/handle/2S8OKBNM/17843
Collection中国科学院数学与系统科学研究院
Affiliation1.Chinese Acad Sci, Inst Policy & Management, Beijing 100080, Peoples R China
2.Univ Cambridge, Dept Pure Math & Math Stat, Cambridge CB2 1SB, England
3.Chinese Acad Sci, Inst Syst Sci, Beijing 100080, Peoples R China
Recommended Citation
GB/T 7714
Xu, BG,Jin, GP,Liu, ZH. Odd wheels in graphs[J]. JOURNAL OF COMBINATORIAL THEORY SERIES B,2002,84(2):213-224.
APA Xu, BG,Jin, GP,&Liu, ZH.(2002).Odd wheels in graphs.JOURNAL OF COMBINATORIAL THEORY SERIES B,84(2),213-224.
MLA Xu, BG,et al."Odd wheels in graphs".JOURNAL OF COMBINATORIAL THEORY SERIES B 84.2(2002):213-224.
Files in This Item:
There are no files associated with this item.
Related Services
Recommend this item
Bookmark
Usage statistics
Export to Endnote
Google Scholar
Similar articles in Google Scholar
[Xu, BG]'s Articles
[Jin, GP]'s Articles
[Liu, ZH]'s Articles
Baidu academic
Similar articles in Baidu academic
[Xu, BG]'s Articles
[Jin, GP]'s Articles
[Liu, ZH]'s Articles
Bing Scholar
Similar articles in Bing Scholar
[Xu, BG]'s Articles
[Jin, GP]'s Articles
[Liu, ZH]'s Articles
Terms of Use
No data!
Social Bookmark/Share
All comments (0)
No comment.
 

Items in the repository are protected by copyright, with all rights reserved, unless otherwise indicated.