다음과 같은 기능을 한번의 로그인으로 사용 할 수 있습니다.
NTIS 바로가기
Journal of combinatorial theory. Series B, v.128, 2018년, pp.66 - 95
Liu, Chun-Hung (Department of Mathematics, Princeton University, Princeton, NJ 08544, USA) , Ma, Jie (School of Mathematical Sciences, University of Science and Technology of China, Hefei, Anhui 230026, China)
AI-Helper
Abstract There has been extensive research on cycle lengths in graphs with large minimum degree. In this paper, we obtain several results that are tight in this area. Let G be a graph with minimum degree at least k + 1 . We prove that if G is bipartite, then there are k cycles in G whose lengths f...
J. Graph Theory Alon 10 123 1986 10.1002/jgt.3190100115 The largest cycle of a graph with a large minimal degree
Bull. Lond. Math. Soc. Bollobás 9 97 1977 10.1112/blms/9.1.97 Cycles modulo k
Bollobás 1989 A Tribute to Paul Erdős The circumference of a graph with given minimal degree
J. Combin. Theory Ser. B Bondy 11 80 1971 10.1016/0095-8956(71)90016-5 Pancyclic graphs I
Bondy vol. 244 2008 978-1-84628-969-9 Graph Theory
J. Combin. Theory Ser. B Bondy 16 97 1974 10.1016/0095-8956(74)90052-5 Cycles of even length in graphs
J. Graph Theory Bondy 27 11 1998 10.1002/(SICI)1097-0118(199801)27:1<11::AID-JGT3>3.0.CO;2-J Cycles in a graph whose lengths differ by one or two
J. Graph Theory Brandt 27 141 1998 10.1002/(SICI)1097-0118(199803)27:3<141::AID-JGT3>3.0.CO;2-O Weakly pancyclic graphs
J. Combin. Theory Ser. B Chen 115 210 2015 10.1016/j.jctb.2015.06.001 Coloring digraphs with forbidden cycles
J. Combin. Theory Ser. B Chen 60 277 1994 10.1006/jctb.1994.1019 Graphs with a cycle of length divisible by three
Discrete Math. Dean 121 37 1993 10.1016/0012-365X(93)90535-2 Cycles of length 0 modulo 4 in graphs
Proc. Lond. Math. Soc. Dirac 2 69 1952 10.1112/plms/s3-2.1.69 Some theorems on abstract graphs
J. Graph Theory Diwan 65 246 2010 10.1002/jgt.20477 Cycles of even lengths modulo k
Combinatorica Diwan 33 319 2013 10.1007/s00493-013-2542-9 Circumference, chromatic number and online coloring
Erdős 3 1976 Proc. Seventh S-E Conf. Combinatorics, Graph Theory and Computing Some recent problems and results in graph theory, combinatorics, and number theory
Matematiche (Catania) Erdős 47 231 1992 Some of my favourite problems in various branches of combinatorics
Quaest. Math. Erdős 16 333 1993 10.1080/16073606.1993.9631741 Some of my favorite solved and unsolved problems in graph theory
Erdős 407 1991 Graph Theory, Combinatorics, and Applications, vol. 1 Odd cycles in graphs of given minimum degree
Acta Math. Sci. Hungar. Erdős 17 61 1966 10.1007/BF02020444 On chromatic numbers of graphs and set systems
J. Combin. Theory Ser. B Fan 84 187 2002 10.1006/jctb.2001.2071 Distribution of cycle lengths in graphs
Discrete Math. Gyárfás 103 41 1992 10.1016/0012-365X(92)90037-G Graphs with k odd cycle lengths
Graphs Combin. Gould 18 491 2002 10.1007/s003730200035 A note on cycle lengths in graphs
Häggkvist vol. 62 89 1982 Graph Theory Odd cycles of specified length in nonbipartite graphs
Häggkvist 1998 Arithmetic Progressions of Cycles
R. Häggkvist, A. Scott, Cycles of nearly equal length in cubic graphs, Preprint.
Combinatorica Kostochka 37 3 481 2017 10.1007/s00493-015-3262-0 Cycles in triangle-free graphs of large chromatic number
Monatsh. Math. Krusenstjerna-Hafstrøm 89 101 1980 10.1007/BF01476588 Special subdivisions of K4 and 4-chromatic graphs
European J. Combin. Ma 52 74 2016 10.1016/j.ejc.2015.09.002 Cycles with consecutive odd lengths
Discrete Math. Mihók 286 147 2004 10.1016/j.disc.2003.11.055 Cycle lengths and chromatic number of graphs
J. Graph Theory Nikiforov 47 39 2004 10.1002/jgt.20015 Paths and cycles in graph of large minimal degree
J. Graph Theory Nikiforov 52 157 2006 10.1002/jgt.20151 Cycle lengths in graphs with large minimum degree
Combinatorica Sudakov 28 357 2008 10.1007/s00493-008-2300-6 Cycle lengths in sparse graphs
Electron. J. Combin. Sudakov 24 1 2017 10.37236/6257 The extremal function for cycles of length l mod k
J. Graph Theory Thomassen 7 261 1983 10.1002/jgt.3190070215 Graph decomposition with applications to subdivisions and path systems modulo k
Thomassen 97 1988 Selected Topics in Graph Theory, vol. 3 Paths, circuits and subdivisions
J. Combin. Theory Ser. B Thomassen 31 199 1981 10.1016/S0095-8956(81)80025-1 Non-separating induced cycles in graphs
Combin. Probab. Comput. Verstraëte 9 369 2000 10.1017/S0963548300004478 On arithmetic progressions of cycle lengths in graphs
Wiss. Z. - Tech. Hochsch. Ilmenau Voss 23 57 1977 Maximale gerade und ungerade Kreise in Graphen I
*원문 PDF 파일 및 링크정보가 존재하지 않을 경우 KISTI DDS 시스템에서 제공하는 원문복사서비스를 사용할 수 있습니다.
저자가 공개 리포지터리에 출판본, post-print, 또는 pre-print를 셀프 아카이빙 하여 자유로운 이용이 가능한 논문
Copyright KISTI. All Rights Reserved.
※ AI-Helper는 부적절한 답변을 할 수 있습니다.