Cordero-Michel, Narda; Galeana-Sánchez, Hortensia Congruence of cycle lengths and chromatic number. (English) Zbl 07793912 J. Graph Theory 105, No. 2, 239-251 (2024). MSC: 05C15 05C38 05C12 05C85 PDFBibTeX XMLCite \textit{N. Cordero-Michel} and \textit{H. Galeana-Sánchez}, J. Graph Theory 105, No. 2, 239--251 (2024; Zbl 07793912) Full Text: DOI
Bernshteyn, Anton; Lee, Eugene Weak degeneracy of graphs. (English) Zbl 1522.05093 J. Graph Theory 103, No. 4, 607-634 (2023). MSC: 05C15 05C85 05C07 05C35 PDFBibTeX XMLCite \textit{A. Bernshteyn} and \textit{E. Lee}, J. Graph Theory 103, No. 4, 607--634 (2023; Zbl 1522.05093) Full Text: DOI arXiv
Bucić, Matija; Khamseh, Amir The \((t-1)\)-chromatic Ramsey number for paths. (English) Zbl 1522.05288 J. Graph Theory 102, No. 4, 784-796 (2023). MSC: 05C55 05D10 PDFBibTeX XMLCite \textit{M. Bucić} and \textit{A. Khamseh}, J. Graph Theory 102, No. 4, 784--796 (2023; Zbl 1522.05288) Full Text: DOI arXiv OA License
Attias, Inon; Haviv, Ishay Local orthogonality dimension. (English) Zbl 1522.05324 J. Graph Theory 104, No. 2, 387-419 (2023). MSC: 05C62 05C15 PDFBibTeX XMLCite \textit{I. Attias} and \textit{I. Haviv}, J. Graph Theory 104, No. 2, 387--419 (2023; Zbl 1522.05324) Full Text: DOI arXiv
Zayat, Soukaina; Ghazal, Salman Erdös-Hajnal conjecture for new infinite families of tournaments. (English) Zbl 1522.05169 J. Graph Theory 102, No. 2, 388-417 (2023). MSC: 05C20 05C75 PDFBibTeX XMLCite \textit{S. Zayat} and \textit{S. Ghazal}, J. Graph Theory 102, No. 2, 388--417 (2023; Zbl 1522.05169) Full Text: DOI arXiv
Lewandowski, Mikołaj; Polcyn, Joanna; Reiher, Christian Two disjoint cycles in digraphs. (English) Zbl 1522.05229 J. Graph Theory 104, No. 3, 461-469 (2023). MSC: 05C35 05C38 05C20 PDFBibTeX XMLCite \textit{M. Lewandowski} et al., J. Graph Theory 104, No. 3, 461--469 (2023; Zbl 1522.05229) Full Text: DOI arXiv
Bradshaw, Peter; Masařík, Tomáš; Stacho, Ladislav Flexible list colorings in graphs with special degeneracy conditions. (English) Zbl 1522.05097 J. Graph Theory 101, No. 4, 717-745 (2022). MSC: 05C15 05C05 05C10 PDFBibTeX XMLCite \textit{P. Bradshaw} et al., J. Graph Theory 101, No. 4, 717--745 (2022; Zbl 1522.05097) Full Text: DOI arXiv
McDonald, Jessica; Puleo, Gregory J. Strong coloring 2-regular graphs: cycle restrictions and partial colorings. (English) Zbl 1522.05132 J. Graph Theory 100, No. 4, 653-670 (2022). MSC: 05C15 05C69 05C38 05C12 PDFBibTeX XMLCite \textit{J. McDonald} and \textit{G. J. Puleo}, J. Graph Theory 100, No. 4, 653--670 (2022; Zbl 1522.05132) Full Text: DOI arXiv
Fox, Jacob; He, Xiaoyu; Luo, Sammy; Xu, Max Wenqiang Multicolor list Ramsey numbers grow exponentially. (English) Zbl 1522.05485 J. Graph Theory 101, No. 3, 389-396 (2022). MSC: 05D10 05C55 05C15 PDFBibTeX XMLCite \textit{J. Fox} et al., J. Graph Theory 101, No. 3, 389--396 (2022; Zbl 1522.05485) Full Text: DOI arXiv
Scott, Alex; Seymour, Paul; Spirkl, Sophie Polynomial bounds for chromatic number. III. Excluding a double star. (English) Zbl 1521.05047 J. Graph Theory 101, No. 2, 323-340 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Scott} et al., J. Graph Theory 101, No. 2, 323--340 (2022; Zbl 1521.05047) Full Text: DOI arXiv
Scott, Alex; Seymour, Paul; Spirkl, Sophie Polynomial bounds for chromatic number. II: Excluding a star-forest. (English) Zbl 1521.05046 J. Graph Theory 101, No. 2, 318-322 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Scott} et al., J. Graph Theory 101, No. 2, 318--322 (2022; Zbl 1521.05046) Full Text: DOI arXiv
Li, Xihe; Broersma, Hajo; Wang, Ligong The Erdős-Gyárfás function with respect to Gallai-colorings. (English) Zbl 1522.05295 J. Graph Theory 101, No. 2, 242-264 (2022). MSC: 05C55 05D10 05C15 PDFBibTeX XMLCite \textit{X. Li} et al., J. Graph Theory 101, No. 2, 242--264 (2022; Zbl 1522.05295) Full Text: DOI arXiv OA License
Gujgiczer, Anna; Simonyi, Gábor On multichromatic numbers of widely colorable graphs. (English) Zbl 1522.05118 J. Graph Theory 100, No. 2, 346-361 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{A. Gujgiczer} and \textit{G. Simonyi}, J. Graph Theory 100, No. 2, 346--361 (2022; Zbl 1522.05118) Full Text: DOI arXiv
Savery, Michael Chromatic number is Ramsey distinguishing. (English) Zbl 1522.05490 J. Graph Theory 99, No. 1, 152-161 (2022). MSC: 05D10 05C55 05C15 PDFBibTeX XMLCite \textit{M. Savery}, J. Graph Theory 99, No. 1, 152--161 (2022; Zbl 1522.05490) Full Text: DOI arXiv
Daneshpajouh, Hamid Reza; Meunier, Frédéric; Mizrahi, Guilhem Colorings of complements of line graphs. (English) Zbl 1522.05106 J. Graph Theory 98, No. 2, 216-233 (2021). MSC: 05C15 05C76 68Q17 PDFBibTeX XMLCite \textit{H. R. Daneshpajouh} et al., J. Graph Theory 98, No. 2, 216--233 (2021; Zbl 1522.05106) Full Text: DOI arXiv
Łuczak, Tomasz; Polcyn, Joanna; Reiher, Christian Andrásfai and Vega graphs in Ramsey-Turán theory. (English) Zbl 1522.05232 J. Graph Theory 98, No. 1, 57-80 (2021). MSC: 05C35 05C15 05C75 PDFBibTeX XMLCite \textit{T. Łuczak} et al., J. Graph Theory 98, No. 1, 57--80 (2021; Zbl 1522.05232) Full Text: DOI arXiv OA License
Axenovich, Maria; Tompkins, Casey; Weber, Lea Large homogeneous subgraphs in bipartite graphs with forbidden induced subgraphs. (English) Zbl 1521.05119 J. Graph Theory 97, No. 1, 34-46 (2021). MSC: 05C60 05C70 05C38 PDFBibTeX XMLCite \textit{M. Axenovich} et al., J. Graph Theory 97, No. 1, 34--46 (2021; Zbl 1521.05119) Full Text: DOI
Gyárfás, András; Lehel, Jenő Order plus size of \(\tau\)-critical graphs. (English) Zbl 1521.05081 J. Graph Theory 96, No. 1, 85-86 (2021). MSC: 05C35 PDFBibTeX XMLCite \textit{A. Gyárfás} and \textit{J. Lehel}, J. Graph Theory 96, No. 1, 85--86 (2021; Zbl 1521.05081) Full Text: DOI
Kierstead, H. A.; Kostochka, A. V.; McConvey, A. Strengthening theorems of Dirac and Erdős on disjoint cycles. (English) Zbl 1368.05079 J. Graph Theory 85, No. 4, 788-802 (2017). MSC: 05C38 05C07 05C35 05C10 PDFBibTeX XMLCite \textit{H. A. Kierstead} et al., J. Graph Theory 85, No. 4, 788--802 (2017; Zbl 1368.05079) Full Text: DOI arXiv
Carraher, James M.; Kinnersley, William B.; Reiniger, Benjamin; West, Douglas B. The game saturation number of a graph. (English) Zbl 1365.05195 J. Graph Theory 85, No. 2, 481-495 (2017). MSC: 05C57 91A43 PDFBibTeX XMLCite \textit{J. M. Carraher} et al., J. Graph Theory 85, No. 2, 481--495 (2017; Zbl 1365.05195) Full Text: DOI arXiv
Roberts, Barnaby Partite saturation problems. (English) Zbl 1365.05148 J. Graph Theory 85, No. 2, 429-445 (2017). MSC: 05C35 PDFBibTeX XMLCite \textit{B. Roberts}, J. Graph Theory 85, No. 2, 429--445 (2017; Zbl 1365.05148) Full Text: DOI arXiv
Stiebitz, Michael A relaxed version of the Erdős-Lovász Tihany conjecture. (English) Zbl 1365.05104 J. Graph Theory 85, No. 1, 278-287 (2017). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Stiebitz}, J. Graph Theory 85, No. 1, 278--287 (2017; Zbl 1365.05104) Full Text: DOI
Wenger, Paul S.; West, Douglas B. Uniquely cycle-saturated graphs. (English) Zbl 1369.05120 J. Graph Theory 85, No. 1, 94-106 (2017). Reviewer: Saeid Alikhani (Yazd) MSC: 05C35 05C75 PDFBibTeX XMLCite \textit{P. S. Wenger} and \textit{D. B. West}, J. Graph Theory 85, No. 1, 94--106 (2017; Zbl 1369.05120) Full Text: DOI arXiv
Sullivan, Eric; Wenger, Paul S. Saturation numbers in tripartite graphs. (English) Zbl 1359.05055 J. Graph Theory 84, No. 4, 428-442 (2017). MSC: 05C22 PDFBibTeX XMLCite \textit{E. Sullivan} and \textit{P. S. Wenger}, J. Graph Theory 84, No. 4, 428--442 (2017; Zbl 1359.05055) Full Text: DOI arXiv
Czygrinow, Andrzej Tight co-degree condition for packing of loose cycles in 3-graphs. (English) Zbl 1350.05134 J. Graph Theory 83, No. 4, 317-333 (2016). MSC: 05C70 05C38 05C65 PDFBibTeX XMLCite \textit{A. Czygrinow}, J. Graph Theory 83, No. 4, 317--333 (2016; Zbl 1350.05134) Full Text: DOI
Gyárfás, András; Sárközy, Gábor N. Ramsey number of a connected triangle matching. (English) Zbl 1346.05181 J. Graph Theory 83, No. 2, 109-119 (2016). MSC: 05C55 05D10 05C70 PDFBibTeX XMLCite \textit{A. Gyárfás} and \textit{G. N. Sárközy}, J. Graph Theory 83, No. 2, 109--119 (2016; Zbl 1346.05181) Full Text: DOI arXiv Link
Kim, Jaehoon; Kostochka, Alexandr; Zhu, Xuding Improper coloring of sparse graphs with a given girth. II: Constructions. (English) Zbl 1333.05115 J. Graph Theory 81, No. 4, 403-413 (2016). MSC: 05C15 05C42 PDFBibTeX XMLCite \textit{J. Kim} et al., J. Graph Theory 81, No. 4, 403--413 (2016; Zbl 1333.05115) Full Text: DOI
Simonyi, Gábor; Tardos, Gábor; Zsbán, Ambrus Relations between the local chromatic number and its directed version. (English) Zbl 1316.05049 J. Graph Theory 79, No. 4, 318-330 (2015). MSC: 05C15 PDFBibTeX XMLCite \textit{G. Simonyi} et al., J. Graph Theory 79, No. 4, 318--330 (2015; Zbl 1316.05049) Full Text: DOI arXiv Link
Wang, Hong Partial degree conditions and cycle coverings. (English) Zbl 1309.05109 J. Graph Theory 78, No. 4, 295-304 (2015). MSC: 05C38 05C60 05C35 PDFBibTeX XMLCite \textit{H. Wang}, J. Graph Theory 78, No. 4, 295--304 (2015; Zbl 1309.05109) Full Text: DOI
Linial, Nati; Morgenstern, Avraham Graphs with few 3-cliques and 3-anticliques are 3-universal. (English) Zbl 1309.05138 J. Graph Theory 78, No. 3, 229-238 (2015). MSC: 05C69 05C20 PDFBibTeX XMLCite \textit{N. Linial} and \textit{A. Morgenstern}, J. Graph Theory 78, No. 3, 229--238 (2015; Zbl 1309.05138) Full Text: DOI arXiv
Chen, Ya-Chen Minimum \(K_{2, 3}\)-saturated graphs. (English) Zbl 1296.05097 J. Graph Theory 76, No. 4, 309-322 (2014). MSC: 05C35 05C60 PDFBibTeX XMLCite \textit{Y.-C. Chen}, J. Graph Theory 76, No. 4, 309--322 (2014; Zbl 1296.05097) Full Text: DOI arXiv
Chudnovsky, Maria The Erdős-Hajnal conjecture. A survey. (English) Zbl 1280.05086 J. Graph Theory 75, No. 2, 178-190 (2014). MSC: 05C60 05A17 05C65 PDFBibTeX XMLCite \textit{M. Chudnovsky}, J. Graph Theory 75, No. 2, 178--190 (2014; Zbl 1280.05086) Full Text: DOI arXiv
Choromanski, Krzysztof Upper bounds for Erdös-Hajnal coefficients of tournaments. (English) Zbl 1272.05119 J. Graph Theory 74, No. 1, 122-132 (2013). MSC: 05C55 05A17 05C65 05C20 05D10 PDFBibTeX XMLCite \textit{K. Choromanski}, J. Graph Theory 74, No. 1, 122--132 (2013; Zbl 1272.05119) Full Text: DOI
Christofides, Demetres; Edwards, Katherine; King, Andrew D. A note on hitting maximum and maximal cliques with a stable set. (English) Zbl 1269.05062 J. Graph Theory 73, No. 3-4, 354-360 (2013). MSC: 05C35 05C69 PDFBibTeX XMLCite \textit{D. Christofides} et al., J. Graph Theory 73, No. 3--4, 354--360 (2013; Zbl 1269.05062) Full Text: DOI arXiv
Kang, Ross J. Improper choosability and property B. (English) Zbl 1269.05035 J. Graph Theory 73, No. 3-4, 342-353 (2013). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{R. J. Kang}, J. Graph Theory 73, No. 3--4, 342--353 (2013; Zbl 1269.05035) Full Text: DOI arXiv
Füredi, Zoltán; Kim, Younjin Cycle-saturated graphs with minimum number of edges. (English) Zbl 1262.05084 J. Graph Theory 73, No. 1-2, 203-215 (2013). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{Z. Füredi} and \textit{Y. Kim}, J. Graph Theory 73, No. 1--2, 203--215 (2013; Zbl 1262.05084) Full Text: DOI arXiv
Benevides, Fabrıcio Siqueira A multipartite Ramsey number for odd cycles. (English) Zbl 1254.05113 J. Graph Theory 71, No. 3-4, 293-316 (2012). MSC: 05C55 05C38 PDFBibTeX XMLCite \textit{F. S. Benevides}, J. Graph Theory 71, No. 3--4, 293--316 (2012; Zbl 1254.05113) Full Text: DOI
Dudek, Andrzej; Ramadurai, Reshma Vertex colorings of graphs without short odd cycles. (English) Zbl 1234.05085 J. Graph Theory 68, No. 3, 255-264 (2011). MSC: 05C15 05C55 PDFBibTeX XMLCite \textit{A. Dudek} and \textit{R. Ramadurai}, J. Graph Theory 68, No. 3, 255--264 (2011; Zbl 1234.05085) Full Text: DOI
Cameron, Kathie; Hoàng, Chính T.; Lévêque, Benjamin Characterizing directed path graphs by forbidden asteroids. (English) Zbl 1230.05139 J. Graph Theory 68, No. 2, 103-112 (2011). MSC: 05C20 05C38 PDFBibTeX XMLCite \textit{K. Cameron} et al., J. Graph Theory 68, No. 2, 103--112 (2011; Zbl 1230.05139) Full Text: DOI
King, Andrew D. Hitting all maximum cliques with a stable set using lopsided independent transversals. (English) Zbl 1231.05205 J. Graph Theory 67, No. 4, 300-305 (2011). MSC: 05C69 05C15 05C35 05C70 PDFBibTeX XMLCite \textit{A. D. King}, J. Graph Theory 67, No. 4, 300--305 (2011; Zbl 1231.05205) Full Text: DOI arXiv
Shabanov, Dmitry A. On a generalization of Rubin’s theorem. (English) Zbl 1232.05081 J. Graph Theory 67, No. 3, 226-234 (2011). MSC: 05C15 05C75 05C65 PDFBibTeX XMLCite \textit{D. A. Shabanov}, J. Graph Theory 67, No. 3, 226--234 (2011; Zbl 1232.05081) Full Text: DOI
Chen, Ya-Chen All minimum \(C_{5}\)-saturated graphs. (English) Zbl 1223.05130 J. Graph Theory 67, No. 1, 9-26 (2011). MSC: 05C35 05C38 PDFBibTeX XMLCite \textit{Y.-C. Chen}, J. Graph Theory 67, No. 1, 9--26 (2011; Zbl 1223.05130) Full Text: DOI
Rabern, Landon On hitting all maximum cliques with an independent set. (English) Zbl 1222.05201 J. Graph Theory 66, No. 1, 32-37 (2011). MSC: 05C69 05C35 PDFBibTeX XMLCite \textit{L. Rabern}, J. Graph Theory 66, No. 1, 32--37 (2011; Zbl 1222.05201) Full Text: DOI arXiv
Löwenstein, Christian; Rautenbach, Dieter; Schiermeyer, Ingo Cycle length parities and the chromatic number. (English) Zbl 1209.05091 J. Graph Theory 64, No. 3, 210-218 (2010). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{C. Löwenstein} et al., J. Graph Theory 64, No. 3, 210--218 (2010; Zbl 1209.05091) Full Text: DOI Link
Lévêque, Benjamin; Maffray, Frédéric; Preissmann, Myriam Characterizing path graphs by forbidden induced subgraphs. (English) Zbl 1221.05220 J. Graph Theory 62, No. 4, 369-384 (2009). MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{B. Lévêque} et al., J. Graph Theory 62, No. 4, 369--384 (2009; Zbl 1221.05220) Full Text: DOI arXiv
Alon, N.; Erdős, P.; Gunderson, D. S.; Molloy, M. A Ramsey-type problem and the Turán numbers. (English) Zbl 0996.05076 J. Graph Theory 40, No. 2, 120-129 (2002). Reviewer: Ko-Wei Lih (Nankang) MSC: 05C35 05C55 05D10 PDFBibTeX XMLCite \textit{N. Alon} et al., J. Graph Theory 40, No. 2, 120--129 (2002; Zbl 0996.05076) Full Text: DOI
Kawarabayashi, Ken-ichi \(K_4^-\)-factor in a graph. (English) Zbl 0992.05059 J. Graph Theory 39, No. 2, 111-128 (2002). Reviewer: Lutz Volkmann (Aachen) MSC: 05C70 PDFBibTeX XMLCite \textit{K.-i. Kawarabayashi}, J. Graph Theory 39, No. 2, 111--128 (2002; Zbl 0992.05059) Full Text: DOI
Kierstead, H. A.; Trotter, W. T. Planar graph coloring with an uncooperative partner. (English) Zbl 0809.05044 J. Graph Theory 18, No. 6, 569-584 (1994). Reviewer: H.Bodlaender (Utrecht) MSC: 05C15 91A43 05C10 05C55 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{W. T. Trotter}, J. Graph Theory 18, No. 6, 569--584 (1994; Zbl 0809.05044) Full Text: DOI
Kierstead, H. A.; Penrice, S. G. Radius two trees specify \(\chi\)-bounded classes. (English) Zbl 0798.05023 J. Graph Theory 18, No. 2, 119-129 (1994). Reviewer: M.Frick (Pretoria) MSC: 05C15 05C05 05C35 PDFBibTeX XMLCite \textit{H. A. Kierstead} and \textit{S. G. Penrice}, J. Graph Theory 18, No. 2, 119--129 (1994; Zbl 0798.05023) Full Text: DOI
Frick, M. On replete graphs. (English) Zbl 0763.05044 J. Graph Theory 16, No. 2, 165-175 (1992). Reviewer: M.Frick (Johannesburg) MSC: 05C35 PDFBibTeX XMLCite \textit{M. Frick}, J. Graph Theory 16, No. 2, 165--175 (1992; Zbl 0763.05044) Full Text: DOI
Staples, Jo Ann W. On some subclasses of well-covered graphs. (English) Zbl 0404.05036 J. Graph Theory 3, 197-204 (1979). MSC: 05C35 PDFBibTeX XMLCite \textit{J. A. W. Staples}, J. Graph Theory 3, 197--204 (1979; Zbl 0404.05036) Full Text: DOI