Jaffke, Lars; Lima, Paloma T. On the maximum number of edges in planar graphs of bounded degree and matching number. (English) Zbl 1515.05092 Discrete Math. 346, No. 8, Article ID 113431, 7 p. (2023). MSC: 05C30 05C35 05C10 PDFBibTeX XMLCite \textit{L. Jaffke} and \textit{P. T. Lima}, Discrete Math. 346, No. 8, Article ID 113431, 7 p. (2023; Zbl 1515.05092) Full Text: DOI arXiv
Zhang, Li; Lu, You; Zhang, Shenggui Signed planar graphs with \(\Delta \geq 8\) are \(\Delta\)-edge-colorable. (English) Zbl 07690004 Discrete Math. 346, No. 8, Article ID 113409, 10 p. (2023). MSC: 05Cxx 05-XX 68Rxx PDFBibTeX XMLCite \textit{L. Zhang} et al., Discrete Math. 346, No. 8, Article ID 113409, 10 p. (2023; Zbl 07690004) Full Text: DOI
Liang, Zuosong; Xu, Guangjun; Bai, Chunsong A note on the three color problem on planar graphs without 4- and 5-cycles and without ext-triangular 7-cycles. (English) Zbl 1502.05068 Discrete Math. 346, No. 1, Article ID 113192, 3 p. (2023). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{Z. Liang} et al., Discrete Math. 346, No. 1, Article ID 113192, 3 p. (2023; Zbl 1502.05068) Full Text: DOI
Bonduelle, Sebastien; Kardoš, František Subcubic planar graphs of girth 7 are class I. (English) Zbl 1491.05062 Discrete Math. 345, No. 10, Article ID 113002, 6 p. (2022). MSC: 05C10 05C15 05C07 PDFBibTeX XMLCite \textit{S. Bonduelle} and \textit{F. Kardoš}, Discrete Math. 345, No. 10, Article ID 113002, 6 p. (2022; Zbl 1491.05062) Full Text: DOI arXiv
Kang, Yingli; Jin, Ligang; Liu, Peipei; Wang, Yingqian \((1,0,0)\)-colorability of planar graphs without cycles of length \(4\) or \(6\). (English) Zbl 1482.05111 Discrete Math. 345, No. 4, Article ID 112758, 17 p. (2022). MSC: 05C15 05C12 05C38 05C10 PDFBibTeX XMLCite \textit{Y. Kang} et al., Discrete Math. 345, No. 4, Article ID 112758, 17 p. (2022; Zbl 1482.05111) Full Text: DOI arXiv
Feng, Jieru; Gao, Yuping; Wu, Jianliang The edge colorings of \(K_5\)-minor free graphs. (English) Zbl 1517.05054 Discrete Math. 344, No. 6, Article ID 112360, 7 p. (2021). Reviewer: Juan José Montellano Ballesteros (Ciudad de México) MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Feng} et al., Discrete Math. 344, No. 6, Article ID 112360, 7 p. (2021; Zbl 1517.05054) Full Text: DOI arXiv
Cho, Eun-Kyung; Choi, Ilkyoo; Park, Boram Partitioning planar graphs without 4-cycles and 5-cycles into bounded degree forests. (English) Zbl 1455.05059 Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021). MSC: 05C70 05C10 PDFBibTeX XMLCite \textit{E.-K. Cho} et al., Discrete Math. 344, No. 1, Article ID 112172, 9 p. (2021; Zbl 1455.05059) Full Text: DOI arXiv
Jendrol’, Stanislav; Soták, Roman On the cyclic coloring conjecture. (English) Zbl 1453.05035 Discrete Math. 344, No. 2, Article ID 112204, 6 p. (2021). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{S. Jendrol'} and \textit{R. Soták}, Discrete Math. 344, No. 2, Article ID 112204, 6 p. (2021; Zbl 1453.05035) Full Text: DOI arXiv
Chang, Yulin; Hu, Jie; Wang, Guanghui; Yu, Xiaowei Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 8. (English) Zbl 1445.05037 Discrete Math. 343, No. 10, Article ID 112014, 14 p. (2020). MSC: 05C15 05C10 05C07 PDFBibTeX XMLCite \textit{Y. Chang} et al., Discrete Math. 343, No. 10, Article ID 112014, 14 p. (2020; Zbl 1445.05037) Full Text: DOI
Cao, Yan; Chen, Guantao; Jiang, Suyun; Liu, Huiqing; Lu, Fuliang Hamiltonicity of edge-chromatic critical graphs. (English) Zbl 1440.05081 Discrete Math. 343, No. 7, Article ID 111881, 15 p. (2020). MSC: 05C15 05C45 PDFBibTeX XMLCite \textit{Y. Cao} et al., Discrete Math. 343, No. 7, Article ID 111881, 15 p. (2020; Zbl 1440.05081) Full Text: DOI arXiv
Xu, Miaodi; Chen, Min Facial edge-face coloring of \(K_4\)-minor-free graphs. (English) Zbl 1437.05082 Discrete Math. 343, No. 6, Article ID 111855, 7 p. (2020). MSC: 05C15 05C83 PDFBibTeX XMLCite \textit{M. Xu} and \textit{M. Chen}, Discrete Math. 343, No. 6, Article ID 111855, 7 p. (2020; Zbl 1437.05082) Full Text: DOI
Horacek, Katie; Luo, Rong; Miao, Zhengke; Zhao, Yue Upper bounds on the maximum degree of class two graphs on surfaces. (English) Zbl 1431.05069 Discrete Math. 343, No. 3, Article ID 111738, 17 p. (2020). MSC: 05C15 05C07 05C35 05C10 PDFBibTeX XMLCite \textit{K. Horacek} et al., Discrete Math. 343, No. 3, Article ID 111738, 17 p. (2020; Zbl 1431.05069) Full Text: DOI
Matsumoto, Naoki; Ohno, Yumiko Facial achromatic number of triangulations on the sphere. (English) Zbl 1429.05076 Discrete Math. 343, No. 2, Article ID 111651, 14 p. (2020). MSC: 05C15 05C65 PDFBibTeX XMLCite \textit{N. Matsumoto} and \textit{Y. Ohno}, Discrete Math. 343, No. 2, Article ID 111651, 14 p. (2020; Zbl 1429.05076) Full Text: DOI
Cao, Yan; Chen, Guantao; Jiang, Suyun; Liu, Huiqing; Lu, Fuliang Average degrees of edge-chromatic critical graphs. (English) Zbl 1464.05144 Discrete Math. 342, No. 6, 1613-1623 (2019). Reviewer: Hong-Jian Lai (Morgantown) MSC: 05C15 PDFBibTeX XMLCite \textit{Y. Cao} et al., Discrete Math. 342, No. 6, 1613--1623 (2019; Zbl 1464.05144) Full Text: DOI arXiv
Hu, Jie; Wang, Guanghui; Wu, Jianliang; Yang, Donglei; Yu, Xiaowei Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. (English) Zbl 1411.05090 Discrete Math. 342, No. 5, 1392-1402 (2019). Reviewer: Stelian Mihalas (Timişoara) MSC: 05C15 05C10 05C07 05C35 PDFBibTeX XMLCite \textit{J. Hu} et al., Discrete Math. 342, No. 5, 1392--1402 (2019; Zbl 1411.05090) Full Text: DOI
Hu, Lili; Li, Xiangwen Every signed planar graph without cycles of length from 4 to 8 is 3-colorable. (English) Zbl 1376.05067 Discrete Math. 341, No. 2, 513-519 (2018). MSC: 05C22 05C10 05C15 PDFBibTeX XMLCite \textit{L. Hu} and \textit{X. Li}, Discrete Math. 341, No. 2, 513--519 (2018; Zbl 1376.05067) Full Text: DOI
Chen, Guantao; Chen, Xiaodong; Zhao, Yue Hamiltonicity of edge chromatic critical graphs. (English) Zbl 1370.05122 Discrete Math. 340, No. 12, 3011-3015 (2017). MSC: 05C45 05C15 PDFBibTeX XMLCite \textit{G. Chen} et al., Discrete Math. 340, No. 12, 3011--3015 (2017; Zbl 1370.05122) Full Text: DOI arXiv
Czap, Július; Jendrol’, Stanislav Facially-constrained colorings of plane graphs: a survey. (English) Zbl 1369.05071 Discrete Math. 340, No. 11, 2691-2703 (2017). MSC: 05C15 05C10 05-02 PDFBibTeX XMLCite \textit{J. Czap} and \textit{S. Jendrol'}, Discrete Math. 340, No. 11, 2691--2703 (2017; Zbl 1369.05071) Full Text: DOI
Cranston, Daniel W.; West, Douglas B. An introduction to the discharging method via graph coloring. (English) Zbl 1355.05104 Discrete Math. 340, No. 4, 766-793 (2017). MSC: 05C15 05C10 05C07 PDFBibTeX XMLCite \textit{D. W. Cranston} and \textit{D. B. West}, Discrete Math. 340, No. 4, 766--793 (2017; Zbl 1355.05104) Full Text: DOI arXiv
Zhang, Chuanni; Wang, Yingqian; Chen, Min Planar graphs without adjacent cycles of length at most five are \((1,1,0)\)-colorable. (English) Zbl 1343.05054 Discrete Math. 339, No. 12, 3032-3042 (2016). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{C. Zhang} et al., Discrete Math. 339, No. 12, 3032--3042 (2016; Zbl 1343.05054) Full Text: DOI
Hu, Xiaoxue; Wang, Weifan; Shiu, Wai Chee; Wang, Yiqiao Plane graphs with maximum degree 9 are entirely 11-choosable. (English) Zbl 1339.05074 Discrete Math. 339, No. 11, 2742-2753 (2016). MSC: 05C10 05C07 05C15 PDFBibTeX XMLCite \textit{X. Hu} et al., Discrete Math. 339, No. 11, 2742--2753 (2016; Zbl 1339.05074) Full Text: DOI
Cheng, Jian; Lorenzen, Kate J.; Luo, Rong; Thompson, Joshua C. A note on the size of edge-chromatic 4-critical graphs. (English) Zbl 1339.05123 Discrete Math. 339, No. 10, 2393-2398 (2016). MSC: 05C15 PDFBibTeX XMLCite \textit{J. Cheng} et al., Discrete Math. 339, No. 10, 2393--2398 (2016; Zbl 1339.05123) Full Text: DOI
Chen, Ming; Wang, Yingqian; Liu, Peipei; Xu, Jinghan Planar graphs without cycles of length 4 or 5 are \((2, 0, 0)\)-colorable. (English) Zbl 1327.05073 Discrete Math. 339, No. 2, 886-905 (2016). MSC: 05C10 05C15 05C38 PDFBibTeX XMLCite \textit{M. Chen} et al., Discrete Math. 339, No. 2, 886--905 (2016; Zbl 1327.05073) Full Text: DOI
Fabrici, I.; Jendrol’, S.; Vrbjarová, M. Facial entire colouring of plane graphs. (English) Zbl 1327.05108 Discrete Math. 339, No. 2, 626-631 (2016). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{I. Fabrici} et al., Discrete Math. 339, No. 2, 626--631 (2016; Zbl 1327.05108) Full Text: DOI
Kang, Yingli; Jin, Ligang; Wang, Yingqian The 3-colorability of planar graphs without cycles of length 4, 6 and 9. (English) Zbl 1322.05043 Discrete Math. 339, No. 1, 299-307 (2016). MSC: 05C10 05C15 05C38 PDFBibTeX XMLCite \textit{Y. Kang} et al., Discrete Math. 339, No. 1, 299--307 (2016; Zbl 1322.05043) Full Text: DOI arXiv
Dong, Wei; Lin, Wensong Entire coloring of plane graph with maximum degree eleven. (English) Zbl 1300.05095 Discrete Math. 336, 46-56 (2014). MSC: 05C15 05C10 05C07 05C35 PDFBibTeX XMLCite \textit{W. Dong} and \textit{W. Lin}, Discrete Math. 336, 46--56 (2014; Zbl 1300.05095) Full Text: DOI
Li, Xuechao; Wei, Bing Lower bounds on the number of edges in edge-chromatic-critical graphs with fixed maximum degrees. (English) Zbl 1298.05126 Discrete Math. 334, 1-12 (2014). MSC: 05C15 05C07 05C35 PDFBibTeX XMLCite \textit{X. Li} and \textit{B. Wei}, Discrete Math. 334, 1--12 (2014; Zbl 1298.05126) Full Text: DOI
Hu, Xiaoxue; Wang, Weifan; Wang, Yiqiao The edge-face choosability of plane graphs with maximum degree at least 9. (English) Zbl 1288.05061 Discrete Math. 327, 1-8 (2014). MSC: 05C10 05C07 05C35 05C15 PDFBibTeX XMLCite \textit{X. Hu} et al., Discrete Math. 327, 1--8 (2014; Zbl 1288.05061) Full Text: DOI
Wang, Yingqian; Yang, Yaochou \((1,0,0)\)-colorability of planar graphs without cycles of length 4, 5 or 9. (English) Zbl 1288.05105 Discrete Math. 326, 44-49 (2014). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{Y. Wang} and \textit{Y. Yang}, Discrete Math. 326, 44--49 (2014; Zbl 1288.05105) Full Text: DOI
Bu, Yuehua; Fu, Caixia (\(1,1,0\))-coloring of planar graphs without cycles of length 4 and 6. (English) Zbl 1280.05038 Discrete Math. 313, No. 23, 2737-2741 (2013). MSC: 05C15 05C10 05C38 05C35 05C07 PDFBibTeX XMLCite \textit{Y. Bu} and \textit{C. Fu}, Discrete Math. 313, No. 23, 2737--2741 (2013; Zbl 1280.05038) Full Text: DOI
Machado, Raphael C. S.; de Figueiredo, Celina M. H.; Trotignon, Nicolas Edge-colouring and total-colouring chordless graphs. (English) Zbl 1408.05063 Discrete Math. 313, No. 14, 1547-1552 (2013). MSC: 05C15 05C70 05C85 68W40 PDFBibTeX XMLCite \textit{R. C. S. Machado} et al., Discrete Math. 313, No. 14, 1547--1552 (2013; Zbl 1408.05063) Full Text: DOI arXiv
Zhang, Xin; Liu, Guizhen; Wu, Jian-Liang Edge covering pseudo-outerplanar graphs with forests. (English) Zbl 1248.05053 Discrete Math. 312, No. 18, 2788-2799 (2012). MSC: 05C10 05C15 05C35 05C83 PDFBibTeX XMLCite \textit{X. Zhang} et al., Discrete Math. 312, No. 18, 2788--2799 (2012; Zbl 1248.05053) Full Text: DOI arXiv
Czap, Július; Jendroľ, Stanislav; Kardoš, František; Soták, Roman Facial parity edge colouring of plane pseudographs. (English) Zbl 1245.05044 Discrete Math. 312, No. 17, 2735-2740 (2012). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Czap} et al., Discrete Math. 312, No. 17, 2735--2740 (2012; Zbl 1245.05044) Full Text: DOI
Chang, Gerard J.; Roussel, Nicolas (\( \Delta + 1\))-total choosability of planar graphs with no cycles of length from 4 to \(k\) and without close triangles. (English) Zbl 1244.05070 Discrete Math. 312, No. 14, 2126-2130 (2012). MSC: 05C10 05C15 05C38 05C07 PDFBibTeX XMLCite \textit{G. J. Chang} and \textit{N. Roussel}, Discrete Math. 312, No. 14, 2126--2130 (2012; Zbl 1244.05070) Full Text: DOI
Jendrol’, Stanislav; Kaiser, Tomáš; Ryjáček, Zdeněk; Schiermeyer, Ingo A Dirac theorem for trestles. (English) Zbl 1243.05121 Discrete Math. 312, No. 12-13, 2000-2004 (2012). MSC: 05C35 05C07 05C40 PDFBibTeX XMLCite \textit{S. Jendrol'} et al., Discrete Math. 312, No. 12--13, 2000--2004 (2012; Zbl 1243.05121) Full Text: DOI
Wang, Hui-Juan; Wu, Jian-Liang A note on the total coloring of planar graphs without adjacent 4-cycles. (English) Zbl 1243.05090 Discrete Math. 312, No. 11, 1923-1926 (2012). MSC: 05C15 05C10 05C38 PDFBibTeX XMLCite \textit{H.-J. Wang} and \textit{J.-L. Wu}, Discrete Math. 312, No. 11, 1923--1926 (2012; Zbl 1243.05090) Full Text: DOI
Kwon, Young Soo; Lee, Jaeun; Zhang, Zhongfu Edge-chromatic numbers of Mycielski graphs. (English) Zbl 1270.05045 Discrete Math. 312, No. 6, 1222-1225 (2012). MSC: 05C15 05C75 PDFBibTeX XMLCite \textit{Y. S. Kwon} et al., Discrete Math. 312, No. 6, 1222--1225 (2012; Zbl 1270.05045) Full Text: DOI
Borodin, O. V.; Ivanova, A. O. List 2-facial 5-colorability of plane graphs with girth at least 12. (English) Zbl 1233.05098 Discrete Math. 312, No. 2, 306-314 (2012). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, Discrete Math. 312, No. 2, 306--314 (2012; Zbl 1233.05098) Full Text: DOI
Miao, Lianying; Qu, Jibin; Sun, Qingbo On the average degree of critical graphs with maximum degree six. (English) Zbl 1238.05147 Discrete Math. 311, No. 21, 2574-2576 (2011). MSC: 05C35 05C07 05C15 PDFBibTeX XMLCite \textit{L. Miao} et al., Discrete Math. 311, No. 21, 2574--2576 (2011; Zbl 1238.05147) Full Text: DOI
Wang, Bing; Wu, Jian-Liang Total colorings of planar graphs with maximum degree seven and without intersecting 3-cycles. (English) Zbl 1244.05098 Discrete Math. 311, No. 18-19, 2025-2030 (2011). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{B. Wang} and \textit{J.-L. Wu}, Discrete Math. 311, No. 18--19, 2025--2030 (2011; Zbl 1244.05098) Full Text: DOI
Czap, Július; Jendroľ, Stanislav; Voigt, Margit Parity vertex colouring of plane graphs. (English) Zbl 1222.05051 Discrete Math. 311, No. 6, 512-520 (2011). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Czap} et al., Discrete Math. 311, No. 6, 512--520 (2011; Zbl 1222.05051) Full Text: DOI
Cohen, Nathann; Havet, Frédéric Planar graphs with maximum degree \(\Delta \geq 9\) are \((\Delta +1)\)-edge-choosable–a short proof. (English) Zbl 1208.05016 Discrete Math. 310, No. 21, 3049-3051 (2010). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{N. Cohen} and \textit{F. Havet}, Discrete Math. 310, No. 21, 3049--3051 (2010; Zbl 1208.05016) Full Text: DOI
Borodin, O. V.; Glebov, A. N.; Raspaud, A. Planar graphs without triangles adjacent to cycles of length from 4 to 7 are 3-colorable. (English) Zbl 1203.05048 Discrete Math. 310, No. 20, 2584-2594 (2010). MSC: 05C15 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 310, No. 20, 2584--2594 (2010; Zbl 1203.05048) Full Text: DOI
Shen, Lan; Wang, Yingqian Planar graphs with maximum degree 7 and without 5-cycles are 8-totally-colorable. (English) Zbl 1220.05028 Discrete Math. 310, No. 17-18, 2372-2379 (2010). MSC: 05C10 05C15 05C38 PDFBibTeX XMLCite \textit{L. Shen} and \textit{Y. Wang}, Discrete Math. 310, No. 17--18, 2372--2379 (2010; Zbl 1220.05028) Full Text: DOI
Miao, Lianying; Sun, Qingbo On the size of critical graphs with maximum degree 8. (English) Zbl 1225.05143 Discrete Math. 310, No. 15-16, 2215-2218 (2010). MSC: 05C35 PDFBibTeX XMLCite \textit{L. Miao} and \textit{Q. Sun}, Discrete Math. 310, No. 15--16, 2215--2218 (2010; Zbl 1225.05143) Full Text: DOI
Woodall, Douglas R. The average degree of a multigraph critical with respect to edge or total choosability. (English) Zbl 1230.05104 Discrete Math. 310, No. 6-7, 1167-1171 (2010). MSC: 05C07 05C10 05C15 PDFBibTeX XMLCite \textit{D. R. Woodall}, Discrete Math. 310, No. 6--7, 1167--1171 (2010; Zbl 1230.05104) Full Text: DOI
Horňák, Mirko; Zlámalová, Jana Another step towards proving a conjecture by Plummer and Toft. (English) Zbl 1185.05060 Discrete Math. 310, No. 3, 442-452 (2010). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Horňák} and \textit{J. Zlámalová}, Discrete Math. 310, No. 3, 442--452 (2010; Zbl 1185.05060) Full Text: DOI
Dekar, Lyes; Effantin, Brice; Kheddouci, Hamamache \([r,s,t]\)-coloring of trees and bipartite graphs. (English) Zbl 1215.05060 Discrete Math. 310, No. 2, 260-269 (2010). MSC: 05C15 05C05 PDFBibTeX XMLCite \textit{L. Dekar} et al., Discrete Math. 310, No. 2, 260--269 (2010; Zbl 1215.05060) Full Text: DOI
Borodin, Oleg V.; Montassier, Mickael; Raspaud, André Planar graphs without adjacent cycles of length at most seven are 3-colorable. (English) Zbl 1221.05071 Discrete Math. 310, No. 1, 167-173 (2010). MSC: 05C10 05C15 05C38 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 310, No. 1, 167--173 (2010; Zbl 1221.05071) Full Text: DOI
Liu, Bin; Hou, Jianfeng; Wu, Jianliang; Liu, Guizhen Total colorings and list total colorings of planar graphs without intersecting 4-cycles. (English) Zbl 1204.05047 Discrete Math. 309, No. 20, 6035-6043 (2009). MSC: 05C15 05C10 05C78 PDFBibTeX XMLCite \textit{B. Liu} et al., Discrete Math. 309, No. 20, 6035--6043 (2009; Zbl 1204.05047) Full Text: DOI
Li, Shuchao; Li, Xuechao Edge coloring of graphs with small maximum degrees. (English) Zbl 1213.05092 Discrete Math. 309, No. 14, 4843-4852 (2009). MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{S. Li} and \textit{X. Li}, Discrete Math. 309, No. 14, 4843--4852 (2009; Zbl 1213.05092) Full Text: DOI
Luo, Rong; Zhao, Yue An application of Vizing and Vizing-like adjacency lemmas to Vizing’s independence number conjecture of edge chromatic critical graphs. (English) Zbl 1200.05114 Discrete Math. 309, No. 9, 2925-2929 (2009). MSC: 05C35 05C15 05C69 PDFBibTeX XMLCite \textit{R. Luo} and \textit{Y. Zhao}, Discrete Math. 309, No. 9, 2925--2929 (2009; Zbl 1200.05114) Full Text: DOI
Wang, Weifan The edge-face coloring of graphs embedded in a surface of characteristic zero. (English) Zbl 1213.05103 Discrete Math. 309, No. 11, 3523-3533 (2009). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{W. Wang}, Discrete Math. 309, No. 11, 3523--3533 (2009; Zbl 1213.05103) Full Text: DOI
Hetherington, Timothy J. Entire choosability of near-outerplane graphs. (English) Zbl 1198.05053 Discrete Math. 309, No. 8, 2153-2165 (2009). MSC: 05C15 05C83 05C10 PDFBibTeX XMLCite \textit{T. J. Hetherington}, Discrete Math. 309, No. 8, 2153--2165 (2009; Zbl 1198.05053) Full Text: DOI Link
Sun, Xiang-Yong; Wu, Jian-Liang; Wu, Yu-Wen; Hou, Jian-Feng Total colorings of planar graphs without adjacent triangles. (English) Zbl 1189.05065 Discrete Math. 309, No. 1, 202-206 (2009). Reviewer: Ko-Wei Lih (Taipei) MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{X.-Y. Sun} et al., Discrete Math. 309, No. 1, 202--206 (2009; Zbl 1189.05065) Full Text: DOI
Miao, Lianying; Pang, Shiyou On the size of edge-coloring critical graphs with maximum degree 4. (English) Zbl 1223.05080 Discrete Math. 308, No. 23, 5856-5859 (2008). MSC: 05C15 05C35 05C07 PDFBibTeX XMLCite \textit{L. Miao} and \textit{S. Pang}, Discrete Math. 308, No. 23, 5856--5859 (2008; Zbl 1223.05080) Full Text: DOI
Wu, Jianliang; Wang, Ping List-edge and list-total colorings of graphs embedded on hyperbolic surfaces. (English) Zbl 1189.05067 Discrete Math. 308, No. 24, 6210-6215 (2008). Reviewer: Ko-Wei Lih (Taipei) MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Wu} and \textit{P. Wang}, Discrete Math. 308, No. 24, 6210--6215 (2008; Zbl 1189.05067) Full Text: DOI
Cariolaro, David An adjacency Lemma for critical multigraphs. (English) Zbl 1223.05064 Discrete Math. 308, No. 20, 4791-4795 (2008). MSC: 05C15 PDFBibTeX XMLCite \textit{D. Cariolaro}, Discrete Math. 308, No. 20, 4791--4795 (2008; Zbl 1223.05064) Full Text: DOI
Woodall, Douglas R. The average degree of an edge-chromatic critical graph. (English) Zbl 1133.05035 Discrete Math. 308, No. 5-6, 803-819 (2008). Reviewer: Timothy R. Walsh (Montréal) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{D. R. Woodall}, Discrete Math. 308, No. 5--6, 803--819 (2008; Zbl 1133.05035) Full Text: DOI
Voigt, M. A non-3-choosable planar graph without cycles of length 4 and 5. (English) Zbl 1112.05041 Discrete Math. 307, No. 7-8, 1013-1015 (2007). MSC: 05C15 PDFBibTeX XMLCite \textit{M. Voigt}, Discrete Math. 307, No. 7--8, 1013--1015 (2007; Zbl 1112.05041) Full Text: DOI
Kemnitz, Arnfried; Marangio, Massimiliano; Mihók, Peter \([r,s,t]\)-chromatic numbers and hereditary properties of graphs. (English) Zbl 1115.05034 Discrete Math. 307, No. 7-8, 916-922 (2007). Reviewer: Lorenzo Traldi (Easton) MSC: 05C15 PDFBibTeX XMLCite \textit{A. Kemnitz} et al., Discrete Math. 307, No. 7--8, 916--922 (2007; Zbl 1115.05034) Full Text: DOI
Kemnitz, Arnfried; Marangio, Massimiliano \([r,s,t]\)-colorings of graphs. (English) Zbl 1115.05033 Discrete Math. 307, No. 2, 199-207 (2007). Reviewer: Lorenzo Traldi (Easton) MSC: 05C15 PDFBibTeX XMLCite \textit{A. Kemnitz} and \textit{M. Marangio}, Discrete Math. 307, No. 2, 199--207 (2007; Zbl 1115.05033) Full Text: DOI
Li, Xuechao; Luo, Rong; Niu, Jianbing A note on class one graphs with maximum degree six. (English) Zbl 1106.05034 Discrete Math. 306, No. 13, 1450-1455 (2006). Reviewer: Stelian Mihalas (Timisoara) MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{X. Li} et al., Discrete Math. 306, No. 13, 1450--1455 (2006; Zbl 1106.05034) Full Text: DOI
Bu, Yuehua; Wang, Weifan Some sufficient conditions for a planar graph of maximum degree six to be Class 1. (English) Zbl 1095.05014 Discrete Math. 306, No. 13, 1440-1445 (2006). MSC: 05C15 PDFBibTeX XMLCite \textit{Y. Bu} and \textit{W. Wang}, Discrete Math. 306, No. 13, 1440--1445 (2006; Zbl 1095.05014) Full Text: DOI
Xie, Dezheng; He, Zhongshi The total chromatic number of regular graphs of even order and high degree. (English) Zbl 1074.05039 Discrete Math. 300, No. 1-3, 196-212 (2005). MSC: 05C15 PDFBibTeX XMLCite \textit{D. Xie} and \textit{Z. He}, Discrete Math. 300, No. 1--3, 196--212 (2005; Zbl 1074.05039) Full Text: DOI
Zhang, Li; Wu, Baoyindureng A note on 3-choosability of planar graphs without certain cycles. (English) Zbl 1070.05046 Discrete Math. 297, No. 1-3, 206-209 (2005). MSC: 05C15 05C38 PDFBibTeX XMLCite \textit{L. Zhang} and \textit{B. Wu}, Discrete Math. 297, No. 1--3, 206--209 (2005; Zbl 1070.05046) Full Text: DOI
Luo, Rong; Zhang, Cun-Quan Edge coloring of graphs with small average degrees. (English) Zbl 1030.05040 Discrete Math. 275, No. 1-3, 207-218 (2004). MSC: 05C15 PDFBibTeX XMLCite \textit{R. Luo} and \textit{C.-Q. Zhang}, Discrete Math. 275, No. 1--3, 207--218 (2004; Zbl 1030.05040) Full Text: DOI
Miao, Lian-ying; Pang, Shi-you; Wu, Jian-liang An upper bound on the number of edges of edge-coloring critical graphs with high maximum degree. (English) Zbl 1032.05054 Discrete Math. 271, No. 1-3, 321-325 (2003). MSC: 05C15 PDFBibTeX XMLCite \textit{L.-y. Miao} et al., Discrete Math. 271, No. 1--3, 321--325 (2003; Zbl 1032.05054) Full Text: DOI
Borodin, Oleg V.; Sanders, Daniel P.; Zhao, Yue On cyclic colorings and their generalizations. (English) Zbl 0929.05027 Discrete Math. 203, No. 1-3, 23-40 (1999). Reviewer: Peter Reichensperger (Oberasbach) MSC: 05C15 05C35 PDFBibTeX XMLCite \textit{O. V. Borodin} et al., Discrete Math. 203, No. 1--3, 23--40 (1999; Zbl 0929.05027) Full Text: DOI
Chen, Guantao; Gyárfás, András; Schelp, R. H. Vertex colorings with a distance restriction. (English) Zbl 0958.05053 Discrete Math. 191, No. 1-3, 65-82 (1998). MSC: 05C15 05C12 PDFBibTeX XMLCite \textit{G. Chen} et al., Discrete Math. 191, No. 1--3, 65--82 (1998; Zbl 0958.05053) Full Text: DOI
Horňák, Mirko; Jendrol’, Stanislav On the \(d\)-distance face chromatic number of plane graphs. (English) Zbl 0880.05040 Discrete Math. 164, No. 1-3, 171-174 (1997). Reviewer: R.Scapellato (Milano) MSC: 05C15 05C12 05C10 PDFBibTeX XMLCite \textit{M. Horňák} and \textit{S. Jendrol'}, Discrete Math. 164, No. 1--3, 171--174 (1997; Zbl 0880.05040) Full Text: DOI