Zhang, Li; Lu, You; Zhang, Shenggui Edge DP-coloring in planar graphs. (English) Zbl 07327851 Discrete Math. 344, No. 5, Article ID 112314, 7 p. (2021). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{L. Zhang} et al., Discrete Math. 344, No. 5, Article ID 112314, 7 p. (2021; Zbl 07327851) Full Text: DOI
Chang, Fei-Huang; Chia, Ma-Lian; Jiang, Shih-Ang; Kuo, David; Liaw, Sheng-Chyang \( L ( p , q )\)-labelings of subdivisions of graphs. (English) Zbl 07327716 Discrete Appl. Math. 291, 264-270 (2021). MSC: 05C78 05C70 PDF BibTeX XML Cite \textit{F.-H. Chang} et al., Discrete Appl. Math. 291, 264--270 (2021; Zbl 07327716) Full Text: DOI
Hu, Linna; Sun, Lei; Wu, Jian-Liang List edge coloring of planar graphs without 6-cycles with two chords. (English) Zbl 1453.05034 Discuss. Math., Graph Theory 41, No. 1, 199-211 (2021). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{L. Hu} et al., Discuss. Math., Graph Theory 41, No. 1, 199--211 (2021; Zbl 1453.05034) Full Text: DOI
Sun, Lin; Wu, Jianliang; Wang, Bing; Liu, Bin The list edge coloring and list total coloring of planar graphs with maximum degree at least 7. (English) Zbl 1446.05037 Discuss. Math., Graph Theory 40, No. 4, 1005-1024 (2020). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{L. Sun} et al., Discuss. Math., Graph Theory 40, No. 4, 1005--1024 (2020; Zbl 1446.05037) Full Text: DOI
van Bulck, David; Goossens, Dries Handling fairness issues in time-relaxed tournaments with availability constraints. (English) Zbl 07157812 Comput. Oper. Res. 115, Article ID 104856, 20 p. (2020). MSC: 90B PDF BibTeX XML Cite \textit{D. van Bulck} and \textit{D. Goossens}, Comput. Oper. Res. 115, Article ID 104856, 20 p. (2020; Zbl 07157812) Full Text: DOI
Zhu, Xuding A refinement of choosability of graphs. (English) Zbl 1430.05046 J. Comb. Theory, Ser. B 141, 143-164 (2020). MSC: 05C15 05C22 05C10 05A17 PDF BibTeX XML Cite \textit{X. Zhu}, J. Comb. Theory, Ser. B 141, 143--164 (2020; Zbl 1430.05046) Full Text: DOI arXiv
Kaul, Hemanshu; Mudrock, Jeffrey A. List coloring a Cartesian product with a complete bipartite factor. (English) Zbl 1431.05071 Graphs Comb. 35, No. 6, 1571-1583 (2019). MSC: 05C15 05C76 PDF BibTeX XML Cite \textit{H. Kaul} and \textit{J. A. Mudrock}, Graphs Comb. 35, No. 6, 1571--1583 (2019; Zbl 1431.05071) Full Text: DOI arXiv
Haxell, Penny; Krivelevich, Michael; Kronenberg, Gal Goldberg’s conjecture is true for random multigraphs. (English) Zbl 1415.05165 J. Comb. Theory, Ser. B 138, 314-349 (2019). MSC: 05C80 05C15 PDF BibTeX XML Cite \textit{P. Haxell} et al., J. Comb. Theory, Ser. B 138, 314--349 (2019; Zbl 1415.05165) Full Text: DOI arXiv
Zhang, Xin; Niu, Bei; Yu, Jiguo A structure of 1-planar graph and its applications to coloring problems. (English) Zbl 1416.05086 Graphs Comb. 35, No. 3, 677-688 (2019). MSC: 05C10 05C15 05C78 05C62 PDF BibTeX XML Cite \textit{X. Zhang} et al., Graphs Comb. 35, No. 3, 677--688 (2019; Zbl 1416.05086) Full Text: DOI
Wang, Huijuan; Pardalos, Panos M.; Liu, Bin Optimal channel assignment with list-edge coloring. (English) Zbl 1420.05062 J. Comb. Optim. 38, No. 1, 197-207 (2019). MSC: 05C15 05C10 05C30 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Comb. Optim. 38, No. 1, 197--207 (2019; Zbl 1420.05062) Full Text: DOI
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 PDF BibTeX XML Cite \textit{J. Hu} et al., Discrete Math. 342, No. 5, 1392--1402 (2019; Zbl 1411.05090) Full Text: DOI
Kaul, Hemanshu; Mudrock, Jeffrey A. On the Alon-Tarsi number and chromatic-choosability of Cartesian products of graphs. (English) Zbl 1409.05110 Electron. J. Comb. 26, No. 1, Research Paper P1.3, 13 p. (2019). MSC: 05C30 05C15 05C76 PDF BibTeX XML Cite \textit{H. Kaul} and \textit{J. A. Mudrock}, Electron. J. Comb. 26, No. 1, Research Paper P1.3, 13 p. (2019; Zbl 1409.05110) Full Text: Link arXiv
Harrelson, Joshua; McDonald, Jessica; Puleo, Gregory J. List-edge-colouring planar graphs with precoloured edges. (English) Zbl 1400.05084 Eur. J. Comb. 75, 55-65 (2019). MSC: 05C15 05C10 05C07 PDF BibTeX XML Cite \textit{J. Harrelson} et al., Eur. J. Comb. 75, 55--65 (2019; Zbl 1400.05084) Full Text: DOI arXiv
Kaul, Hemanshu; Mudrock, Jeffrey A.; Pelsmajer, Michael J. Total equitable list coloring. (English) Zbl 1402.05071 Graphs Comb. 34, No. 6, 1637-1649 (2018). MSC: 05C15 PDF BibTeX XML Cite \textit{H. Kaul} et al., Graphs Comb. 34, No. 6, 1637--1649 (2018; Zbl 1402.05071) Full Text: DOI arXiv
Edwards, Katherine; Girão, António; van den Heuvel, Jan; Kang, Ross J.; Puleo, Gregory J.; Sereni, Jean-Sébastien Extension from precoloured sets of edges. (English) Zbl 1393.05115 Electron. J. Comb. 25, No. 3, Research Paper P3.1, 28 p. (2018). MSC: 05C15 05C07 05C35 PDF BibTeX XML Cite \textit{K. Edwards} et al., Electron. J. Comb. 25, No. 3, Research Paper P3.1, 28 p. (2018; Zbl 1393.05115) Full Text: Link arXiv
Wang, Bing; Wu, Jian-Liang; Sun, Lin Total colorings of embedded graphs with no 3-cycles adjacent to 4-cycles. (English) Zbl 1392.05045 Discuss. Math., Graph Theory 38, No. 4, 977-989 (2018). MSC: 05C15 05C38 05C60 PDF BibTeX XML Cite \textit{B. Wang} et al., Discuss. Math., Graph Theory 38, No. 4, 977--989 (2018; Zbl 1392.05045) Full Text: DOI
Wang, Huijuan; Liu, Bin; Gai, Ling; Du, Hongwei; Wu, Jianliang Minimum choosability of planar graphs. (English) Zbl 1441.05064 J. Comb. Optim. 36, No. 1, 13-22 (2018). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Comb. Optim. 36, No. 1, 13--22 (2018; Zbl 1441.05064) Full Text: DOI
Zhu, Haiyang; Miao, Lianying; Chen, Sheng; Lü, Xinzhong; Song, Wenyao The List \(L(2, 1)\)-labeling of planar graphs. (English) Zbl 1388.05164 Discrete Math. 341, No. 8, 2211-2219 (2018). MSC: 05C78 05C10 PDF BibTeX XML Cite \textit{H. Zhu} et al., Discrete Math. 341, No. 8, 2211--2219 (2018; Zbl 1388.05164) Full Text: DOI
Bruhn, Henning; Gellert, Laura; Lang, Richard Chromatic index, treewidth and maximum degree. (English) Zbl 1391.05102 Electron. J. Comb. 25, No. 2, Research Paper P2.23, 14 p. (2018). MSC: 05C15 05C72 05C75 PDF BibTeX XML Cite \textit{H. Bruhn} et al., Electron. J. Comb. 25, No. 2, Research Paper P2.23, 14 p. (2018; Zbl 1391.05102) Full Text: Link
Wang, Haiying; Wu, Jianliang List-edge-coloring of planar graphs without 6-cycles with three chords. (English) Zbl 1386.05071 J. Comb. Optim. 35, No. 2, 555-562 (2018). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{H. Wang} and \textit{J. Wu}, J. Comb. Optim. 35, No. 2, 555--562 (2018; Zbl 1386.05071) Full Text: DOI
Hu, Dai-Qiang; Wu, Jian-Liang; Yang, Donglei; Zhang, Xin On the equitable edge-coloring of 1-planar graphs and planar graphs. (English) Zbl 1371.05086 Graphs Comb. 33, No. 4, 945-953 (2017). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{D.-Q. Hu} et al., Graphs Comb. 33, No. 4, 945--953 (2017; Zbl 1371.05086) Full Text: DOI
Batueva, Ts. Ch-D.; Borodin, O. V.; Bykov, M. A.; Ivanova, A. O.; Kazak, O. N.; Nikiforov, D. V. Refined weight of edges in normal plane maps. (English) Zbl 1369.05097 Discrete Math. 340, No. 11, 2659-2664 (2017). MSC: 05C22 05C10 PDF BibTeX XML Cite \textit{Ts. C. D. Batueva} et al., Discrete Math. 340, No. 11, 2659--2664 (2017; Zbl 1369.05097) Full Text: DOI
Vasil’eva, E. I.; Pyatkin, A. V. On list incidentor \((k,l)\)-coloring. (Russian, English) Zbl 1374.05095 Diskretn. Anal. Issled. Oper. 24, No. 1, 21-30 (2017); translation in J. Appl. Ind. Math. 11, No. 1, 125-129 (2017). MSC: 05C15 PDF BibTeX XML Cite \textit{E. I. Vasil'eva} and \textit{A. V. Pyatkin}, Diskretn. Anal. Issled. Oper. 24, No. 1, 21--30 (2017; Zbl 1374.05095); translation in J. Appl. Ind. Math. 11, No. 1, 125--129 (2017) Full Text: DOI
Cranston, Daniel W.; Rabern, Landon List-coloring claw-free graphs with \(\Delta-1\) colors. (English) Zbl 1362.05046 SIAM J. Discrete Math. 31, No. 2, 726-748 (2017). MSC: 05C15 05C07 05C35 PDF BibTeX XML Cite \textit{D. W. Cranston} and \textit{L. Rabern}, SIAM J. Discrete Math. 31, No. 2, 726--748 (2017; Zbl 1362.05046) Full Text: DOI arXiv
Sun, Lin; Wu, Jian-Liang On \((p,1)\)-total labelling of planar graphs. (English) Zbl 1357.05137 J. Comb. Optim. 33, No. 1, 317-325 (2017). MSC: 05C78 05C10 PDF BibTeX XML Cite \textit{L. Sun} and \textit{J.-L. Wu}, J. Comb. Optim. 33, No. 1, 317--325 (2017; Zbl 1357.05137) 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 PDF BibTeX XML Cite \textit{D. W. Cranston} and \textit{D. B. West}, Discrete Math. 340, No. 4, 766--793 (2017; Zbl 1355.05104) Full Text: DOI arXiv
Sun, Lin; Wu, Jian Liang; Cai, Hua A totally \((\Delta + 1)\)-colorable 1-planar graph with girth at least five. (English) Zbl 1359.05047 Acta Math. Sin., Engl. Ser. 32, No. 11, 1337-1349 (2016). MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun} et al., Acta Math. Sin., Engl. Ser. 32, No. 11, 1337--1349 (2016; Zbl 1359.05047) Full Text: DOI
Bruhn, Henning; Gellert, Laura; Lang, Richard Chromatic index, treewidth and maximum degree. (English) Zbl 1356.05047 de Mier, Anna (ed.) et al., Discrete mathematical days. Extended abstracts of the 10th “Jornadas de matemática discreta y algorítmica” (JMDA), Barcelona, Spain, July 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 54, 259-264 (2016). MSC: 05C15 05C07 05C35 PDF BibTeX XML Cite \textit{H. Bruhn} et al., Electron. Notes Discrete Math. 54, 259--264 (2016; Zbl 1356.05047) Full Text: DOI arXiv
Kayll, P. Mark Two chromatic conjectures: one for vertices and one for edges. (English) Zbl 1352.05071 Gera, Ralucca (ed.) et al., Graph theory. Favorite conjectures and open problems – 1. Cham: Springer (ISBN 978-3-319-31938-4/hbk; 978-3-319-31940-7/ebook). Problem Books in Mathematics, 171-194 (2016). MSC: 05C15 05C65 05-03 01A65 01A70 PDF BibTeX XML Cite \textit{P. M. Kayll}, in: Graph theory. Favorite conjectures and open problems -- 1. Cham: Springer. 171--194 (2016; Zbl 1352.05071) Full Text: DOI
Meeks, Kitty; Scott, Alexander The parameterised complexity of list problems on graphs of bounded treewidth. (English) Zbl 1353.68134 Inf. Comput. 251, 91-103 (2016). MSC: 68Q25 05C15 PDF BibTeX XML Cite \textit{K. Meeks} and \textit{A. Scott}, Inf. Comput. 251, 91--103 (2016; Zbl 1353.68134) Full Text: DOI arXiv
Aksenov, Valerii A.; Borodin, Oleg V.; Ivanova, Anna O. An extension of Kotzig’s theorem. (English) Zbl 1350.05026 Discuss. Math., Graph Theory 36, No. 4, 889-897 (2016). MSC: 05C15 PDF BibTeX XML Cite \textit{V. A. Aksenov} et al., Discuss. Math., Graph Theory 36, No. 4, 889--897 (2016; Zbl 1350.05026) Full Text: DOI
Wang, Huijuan; Liu, Bin; Zhang, Xin; Wu, Lidong; Wu, Weili; Gao, Hongwei List edge and list total coloring of planar graphs with maximum degree 8. (English) Zbl 1348.05086 J. Comb. Optim. 32, No. 1, 188-197 (2016). MSC: 05C15 05C10 05C07 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Comb. Optim. 32, No. 1, 188--197 (2016; Zbl 1348.05086) Full Text: DOI
Qu, Cunquan; Wang, Guanghui; Yan, Guiying; Yu, Xiaowei Neighbor sum distinguishing total choosability of planar graphs. (English) Zbl 1348.05082 J. Comb. Optim. 32, No. 3, 906-916 (2016). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{C. Qu} et al., J. Comb. Optim. 32, No. 3, 906--916 (2016; Zbl 1348.05082) Full Text: DOI
Schauz, Uwe The tournament scheduling problem with absences. (English) Zbl 1346.90386 Eur. J. Oper. Res. 254, No. 3, 746-754 (2016). MSC: 90B35 05C15 90C35 PDF BibTeX XML Cite \textit{U. Schauz}, Eur. J. Oper. Res. 254, No. 3, 746--754 (2016; Zbl 1346.90386) Full Text: DOI arXiv
Fabrici, Igor; Jendrol’, Stanislav; Voigt, Margit Facial list colourings of plane graphs. (English) Zbl 1339.05130 Discrete Math. 339, No. 11, 2826-2831 (2016). MSC: 05C15 05C10 05C40 PDF BibTeX XML Cite \textit{I. Fabrici} et al., Discrete Math. 339, No. 11, 2826--2831 (2016; Zbl 1339.05130) Full Text: DOI
Bruhn, Henning; Lang, Richard; Stein, Maya List edge-coloring and total coloring in graphs of low treewidth. (English) Zbl 1339.05114 J. Graph Theory 81, No. 3, 272-282 (2016). Reviewer: Baoyindureng Wu (Urumqi) MSC: 05C15 05C12 05C05 05C07 05C35 PDF BibTeX XML Cite \textit{H. Bruhn} et al., J. Graph Theory 81, No. 3, 272--282 (2016; Zbl 1339.05114) Full Text: DOI
Wang, Huijuan; Wu, Lidong; Zhang, Xin; Wu, Weili; Liu, Bin A note on the minimum number of choosability of planar graphs. (English) Zbl 1344.90065 J. Comb. Optim. 31, No. 3, 1013-1022 (2016). MSC: 90C35 05C15 90C27 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Comb. Optim. 31, No. 3, 1013--1022 (2016; Zbl 1344.90065) Full Text: DOI
Borodin, O. V.; Ivanova, A. O. Weight of edges in normal plane maps. (English) Zbl 1333.05084 Discrete Math. 339, No. 5, 1507-1511 (2016). MSC: 05C10 05C22 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, Discrete Math. 339, No. 5, 1507--1511 (2016; Zbl 1333.05084) Full Text: DOI
Cai, Hua Total coloring of planar graphs without chordal 7-cycles. (English) Zbl 1334.05036 Acta Math. Sin., Engl. Ser. 31, No. 12, 1951-1962 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{H. Cai}, Acta Math. Sin., Engl. Ser. 31, No. 12, 1951--1962 (2015; Zbl 1334.05036) Full Text: DOI
Bonamy, Marthe Planar graphs with \(\Delta\geq 8\) are (\(\Delta+1\))-edge-choosable. (English) Zbl 1321.05061 SIAM J. Discrete Math. 29, No. 3, 1735-1763 (2015). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{M. Bonamy}, SIAM J. Discrete Math. 29, No. 3, 1735--1763 (2015; Zbl 1321.05061) Full Text: DOI
Cai, Jiansheng List edge coloring of planar graphs without non-induced 6-cycles. (English) Zbl 1317.05051 Graphs Comb. 31, No. 4, 827-832 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{J. Cai}, Graphs Comb. 31, No. 4, 827--832 (2015; Zbl 1317.05051) Full Text: DOI
Noel, Jonathan A.; Reed, Bruce A.; Wu, Hehui A proof of a conjecture of Ohba. (English) Zbl 1320.05045 J. Graph Theory 79, No. 2, 86-102 (2015). Reviewer: Peter Horák (Tacoma) MSC: 05C15 PDF BibTeX XML Cite \textit{J. A. Noel} et al., J. Graph Theory 79, No. 2, 86--102 (2015; Zbl 1320.05045) Full Text: DOI arXiv
Kim, Seog-Jin; Park, Boram Counterexamples to the list square coloring conjecture. (English) Zbl 1309.05075 J. Graph Theory 78, No. 4, 239-247 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{S.-J. Kim} and \textit{B. Park}, J. Graph Theory 78, No. 4, 239--247 (2015; Zbl 1309.05075) Full Text: DOI arXiv
Kim, Seog-Jin; Kwon, Young Soo; Park, Boram Chromatic-choosability of the power of graphs. (English) Zbl 1303.05064 Discrete Appl. Math. 180, 120-125 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{S.-J. Kim} et al., Discrete Appl. Math. 180, 120--125 (2015; Zbl 1303.05064) Full Text: DOI arXiv
Chang, Fei-Huang; Chia, Ma-Lian; Kuo, David; Liaw, Sheng-Chyang; Tsai, Meng-Hsuan \(L(2,1)\)-labelings of subdivisions of graphs. (English) Zbl 1303.05171 Discrete Math. 338, No. 2, 248-255 (2015). MSC: 05C78 PDF BibTeX XML Cite \textit{F.-H. Chang} et al., Discrete Math. 338, No. 2, 248--255 (2015; Zbl 1303.05171) Full Text: DOI
Wang, Huijuan; Wu, Lidong; Wu, Weili; Pardalos, Panos M.; Wu, Jianliang Minimum total coloring of planar graph. (English) Zbl 1308.90193 J. Glob. Optim. 60, No. 4, 777-791 (2014). MSC: 90C35 05C15 PDF BibTeX XML Cite \textit{H. Wang} et al., J. Glob. Optim. 60, No. 4, 777--791 (2014; Zbl 1308.90193) Full Text: DOI
Bonamy, Marthe; Lévêque, Benjamin; Pinlou, Alexandre List coloring the square of sparse graphs with large degree. (English) Zbl 1300.05090 Eur. J. Comb. 41, 128-137 (2014). MSC: 05C15 05C42 05C07 05C35 PDF BibTeX XML Cite \textit{M. Bonamy} et al., Eur. J. Comb. 41, 128--137 (2014; Zbl 1300.05090) Full Text: DOI arXiv
Wang, Bing; Wu, Jian-Liang; Wang, Hui-Juan Total colorings of planar graphs without chordal 6-cycles. (English) Zbl 1288.05104 Discrete Appl. Math. 171, 116-121 (2014). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{B. Wang} et al., Discrete Appl. Math. 171, 116--121 (2014; Zbl 1288.05104) Full Text: DOI
Wang, Hui Juan; Wu, Jian Liang A note on list edge and list total coloring of planar graphs without adjacent short cycles. (English) Zbl 1283.05112 Acta Math. Sin., Engl. Ser. 30, No. 1, 91-96 (2014). MSC: 05C15 05C38 05C10 PDF BibTeX XML Cite \textit{H. J. Wang} and \textit{J. L. Wu}, Acta Math. Sin., Engl. Ser. 30, No. 1, 91--96 (2014; Zbl 1283.05112) Full Text: DOI
Aubry, Yves; Godin, Jean-Christophe; Togni, Olivier Every triangle-free induced subgraph of the triangular lattice is \((5m,2m)\)-choosable. (English) Zbl 1283.05182 Discrete Appl. Math. 166, 51-58 (2014). MSC: 05C60 05C22 94A12 PDF BibTeX XML Cite \textit{Y. Aubry} et al., Discrete Appl. Math. 166, 51--58 (2014; Zbl 1283.05182) Full Text: DOI
Rabern, Landon A game generalizing Hall’s theorem. (English) Zbl 1281.05097 Discrete Math. 320, 87-91 (2014). MSC: 05C57 05D15 91A05 91A43 PDF BibTeX XML Cite \textit{L. Rabern}, Discrete Math. 320, 87--91 (2014; Zbl 1281.05097) Full Text: DOI arXiv
Zhang, Xin List total coloring of pseudo-outerplanar graphs. (English) Zbl 1281.05065 Discrete Math. 313, No. 20, 2297-2306 (2013). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{X. Zhang}, Discrete Math. 313, No. 20, 2297--2306 (2013; Zbl 1281.05065) Full Text: DOI arXiv
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 PDF BibTeX XML Cite \textit{R. C. S. Machado} et al., Discrete Math. 313, No. 14, 1547--1552 (2013; Zbl 1408.05063) Full Text: DOI arXiv
Lü, Damei; Lin, Nianfeng \(L(d,1)\)-labelings of the edge-path-replacement of a graph. (English) Zbl 1282.90218 J. Comb. Optim. 26, No. 4, 819-831 (2013). MSC: 90C35 PDF BibTeX XML Cite \textit{D. Lü} and \textit{N. Lin}, J. Comb. Optim. 26, No. 4, 819--831 (2013; Zbl 1282.90218) Full Text: DOI
Damei, Lü \(L(2, 1)\)-labelings of the edge-path-replacement of a graph. (English) Zbl 1275.90115 J. Comb. Optim. 26, No. 2, 385-392 (2013). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{L. Damei}, J. Comb. Optim. 26, No. 2, 385--392 (2013; Zbl 1275.90115) Full Text: DOI
Lai, H. J.; Omidi, G. R.; Raeisi, G. On group choosability of total graphs. (English) Zbl 1267.05119 Graphs Comb. 29, No. 3, 585-597 (2013). MSC: 05C15 05C20 PDF BibTeX XML Cite \textit{H. J. Lai} et al., Graphs Comb. 29, No. 3, 585--597 (2013; Zbl 1267.05119) Full Text: DOI arXiv
Chia, Ma-Lian; Kuo, David; Yan, Jing-Ho; Yang, Siou-Ru \((p,q)\)-total labeling of complete graphs. (English) Zbl 1294.90065 J. Comb. Optim. 25, No. 4, 543-561 (2013). MSC: 90C35 90C27 PDF BibTeX XML Cite \textit{M.-L. Chia} et al., J. Comb. Optim. 25, No. 4, 543--561 (2013; Zbl 1294.90065) Full Text: DOI
Zhang, Xin; Liu, Guizhen The structure of plane graphs with independent crossings and its applications to coloring problems. (English) Zbl 1258.05028 Cent. Eur. J. Math. 11, No. 2, 308-321 (2013). MSC: 05C10 05C62 05C15 05C35 PDF BibTeX XML Cite \textit{X. Zhang} and \textit{G. Liu}, Cent. Eur. J. Math. 11, No. 2, 308--321 (2013; Zbl 1258.05028) Full Text: DOI
Zhang, Xin; Wu, Jianliang; Liu, Guizhen List edge and list total coloring of 1-planar graphs. (English) Zbl 1254.05050 Front. Math. China 7, No. 5, 1005-1018 (2012). MSC: 05C10 05C15 05C07 05C35 PDF BibTeX XML Cite \textit{X. Zhang} et al., Front. Math. China 7, No. 5, 1005--1018 (2012; Zbl 1254.05050) Full Text: DOI
Ito, Takehiro; Kamiński, Marcin; Demaine, Erik D. Reconfiguration of list edge-colorings in a graph. (English) Zbl 1252.05064 Discrete Appl. Math. 160, No. 15, 2199-2207 (2012). MSC: 05C15 PDF BibTeX XML Cite \textit{T. Ito} et al., Discrete Appl. Math. 160, No. 15, 2199--2207 (2012; Zbl 1252.05064) 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 PDF BibTeX XML Cite \textit{G. J. Chang} and \textit{N. Roussel}, Discrete Math. 312, No. 14, 2126--2130 (2012; Zbl 1244.05070) Full Text: DOI
Machado, Raphael; de Figueiredo, Celina Complexity separating classes for edge-colouring and total-colouring. (English) Zbl 1275.68074 J. Braz. Comput. Soc. 17, No. 4, 281-285 (2011). MSC: 68Q17 05C15 PDF BibTeX XML Cite \textit{R. Machado} and \textit{C. de Figueiredo}, J. Braz. Comput. Soc. 17, No. 4, 281--285 (2011; Zbl 1275.68074) Full Text: DOI
Wang, Bing; Wu, Jian-Liang Total coloring of planar graphs with maximum degree \(7\). (English) Zbl 1260.05064 Inf. Process. Lett. 111, No. 20, 1019-1021 (2011). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{B. Wang} and \textit{J.-L. Wu}, Inf. Process. Lett. 111, No. 20, 1019--1021 (2011; Zbl 1260.05064) Full Text: DOI
Wu, Qian; Lu, Qiuli; Wang, Yingqian \((\Delta +1)\)-total-colorability of plane graphs of maximum degree \(\Delta\geq 6\) with neither chordal \(5\)-cycle nor chordal \(6\)-cycle. (English) Zbl 1260.05065 Inf. Process. Lett. 111, No. 15, 767-772 (2011). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{Q. Wu} et al., Inf. Process. Lett. 111, No. 15, 767--772 (2011; Zbl 1260.05065) Full Text: DOI
Liu, Bin; Hou, Jian Feng; Liu, Gui Zhen List total colorings of planar graphs without triangles at small distance. (English) Zbl 1260.05063 Acta Math. Sin., Engl. Ser. 27, No. 12, 2437-2444 (2011). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{B. Liu} et al., Acta Math. Sin., Engl. Ser. 27, No. 12, 2437--2444 (2011; Zbl 1260.05063) Full Text: DOI
Zhang, Xin; Yu, Yong; Liu, Guizhen On \((p,1)\)-total labelling of 1-planar graphs. (English) Zbl 1227.05135 Cent. Eur. J. Math. 9, No. 6, 1424-1434 (2011). MSC: 05C10 05C15 05C78 PDF BibTeX XML Cite \textit{X. Zhang} et al., Cent. Eur. J. Math. 9, No. 6, 1424--1434 (2011; Zbl 1227.05135) Full Text: DOI
Wang, Weifan; Zhu, Xuding Entire colouring of plane graphs. (English) Zbl 1234.05106 J. Comb. Theory, Ser. B 101, No. 6, 490-501 (2011). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{W. Wang} and \textit{X. Zhu}, J. Comb. Theory, Ser. B 101, No. 6, 490--501 (2011; Zbl 1234.05106) Full Text: DOI
Machado, R. C. S.; de Figueiredo, C. M. H. Total chromatic number of unichord-free graphs. (English) Zbl 1228.05157 Discrete Appl. Math. 159, No. 16, 1851-1864 (2011). MSC: 05C15 05C35 05C38 PDF BibTeX XML Cite \textit{R. C. S. Machado} and \textit{C. M. H. de Figueiredo}, Discrete Appl. Math. 159, No. 16, 1851--1864 (2011; Zbl 1228.05157) Full Text: DOI
Li, Rui; Xu, Baogang Edge choosability and total choosability of planar graphs with no 3-cycles adjacent 4-cycles. (English) Zbl 1245.05050 Discrete Math. 311, No. 20, 2158-2163 (2011). Reviewer: Ulrike Baumann (Dresden) MSC: 05C15 PDF BibTeX XML Cite \textit{R. Li} and \textit{B. Xu}, Discrete Math. 311, No. 20, 2158--2163 (2011; Zbl 1245.05050) 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 PDF BibTeX XML Cite \textit{B. Wang} and \textit{J.-L. Wu}, Discrete Math. 311, No. 18--19, 2025--2030 (2011; Zbl 1244.05098) Full Text: DOI
Sheng, Huiyu; Wang, Yingqian A structural theorem for planar graphs with some applications. (English) Zbl 1223.05251 Discrete Appl. Math. 159, No. 11, 1183-1187 (2011). MSC: 05C75 05C10 05C15 PDF BibTeX XML Cite \textit{H. Sheng} and \textit{Y. Wang}, Discrete Appl. Math. 159, No. 11, 1183--1187 (2011; Zbl 1223.05251) Full Text: DOI
Ito, Takehiro; Kawamura, Kazuto; Zhou, Xiao An improved sufficient condition for reconfiguration of list edge-colorings in a tree. (English) Zbl 1333.05112 Ogihara, Mitsunori (ed.) et al., Theory and applications of models of computation. 8th annual conference, TAMC 2011, Tokyo, Japan, May 23–25, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-20876-8/pbk). Lecture Notes in Computer Science 6648, 94-105 (2011). MSC: 05C15 05C05 05C85 68Q25 PDF BibTeX XML Cite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 6648, 94--105 (2011; Zbl 1333.05112) Full Text: DOI
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin Injective colorings of graphs with low average degree. (English) Zbl 1218.05046 Algorithmica 60, No. 3, 553-568 (2011). MSC: 05C15 PDF BibTeX XML Cite \textit{D. W. Cranston} et al., Algorithmica 60, No. 3, 553--568 (2011; Zbl 1218.05046) Full Text: DOI arXiv
Ma, Qiaoling; Wang, Jihui; Cai, Jiansheng; Zhang, Sumei A note on edge-choosability of planar graphs without intersecting 4-cycles. (English) Zbl 1222.05069 J. Appl. Math. Comput. 36, No. 1-2, 367-372 (2011). MSC: 05C15 05C38 PDF BibTeX XML Cite \textit{Q. Ma} et al., J. Appl. Math. Comput. 36, No. 1--2, 367--372 (2011; Zbl 1222.05069) Full Text: DOI
Sereni, Jean-Sébastien; Stehlík, Matěj Edge-face coloring of plane graphs with maximum degree nine. (English) Zbl 1221.05162 J. Graph Theory 66, No. 4, 332-346 (2011). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{J.-S. Sereni} and \textit{M. Stehlík}, J. Graph Theory 66, No. 4, 332--346 (2011; Zbl 1221.05162) Full Text: DOI
Roussel, Nicolas Total choosability of planar graphs with maximum degree 4. (English) Zbl 1203.05059 Discrete Appl. Math. 159, No. 1, 87-89 (2011). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{N. Roussel}, Discrete Appl. Math. 159, No. 1, 87--89 (2011; Zbl 1203.05059) Full Text: DOI
Borodin, O. V.; Ivanova, A. O. List injective colorings of planar graphs. (English) Zbl 1216.05027 Discrete Math. 311, No. 2-3, 154-165 (2011). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{O. V. Borodin} and \textit{A. O. Ivanova}, Discrete Math. 311, No. 2--3, 154--165 (2011; Zbl 1216.05027) Full Text: DOI
Chang, Gerard Jennhwa; Hou, Jianfeng; Roussel, Nicolas On the total choosability of planar graphs and of sparse graphs. (English) Zbl 1234.05081 Inf. Process. Lett. 110, No. 20, 849-853 (2010). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{G. J. Chang} et al., Inf. Process. Lett. 110, No. 20, 849--853 (2010; Zbl 1234.05081) Full Text: DOI
Zhang, Jingwen; Wang, Yingqian \((\Delta + 1)\)-total-colorability of plane graphs with maximum degree \(\Delta\) at least 6 and without adjacent short cycles. (English) Zbl 1234.05108 Inf. Process. Lett. 110, No. 18-19, 830-834 (2010). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{J. Zhang} and \textit{Y. Wang}, Inf. Process. Lett. 110, No. 18--19, 830--834 (2010; Zbl 1234.05108) Full Text: DOI
Borodin, O. V.; Ivanova, A. O.; Montassier, M.; Ochem, P.; Raspaud, A. Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most \(k\). (English) Zbl 1209.05177 J. Graph Theory 65, No. 2, 83-93 (2010). MSC: 05C70 05C15 PDF BibTeX XML Cite \textit{O. V. Borodin} et al., J. Graph Theory 65, No. 2, 83--93 (2010; Zbl 1209.05177) 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 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{F. Havet}, Discrete Math. 310, No. 21, 3049--3051 (2010; Zbl 1208.05016) Full Text: DOI
Cranston, Daniel W.; Kim, Seog-Jin; Yu, Gexin Injective colorings of sparse graphs. (English) Zbl 1209.05075 Discrete Math. 310, No. 21, 2965-2973 (2010). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{D. W. Cranston} et al., Discrete Math. 310, No. 21, 2965--2973 (2010; Zbl 1209.05075) Full Text: DOI arXiv
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 PDF BibTeX XML Cite \textit{L. Shen} and \textit{Y. Wang}, Discrete Math. 310, No. 17--18, 2372--2379 (2010; Zbl 1220.05028) 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 PDF BibTeX XML Cite \textit{D. R. Woodall}, Discrete Math. 310, No. 6--7, 1167--1171 (2010; Zbl 1230.05104) Full Text: DOI
Machado, R. C. S.; De Figueiredo, C. M. H.; Vušković, K. Chromatic index of graphs with no cycle with a unique chord. (English) Zbl 1213.05150 Theor. Comput. Sci. 411, No. 7-9, 1221-1234 (2010). MSC: 05C38 05C15 PDF BibTeX XML Cite \textit{R. C. S. Machado} et al., Theor. Comput. Sci. 411, No. 7--9, 1221--1234 (2010; Zbl 1213.05150) Full Text: DOI
Cai, Jiansheng; Hou, Jianfeng; Zhang, Xia; Liu, Guizhen Edge-choosability of planar graphs without non-induced 5-cycles. (English) Zbl 1189.05058 Inf. Process. Lett. 109, No. 7, 343-346 (2009). MSC: 05C15 05C78 PDF BibTeX XML Cite \textit{J. Cai} et al., Inf. Process. Lett. 109, No. 7, 343--346 (2009; Zbl 1189.05058) 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 PDF BibTeX XML Cite \textit{B. Liu} et al., Discrete Math. 309, No. 20, 6035--6043 (2009; Zbl 1204.05047) Full Text: DOI
Shen, Lan; Wang, Yingqian On the 7 total colorability of planar graphs with maximum degree 6 and without 4-cycles. (English) Zbl 1221.05164 Graphs Comb. 25, No. 3, 401-407 (2009). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{L. Shen} and \textit{Y. Wang}, Graphs Comb. 25, No. 3, 401--407 (2009; Zbl 1221.05164) Full Text: DOI
Cranston, Daniel W. Multigraphs with \(\Delta \geq 3\) are totally-\((2\Delta - 1)\)-choosable. (English) Zbl 1221.05133 Graphs Comb. 25, No. 1, 35-40 (2009). MSC: 05C15 PDF BibTeX XML Cite \textit{D. W. Cranston}, Graphs Comb. 25, No. 1, 35--40 (2009; Zbl 1221.05133) Full Text: DOI arXiv
Lih, Ko-Wei; Liu, Daphne Der-Fen; Wang, Weifan On \((d,1)\)-total numbers of graphs. (English) Zbl 1208.05130 Discrete Math. 309, No. 12, 3767-3773 (2009). MSC: 05C78 PDF BibTeX XML Cite \textit{K.-W. Lih} et al., Discrete Math. 309, No. 12, 3767--3773 (2009; Zbl 1208.05130) Full Text: DOI
Ito, Takehiro; Kamiński, Marcin; Demaine, Erik D. Reconfiguration of list edge-colorings in a graph. (English) Zbl 1253.68263 Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 375-386 (2009). MSC: 68R10 05C15 05C85 PDF BibTeX XML Cite \textit{T. Ito} et al., Lect. Notes Comput. Sci. 5664, 375--386 (2009; Zbl 1253.68263) Full Text: DOI
Ma, Qin; Wu, Jian-Liang; Yu, Xiao Planar graphs without 5-cycles or without 6-cycles. (English) Zbl 1186.05043 Discrete Math. 309, No. 10, 2998-3005 (2009). Reviewer: Dan S. Archdeacon (Burlington) MSC: 05C10 05C15 05C35 PDF BibTeX XML Cite \textit{Q. Ma} et al., Discrete Math. 309, No. 10, 2998--3005 (2009; Zbl 1186.05043) 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 PDF BibTeX XML Cite \textit{W. Wang}, Discrete Math. 309, No. 11, 3523--3533 (2009; Zbl 1213.05103) Full Text: DOI
Chen, Yongzhu; Zhu, Weiyi; Wang, Weifan Edge choosability of planar graphs without 5-cycles with a chord. (English) Zbl 1198.05043 Discrete Math. 309, No. 8, 2233-2238 (2009). MSC: 05C15 05C10 05C78 PDF BibTeX XML Cite \textit{Y. Chen} et al., Discrete Math. 309, No. 8, 2233--2238 (2009; Zbl 1198.05043) Full Text: DOI
Hou, Jianfeng; Liu, Guizhen; Cai, Jiansheng Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. (English) Zbl 1197.05051 Discrete Math. 309, No. 1, 77-84 (2009). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{J. Hou} et al., Discrete Math. 309, No. 1, 77--84 (2009; Zbl 1197.05051) Full Text: DOI
Sereni, Jean-Sébastien Randomly colouring graphs (a combinatorial view). (English) Zbl 1302.05060 Comput. Sci. Rev. 2, No. 2, 63-95 (2008). MSC: 05C15 05C80 05-02 PDF BibTeX XML Cite \textit{J.-S. Sereni}, Comput. Sci. Rev. 2, No. 2, 63--95 (2008; Zbl 1302.05060) Full Text: DOI
Liu, Bin; Hou, Jianfeng; Liu, Guizhen List edge and list total colorings of planar graphs without short cycles. (English) Zbl 1189.05061 Inf. Process. Lett. 108, No. 6, 347-351 (2008). MSC: 05C15 68R10 05C38 PDF BibTeX XML Cite \textit{B. Liu} et al., Inf. Process. Lett. 108, No. 6, 347--351 (2008; Zbl 1189.05061) Full Text: DOI
Shen, Yufa; Zheng, Guoping; He, Wenjie; Zhao, Yongqiang Structural properties and edge choosability of planar graphs without 4-cycles. (English) Zbl 1194.05043 Discrete Math. 308, No. 23, 5789-5794 (2008). MSC: 05C15 05C75 05C10 PDF BibTeX XML Cite \textit{Y. Shen} et al., Discrete Math. 308, No. 23, 5789--5794 (2008; Zbl 1194.05043) 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 PDF BibTeX XML Cite \textit{J. Wu} and \textit{P. Wang}, Discrete Math. 308, No. 24, 6210--6215 (2008; Zbl 1189.05067) Full Text: DOI
Chen, Dong; Wang, Weifan \((2,1)\)-total labelling of outerplanar graphs. (English) Zbl 1129.05041 Discrete Appl. Math. 155, No. 18, 2585-2593 (2007). Reviewer: Martin Knor (Bratislava) MSC: 05C78 PDF BibTeX XML Cite \textit{D. Chen} and \textit{W. Wang}, Discrete Appl. Math. 155, No. 18, 2585--2593 (2007; Zbl 1129.05041) Full Text: DOI