Chen, Rong; Zhou, Yidong Graphs with girth \(2\ell+1\) and without longer odd holes that contain an odd \(K_4\)-subdivision. (English) Zbl 07820339 Electron. J. Comb. 31, No. 1, Research Paper P1.45, 10 p. (2024). MSC: 05C15 05C17 05C69 PDFBibTeX XMLCite \textit{R. Chen} and \textit{Y. Zhou}, Electron. J. Comb. 31, No. 1, Research Paper P1.45, 10 p. (2024; Zbl 07820339) Full Text: DOI arXiv
Kostochka, Alexandr V.; Schweser, Thomas; Stiebitz, Michael Generalized DP-colorings of graphs. (English) Zbl 07771208 Discrete Math. 346, No. 11, Article ID 113186, 20 p. (2023). Reviewer: Juan José Montellano Ballesteros (Ciudad de México) MSC: 05C15 PDFBibTeX XMLCite \textit{A. V. Kostochka} et al., Discrete Math. 346, No. 11, Article ID 113186, 20 p. (2023; Zbl 07771208) Full Text: DOI arXiv
Liu, Chun-Hung Immersion and clustered coloring. (English) Zbl 1504.05094 J. Comb. Theory, Ser. B 158, Part 1, 252-282 (2023). MSC: 05C15 60C05 PDFBibTeX XMLCite \textit{C.-H. Liu}, J. Comb. Theory, Ser. B 158, Part 1, 252--282 (2023; Zbl 1504.05094) Full Text: DOI arXiv
Gould, Ronald J.; Larsen, Victor; Postle, Luke Structure in sparse \(k\)-critical graphs. (English) Zbl 1490.05144 J. Comb. Theory, Ser. B 156, 194-222 (2022). MSC: 05C42 05C15 PDFBibTeX XMLCite \textit{R. J. Gould} et al., J. Comb. Theory, Ser. B 156, 194--222 (2022; Zbl 1490.05144) Full Text: DOI arXiv
von Postel, Justus; Schweser, Thomas; Stiebitz, Michael Point partition numbers: decomposable and indecomposable critical graphs. (English) Zbl 1490.05222 Discrete Math. 345, No. 8, Article ID 112903, 11 p. (2022). MSC: 05C70 05C15 PDFBibTeX XMLCite \textit{J. von Postel} et al., Discrete Math. 345, No. 8, Article ID 112903, 11 p. (2022; Zbl 1490.05222) Full Text: DOI arXiv
Ma, Jie; Yang, Tianchi Counting critical subgraphs in \(k\)-critical graphs. (English) Zbl 1499.05311 Combinatorica 41, No. 5, 669-694 (2021). MSC: 05C30 05C35 PDFBibTeX XMLCite \textit{J. Ma} and \textit{T. Yang}, Combinatorica 41, No. 5, 669--694 (2021; Zbl 1499.05311) Full Text: DOI arXiv
Engbers, John; Erey, Aysel; Fox, Jacob; He, Xiaoyu Tomescu’s graph coloring conjecture for \(\ell\)-connected graphs. (English) Zbl 1468.05075 SIAM J. Discrete Math. 35, No. 2, 1478-1502 (2021). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{J. Engbers} et al., SIAM J. Discrete Math. 35, No. 2, 1478--1502 (2021; Zbl 1468.05075) Full Text: DOI arXiv
Schweser, Thomas Generalized hypergraph coloring. (English) Zbl 1453.05038 Discuss. Math., Graph Theory 41, No. 1, 103-121 (2021). MSC: 05C15 05C65 05C70 PDFBibTeX XMLCite \textit{T. Schweser}, Discuss. Math., Graph Theory 41, No. 1, 103--121 (2021; Zbl 1453.05038) Full Text: DOI arXiv
Kostochka, Alexandr V.; Stiebitz, Michael The minimum number of edges in 4-critical digraphs of given order. (English) Zbl 1441.05080 Graphs Comb. 36, No. 3, 703-718 (2020). Reviewer: Hanna Furmańczyk (Gdańsk) MSC: 05C15 05C20 05C35 05C30 PDFBibTeX XMLCite \textit{A. V. Kostochka} and \textit{M. Stiebitz}, Graphs Comb. 36, No. 3, 703--718 (2020; Zbl 1441.05080) Full Text: DOI
Kostochka, Alexandr; Yancey, Matthew A Brooks-type result for sparse critical graphs. (English) Zbl 1424.05090 Combinatorica 38, No. 4, 887-934 (2018). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{A. Kostochka} and \textit{M. Yancey}, Combinatorica 38, No. 4, 887--934 (2018; Zbl 1424.05090) Full Text: DOI arXiv
Stiebitz, Michael; Toft, Bjarne A Brooks type theorem for the maximum local edge connectivity. (English) Zbl 1392.05043 Electron. J. Comb. 25, No. 1, Research Paper P1.50, 11 p. (2018). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Stiebitz} and \textit{B. Toft}, Electron. J. Comb. 25, No. 1, Research Paper P1.50, 11 p. (2018; Zbl 1392.05043) Full Text: arXiv Link
Dross, François; Montassier, Mickael; Pinlou, Alexandre Partitioning sparse graphs into an independent set and a forest of bounded degree. (English) Zbl 1391.05091 Electron. J. Comb. 25, No. 1, Research Paper P1.45, 11 p. (2018). MSC: 05C10 05C70 05C15 PDFBibTeX XMLCite \textit{F. Dross} et al., Electron. J. Comb. 25, No. 1, Research Paper P1.45, 11 p. (2018; Zbl 1391.05091) Full Text: arXiv Link
Ma, Jie; Ning, Bo Coloring graphs with two odd cycle lengths. (English) Zbl 1379.05039 SIAM J. Discrete Math. 32, No. 1, 296-319 (2018). MSC: 05C15 05C45 05C12 PDFBibTeX XMLCite \textit{J. Ma} and \textit{B. Ning}, SIAM J. Discrete Math. 32, No. 1, 296--319 (2018; Zbl 1379.05039) Full Text: DOI arXiv
Zhou, Bing On color critical graphs with large adaptable chromatic numbers. (English) Zbl 1380.05082 Graphs Comb. 33, No. 5, 1181-1187 (2017). Reviewer: Vaidyanathan Sriram (Bangalore) MSC: 05C15 PDFBibTeX XMLCite \textit{B. Zhou}, Graphs Comb. 33, No. 5, 1181--1187 (2017; Zbl 1380.05082) Full Text: DOI
Wood, David; Xu, Guangjun; Zhou, Sanming Hadwiger’s conjecture for 3-arc graphs. (English) Zbl 1351.05091 Electron. J. Comb. 23, No. 4, Research Paper P4.21, 18 p. (2016). MSC: 05C15 05C83 05C38 PDFBibTeX XMLCite \textit{D. Wood} et al., Electron. J. Comb. 23, No. 4, Research Paper P4.21, 18 p. (2016; Zbl 1351.05091) Full Text: arXiv Link
Borodin, Oleg V.; Dvořák, Zdeněk; Kostochka, Alexandr V.; Lidický, Bernard; Yancey, Matthew Planar 4-critical graphs with four triangles. (English) Zbl 1300.05069 Eur. J. Comb. 41, 138-151 (2014). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Eur. J. Comb. 41, 138--151 (2014; Zbl 1300.05069) Full Text: DOI arXiv
Kostochka, Alexandr V.; Rabern, Landon; Stiebitz, Michael Graphs with chromatic number close to maximum degree. (English) Zbl 1270.05043 Discrete Math. 312, No. 6, 1273-1281 (2012). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{A. V. Kostochka} et al., Discrete Math. 312, No. 6, 1273--1281 (2012; Zbl 1270.05043) Full Text: DOI
Stiebitz, Michael; Tuza, Zsolt; Voigt, Margit On list critical graphs. (English) Zbl 1229.05157 Discrete Math. 309, No. 15, 4931-4941 (2009). MSC: 05C35 05C15 PDFBibTeX XMLCite \textit{M. Stiebitz} et al., Discrete Math. 309, No. 15, 4931--4941 (2009; Zbl 1229.05157) Full Text: DOI
Xu, Baogang An analogue of Dirac’s theorem on circular super-critical graphs. (English) Zbl 1115.05040 Eur. J. Comb. 28, No. 4, 1270-1275 (2007). MSC: 05C15 PDFBibTeX XMLCite \textit{B. Xu}, Eur. J. Comb. 28, No. 4, 1270--1275 (2007; Zbl 1115.05040) Full Text: DOI
Bryant, Victor A characterisation of some 2-connected graphs and a comment on an algorithmic proof of Brooks’ theorem. (English) Zbl 0859.05044 Discrete Math. 158, No. 1-3, 279-281 (1996). Reviewer: I.Tomescu (Bucureşti) MSC: 05C15 05C38 05C85 05C75 PDFBibTeX XMLCite \textit{V. Bryant}, Discrete Math. 158, No. 1--3, 279--281 (1996; Zbl 0859.05044) Full Text: DOI
Bhasker, J.; Samad, Tariq; West, Douglas B. Size, chromatic number, and connectivity. (English) Zbl 0817.05026 Graphs Comb. 10, No. 3, 209-213 (1994). Reviewer: W.G.Brown (Montreal) MSC: 05C15 05C40 05C35 PDFBibTeX XMLCite \textit{J. Bhasker} et al., Graphs Comb. 10, No. 3, 209--213 (1994; Zbl 0817.05026) Full Text: DOI
Sachs, Horst; Stiebitz, Michael On constructive methods in the theory of colour-critical graphs. (English) Zbl 0675.05028 Discrete Math. 74, No. 1-2, 201-226 (1989). Reviewer: J.Mitchem MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{H. Sachs} and \textit{M. Stiebitz}, Discrete Math. 74, No. 1--2, 201--226 (1989; Zbl 0675.05028) Full Text: DOI
Mayer, Jean Hadwiger’s conjecture (ḵ\(=6):\) Neighbour configurations of 6-vertices in contraction-critical graphs. (English) Zbl 0672.05026 Discrete Math. 74, No. 1-2, 137-148 (1989). Reviewer: J.Oxley MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Mayer}, Discrete Math. 74, No. 1--2, 137--148 (1989; Zbl 0672.05026) Full Text: DOI
Neumann-Lara, V. The dichromatic number of a digraph. (English) Zbl 0506.05031 J. Comb. Theory, Ser. B 33, 265-270 (1982). MSC: 05C15 05C20 PDFBibTeX XMLCite \textit{V. Neumann-Lara}, J. Comb. Theory, Ser. B 33, 265--270 (1982; Zbl 0506.05031) Full Text: DOI
Matula, David W. A uniform set covering lemma. (English) Zbl 0364.05022 Proc. Am. Math. Soc. 48, 255-261 (1975). MSC: 05C15 05C99 PDFBibTeX XMLCite \textit{D. W. Matula}, Proc. Am. Math. Soc. 48, 255--261 (1975; Zbl 0364.05022) Full Text: DOI
Toft, Bjarne On critical subgraphs of colour-critical graphs. (English) Zbl 0271.05112 Discrete Math. 7, 377-392 (1974). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{B. Toft}, Discrete Math. 7, 377--392 (1974; Zbl 0271.05112) Full Text: DOI
Toft, B. Colour-critical graphs and hypergraphs. (English) Zbl 0269.05117 J. Comb. Theory, Ser. B 16, 145-161 (1974). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{B. Toft}, J. Comb. Theory, Ser. B 16, 145--161 (1974; Zbl 0269.05117) Full Text: DOI
Toft, B. On separating sets of edges in contraction-critical graphs. (English) Zbl 0219.05059 Math. Ann. 196, 129-147 (1972). MSC: 05C15 05C40 PDFBibTeX XMLCite \textit{B. Toft}, Math. Ann. 196, 129--147 (1972; Zbl 0219.05059) Full Text: DOI EuDML
Wilkov, R. S.; Kim, W. H. A practical approach to the chromatic partition problem. (English) Zbl 0295.05104 J. Franklin Inst. 289, 333-349 (1970). MSC: 05C15 05-04 PDFBibTeX XMLCite \textit{R. S. Wilkov} and \textit{W. H. Kim}, J. Franklin Inst. 289, 333--349 (1970; Zbl 0295.05104) Full Text: DOI
Kirchgässner, K. Die graphentheoretische Lösung eines nichtlinearen Zuteilungsproblems. (German) Zbl 0168.40802 Unternehmensforsch. 9, 217-229 (1965). PDFBibTeX XMLCite \textit{K. Kirchgässner}, Unternehmensforsch. 9, 217--229 (1965; Zbl 0168.40802) Full Text: DOI
Wagner, K. Bemerkungen zu Hadwigers Vermutung. (German) Zbl 0096.17904 Math. Ann. 141, 433-451 (1960). PDFBibTeX XMLCite \textit{K. Wagner}, Math. Ann. 141, 433--451 (1960; Zbl 0096.17904) Full Text: DOI EuDML