Back to Search
Start Over
An analogue of Dirac’s theorem on circular super-critical graphs
- Source :
-
European Journal of Combinatorics . May2007, Vol. 28 Issue 4, p1270-1275. 6p. - Publication Year :
- 2007
-
Abstract
- Abstract: A graph is called circular super-critical if for every vertex of . In this paper, analogous to a result of Dirac on chromatic critical graphs, a sharp lower bound on the vertex degree of circular super-critical graphs is proved. This lower bound provides a partial answer to a question of X. Zhu [The circular chromatic number of induced subgraphs, J. Combin. Theory Ser. B 92 (2004) 177–181]. Some other structural properties of circular super-critical graphs are also presented. [Copyright &y& Elsevier]
- Subjects :
- *GRAPH theory
*COMBINATORICS
*ALGEBRA
*MATHEMATICS
Subjects
Details
- Language :
- English
- ISSN :
- 01956698
- Volume :
- 28
- Issue :
- 4
- Database :
- Academic Search Index
- Journal :
- European Journal of Combinatorics
- Publication Type :
- Academic Journal
- Accession number :
- 24298008
- Full Text :
- https://doi.org/10.1016/j.ejc.2006.01.012