Guo, Yirong; Zhang, Xia; Zhang, Xinmiao Strong edge-colorings of planar graphs with small girth. (English) Zbl 07332973 Appl. Math. Comput. 394, Article ID 125796, 8 p. (2021). MSC: 05C PDF BibTeX XML Cite \textit{Y. Guo} et al., Appl. Math. Comput. 394, Article ID 125796, 8 p. (2021; Zbl 07332973) Full Text: DOI
Bujtás, Csilla Domination number of graphs with minimum degree five. (English) Zbl 07319578 Discuss. Math., Graph Theory 41, No. 3, 763-777 (2021). MSC: 05C69 PDF BibTeX XML Cite \textit{C. Bujtás}, Discuss. Math., Graph Theory 41, No. 3, 763--777 (2021; Zbl 07319578) Full Text: DOI
Sun, Lin; Yu, Guanglong; Li, Xin Neighbor sum distinguishing total choosability of 1-planar graphs with maximum degree at least 24. (English) Zbl 1455.05018 Discrete Math. 344, No. 1, Article ID 112190, 10 p. (2021). MSC: 05C10 05C15 05C07 05C35 PDF BibTeX XML Cite \textit{L. Sun} et al., Discrete Math. 344, No. 1, Article ID 112190, 10 p. (2021; Zbl 1455.05018) Full Text: DOI
Ziemann, Radosław; Żyliński, Paweł Vertex-edge domination in cubic graphs. (English) Zbl 1447.05164 Discrete Math. 343, No. 11, Article ID 112075, 14 p. (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C69 90C05 68Q17 PDF BibTeX XML Cite \textit{R. Ziemann} and \textit{P. Żyliński}, Discrete Math. 343, No. 11, Article ID 112075, 14 p. (2020; Zbl 1447.05164) Full Text: DOI
Choi, Ilkyoo; Dross, François; Ochem, Pascal Partitioning sparse graphs into an independent set and a graph with bounded size components. (English) Zbl 1441.05179 Discrete Math. 343, No. 8, Article ID 111921, 16 p. (2020). MSC: 05C70 05C42 05C69 05C10 PDF BibTeX XML Cite \textit{I. Choi} et al., Discrete Math. 343, No. 8, Article ID 111921, 16 p. (2020; Zbl 1441.05179) Full Text: DOI
Song, Chao; Jin, Xue; Xu, Chang-Qing Neighbor sum distinguishing total coloring of IC-planar graphs with short cycle restrictions. (English) Zbl 1439.05095 Discrete Appl. Math. 279, 202-209 (2020). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{C. Song} et al., Discrete Appl. Math. 279, 202--209 (2020; Zbl 1439.05095) Full Text: DOI
Sun, Lin Neighbor sum distinguishing total choosability of planar graphs without adjacent special 5-cycles. (English) Zbl 07201686 Discrete Appl. Math. 279, 146-153 (2020). MSC: 05 PDF BibTeX XML Cite \textit{L. Sun}, Discrete Appl. Math. 279, 146--153 (2020; Zbl 07201686) Full Text: DOI
Brandt, Axel; Jahanbekam, Sogol; White, Jennifer Additive list coloring of planar graphs with given girth. (English) Zbl 1439.05198 Discuss. Math., Graph Theory 40, No. 3, 855-873 (2020). MSC: 05C78 05C15 05C22 05C10 PDF BibTeX XML Cite \textit{A. Brandt} et al., Discuss. Math., Graph Theory 40, No. 3, 855--873 (2020; Zbl 1439.05198) Full Text: DOI
Liu, Jie; Lv, Jian-Bo Every planar graph without 4-cycles and 5-cycles is \((2, 6)\)-colorable. (English) Zbl 1437.05077 Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2493-2507 (2020). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{J. Liu} and \textit{J.-B. Lv}, Bull. Malays. Math. Sci. Soc. (2) 43, No. 3, 2493--2507 (2020; Zbl 1437.05077) Full Text: DOI
Brandt, Axel; Tenpas, Nathan; Yerger, Carl R. Planar graphs with girth 20 are additively 3-choosable. (English) Zbl 1435.05059 Discrete Appl. Math. 277, 14-21 (2020). MSC: 05C10 05C15 05C78 PDF BibTeX XML Cite \textit{A. Brandt} et al., Discrete Appl. Math. 277, 14--21 (2020; Zbl 1435.05059) Full Text: DOI
Hocquard, Herve; Przybyło, Jakub On the total neighbour sum distinguishing index of graphs with bounded maximum average degree. (English) Zbl 1434.05053 J. Comb. Optim. 39, No. 2, 412-424 (2020). MSC: 05C15 05C78 PDF BibTeX XML Cite \textit{H. Hocquard} and \textit{J. Przybyło}, J. Comb. Optim. 39, No. 2, 412--424 (2020; Zbl 1434.05053) Full Text: DOI
Song, Chao; Xu, Changqing Neighbor sum distinguishing total colorings of IC-planar graphs with maximum degree 13. (English) Zbl 1434.05057 J. Comb. Optim. 39, No. 1, 293-303 (2020). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{C. Song} and \textit{C. Xu}, J. Comb. Optim. 39, No. 1, 293--303 (2020; Zbl 1434.05057) Full Text: DOI
Zhao, Xue; Xu, Chang-Qing Neighbor sum distinguishing total chromatic number of planar graphs without 5-cycles. (English) Zbl 1430.05044 Discuss. Math., Graph Theory 40, No. 1, 243-253 (2020). MSC: 05C15 PDF BibTeX XML Cite \textit{X. Zhao} and \textit{C.-Q. Xu}, Discuss. Math., Graph Theory 40, No. 1, 243--253 (2020; Zbl 1430.05044) Full Text: DOI
Liu, Jingzhao Application of discharging method in graph colorings theory. (Chinese. English summary) Zbl 1449.05106 J. Qufu Norm. Univ., Nat. Sci. 45, No. 4, 29-32 (2019). MSC: 05C15 PDF BibTeX XML Cite \textit{J. Liu}, J. Qufu Norm. Univ., Nat. Sci. 45, No. 4, 29--32 (2019; Zbl 1449.05106) Full Text: DOI
Luo, Zhaoyang; Sun, Lin The linear arboricity of planar graphs with 6-cycles containing at most one chord. (Chinese. English summary) Zbl 1449.05109 Oper. Res. Trans. 23, No. 2, 113-119 (2019). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{Z. Luo} and \textit{L. Sun}, Oper. Res. Trans. 23, No. 2, 113--119 (2019; Zbl 1449.05109) Full Text: DOI
Chu, Yanan; Sun, Lei; Yue, Jun Note on improper coloring of \(1\)-planar graphs. (English) Zbl 07144867 Czech. Math. J. 69, No. 4, 955-968 (2019). MSC: 05C15 PDF BibTeX XML Cite \textit{Y. Chu} et al., Czech. Math. J. 69, No. 4, 955--968 (2019; Zbl 07144867) Full Text: DOI
Hocquard, Hervé; Kim, Seog-Jin; Pierron, Théo Coloring squares of graphs with mad constraints. (English) Zbl 1428.05108 Discrete Appl. Math. 271, 64-73 (2019). MSC: 05C15 05C07 PDF BibTeX XML Cite \textit{H. Hocquard} et al., Discrete Appl. Math. 271, 64--73 (2019; Zbl 1428.05108) Full Text: DOI arXiv
Choi, Ilkyoo; Yu, Gexin; Zhang, Xia Planar graphs with girth at least 5 are \((3, 4)\)-colorable. (English) Zbl 1422.05035 Discrete Math. 342, No. 12, Article ID 111577, 12 p. (2019). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{I. Choi} et al., Discrete Math. 342, No. 12, Article ID 111577, 12 p. (2019; Zbl 1422.05035) Full Text: DOI arXiv
Fulek, Radoslav; Pach, János Thrackles: an improved upper bound. (English) Zbl 1407.05162 Discrete Appl. Math. 259, 226-231 (2019). MSC: 05C60 05C62 PDF BibTeX XML Cite \textit{R. Fulek} and \textit{J. Pach}, Discrete Appl. Math. 259, 226--231 (2019; Zbl 1407.05162) 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
Sun, Lin; Wu, Jianliang On edge colorings of 1-planar graphs without 5-cycles with two chords. (English) Zbl 1409.05091 Discuss. Math., Graph Theory 39, No. 2, 301-312 (2019). Reviewer: Serge Lawrencenko (Moskva) MSC: 05C15 05C35 05C76 05C10 PDF BibTeX XML Cite \textit{L. Sun} and \textit{J. Wu}, Discuss. Math., Graph Theory 39, No. 2, 301--312 (2019; Zbl 1409.05091) Full Text: DOI
Dantas, Rennan; Havet, Frédéric; Sampaio, Rudini M. Minimum density of identifying codes of king grids. (English) Zbl 1393.05253 Discrete Math. 341, No. 10, 2708-2719 (2018). MSC: 05C99 05C76 94B99 05B40 PDF BibTeX XML Cite \textit{R. Dantas} et al., Discrete Math. 341, No. 10, 2708--2719 (2018; Zbl 1393.05253) Full Text: DOI
Ma, Hongping; Hu, Xiaoxue; Kong, Jiangxu; Xu, Murong Linear list \(r\)-hued coloring of sparse graphs. (English) Zbl 1393.05121 Discrete Math. Algorithms Appl. 10, No. 4, Article ID 1850045, 12 p. (2018). MSC: 05C15 05C35 PDF BibTeX XML Cite \textit{H. Ma} et al., Discrete Math. Algorithms Appl. 10, No. 4, Article ID 1850045, 12 p. (2018; Zbl 1393.05121) Full Text: DOI
Wang, Ying; Shiu, Wai Chee; Wang, Weifan; Chen, Min Planar graphs with maximum degree 4 are strongly 19-edge-colorable. (English) Zbl 1384.05074 Discrete Math. 341, No. 6, 1629-1635 (2018). MSC: 05C10 05C07 05C35 05C12 PDF BibTeX XML Cite \textit{Y. Wang} et al., Discrete Math. 341, No. 6, 1629--1635 (2018; Zbl 1384.05074) Full Text: DOI
Cheng, Jian; Lai, Hong-Jian; Lorenzen, Kate J.; Luo, Rong; Thompson, Joshua C.; Zhang, Cun-Quan \(r\)-hued coloring of sparse graphs. (English) Zbl 1380.05056 Discrete Appl. Math. 237, 75-81 (2018). MSC: 05C15 05C42 05C35 05C07 PDF BibTeX XML Cite \textit{J. Cheng} et al., Discrete Appl. Math. 237, 75--81 (2018; Zbl 1380.05056) Full Text: DOI
Dantas, Rennan; Sampaio, Rudini M.; Havet, Frédéric Minimum density of identifying codes of king grids. (English) Zbl 1383.05184 Bassino, Frédérique (ed.) et al., LAGOS 2017. Selected papers of the 9th Latin-American algorithms, graphs, and optimization symposium, Marseille, France, September 11–15, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 62, 51-56 (2017). MSC: 05C42 05C76 PDF BibTeX XML Cite \textit{R. Dantas} et al., Electron. Notes Discrete Math. 62, 51--56 (2017; Zbl 1383.05184) Full Text: DOI
Sun, Derong; Sun, Lin A note on the adjacent vertex distinguishing total coloring of special planar graphs. (English) Zbl 1386.05069 J. Comb. Math. Comb. Comput. 103, 15-25 (2017). Reviewer: Andrea Semanicova-Fenovcikova (Košice) MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{D. Sun} and \textit{L. Sun}, J. Comb. Math. Comb. Comput. 103, 15--25 (2017; Zbl 1386.05069)
Hocquard, H.; Przybyło, J. On the neighbour sum distinguishing index of graphs with bounded maximum average degree. (English) Zbl 1380.05064 Graphs Comb. 33, No. 6, 1459-1471 (2017). MSC: 05C15 05C78 05C35 PDF BibTeX XML Cite \textit{H. Hocquard} and \textit{J. Przybyło}, Graphs Comb. 33, No. 6, 1459--1471 (2017; Zbl 1380.05064) Full Text: DOI
Song, Wen-Yao; Miao, Lian-Ying Strong edge-coloring of planar graphs. (English) Zbl 1372.05083 Discuss. Math., Graph Theory 37, No. 4, 845-857 (2017). MSC: 05C15 PDF BibTeX XML Cite \textit{W.-Y. Song} and \textit{L.-Y. Miao}, Discuss. Math., Graph Theory 37, No. 4, 845--857 (2017; Zbl 1372.05083) Full Text: DOI
Sun, Lin; Wu, Jian-liang; Cai, Hua On total colorings of some special 1-planar graphs. (English) Zbl 1390.05072 Acta Math. Appl. Sin., Engl. Ser. 33, No. 3, 607-618 (2017). Reviewer: S. K. Nimbhorkar (Aurangabad) MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun} et al., Acta Math. Appl. Sin., Engl. Ser. 33, No. 3, 607--618 (2017; Zbl 1390.05072) Full Text: DOI
Oh, Byung-Geun On the number of vertices of positively curved planar graphs. (English) Zbl 1369.05051 Discrete Math. 340, No. 6, 1300-1310 (2017). MSC: 05C10 PDF BibTeX XML Cite \textit{B.-G. Oh}, Discrete Math. 340, No. 6, 1300--1310 (2017; Zbl 1369.05051) Full Text: DOI
Bonamy, M.; Przybyło, J. On the neighbor sum distinguishing index of planar graphs. (English) Zbl 1367.05066 J. Graph Theory 85, No. 3, 669-690 (2017). MSC: 05C15 05C10 05C07 PDF BibTeX XML Cite \textit{M. Bonamy} and \textit{J. Przybyło}, J. Graph Theory 85, No. 3, 669--690 (2017; Zbl 1367.05066) Full Text: DOI
Ochem, Pascal; Pinlou, Alexandre; Sen, Sagnik Homomorphisms of 2-edge-colored triangle-free planar graphs. (English) Zbl 1365.05097 J. Graph Theory 85, No. 1, 258-277 (2017). MSC: 05C15 05C10 05C60 PDF BibTeX XML Cite \textit{P. Ochem} et al., J. Graph Theory 85, No. 1, 258--277 (2017; Zbl 1365.05097) Full Text: DOI
Zhang, Miao; Chen, Min; Wang, Yiqiao A sufficient condition for planar graphs with girth 5 to be \((1,7)\)-colorable. (English) Zbl 1367.05054 J. Comb. Optim. 33, No. 3, 847-865 (2017). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{M. Zhang} et al., J. Comb. Optim. 33, No. 3, 847--865 (2017; Zbl 1367.05054) Full Text: DOI
Przybyło, Jakub; Raspaud, André; Woźniak, Mariusz On weight choosabilities of graphs with bounded maximum average degree. (English) Zbl 1358.05165 Discrete Appl. Math. 217, Part 3, 663-672 (2017). MSC: 05C40 05C15 PDF BibTeX XML Cite \textit{J. Przybyło} et al., Discrete Appl. Math. 217, Part 3, 663--672 (2017; Zbl 1358.05165) Full Text: DOI
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
Sun, Lin; Cheng, Xiaohan; Wu, Jianliang The adjacent vertex distinguishing total coloring of planar graphs without adjacent 4-cycles. (English) Zbl 1359.05046 J. Comb. Optim. 33, No. 2, 779-790 (2017). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{L. Sun} et al., J. Comb. Optim. 33, No. 2, 779--790 (2017; Zbl 1359.05046) 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
Wang, Yan; Xie, Qiqin; Yu, Xingxing Induced forests in bipartite planar graphs. (English) Zbl 1352.05053 J. Comb. 8, No. 1, 93-166 (2017). MSC: 05C05 05C10 05C30 PDF BibTeX XML Cite \textit{Y. Wang} et al., J. Comb. 8, No. 1, 93--166 (2017; Zbl 1352.05053) Full Text: DOI arXiv
Chen, Min; Kim, Seog-Jin; Kostochka, Alexandr V.; West, Douglas B.; Zhu, Xuding Decomposition of sparse graphs into forests: the nine dragon tree conjecture for \(k \leq 2\). (English) Zbl 1350.05084 J. Comb. Theory, Ser. B 122, 741-756 (2017). MSC: 05C42 05C70 PDF BibTeX XML Cite \textit{M. Chen} et al., J. Comb. Theory, Ser. B 122, 741--756 (2017; Zbl 1350.05084) Full Text: DOI
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
Gorla, Sreekanth; Nasre, Meghana List coloring of planar graphs with forbidden cycles. (English) Zbl 1356.05050 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 117-121 (2016). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{S. Gorla} and \textit{M. Nasre}, Electron. Notes Discrete Math. 55, 117--121 (2016; Zbl 1356.05050) Full Text: DOI
Bouznif, Marwane; Havet, Frédéric; Preissmann, Myriam Minimum-density identifying codes in square grids. (English) Zbl 06649748 Dondi, Riccardo (ed.) et al., Algorithmic aspects in information and management. 11th international conference, AAIM 2016, Bergamo, Italy, July 18–20, 2016. Proceedings. Cham: Springer (ISBN 978-3-319-41167-5/pbk; 978-3-319-41168-2/ebook). Lecture Notes in Computer Science 9778, 77-88 (2016). MSC: 68Wxx 90Bxx PDF BibTeX XML Cite \textit{M. Bouznif} et al., Lect. Notes Comput. Sci. 9778, 77--88 (2016; Zbl 06649748) Full Text: DOI
Gong, Xiangnan; Xu, Changqing; Song, Hongjie; Pan, Wenhua Neighbor sum distinguishing total coloring of a kind of sparse graph. (English) Zbl 1413.05111 Ars Comb. 127, 133-141 (2016). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{X. Gong} et al., Ars Comb. 127, 133--141 (2016; Zbl 1413.05111)
Sun, Lin; Sun, Derong Edge colourings of embedded 1-graphs. (Chinese. English summary) Zbl 1363.05080 Acta Math. Appl. Sin. 39, No. 1, 12-20 (2016). MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun} and \textit{D. Sun}, Acta Math. Appl. Sin. 39, No. 1, 12--20 (2016; Zbl 1363.05080)
Carraher, James M.; Galvin, David; Hartke, Stephen G.; Radcliffe, A. J.; Stolee, Derrick On the independence ratio of distance graphs. (English) Zbl 1343.05055 Discrete Math. 339, No. 12, 3058-3072 (2016). MSC: 05C12 05C15 05C69 PDF BibTeX XML Cite \textit{J. M. Carraher} et al., Discrete Math. 339, No. 12, 3058--3072 (2016; Zbl 1343.05055) 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 PDF BibTeX XML Cite \textit{J. Cheng} et al., Discrete Math. 339, No. 10, 2393--2398 (2016; Zbl 1339.05123) Full Text: DOI
Sun, Lin; Cai, Hua On \((p,1)\)-total labelling of special 1-planar graphs. (English) Zbl 1363.05230 Ars Comb. 123, 87-96 (2015). MSC: 05C78 05C10 PDF BibTeX XML Cite \textit{L. Sun} and \textit{H. Cai}, Ars Comb. 123, 87--96 (2015; Zbl 1363.05230)
Bensmail, Julien; Bonamy, Marthe; Hocquard, Hervé Strong edge coloring sparse graphs. (English) Zbl 1346.05058 Nešetril, Jaroslav (ed.) et al., Extended abstracts of the eight European conference on combinatorics, graph theory and applications, EuroComb 2015, Bergen, Norway, August 31 – September 4, 2015. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 49, 773-778, electronic only (2015). MSC: 05C15 05C42 PDF BibTeX XML Cite \textit{J. Bensmail} et al., Electron. Notes Discrete Math. 49, 773--778 (2015; Zbl 1346.05058) Full Text: DOI
Sun, Lin Edge colourings of embedded special graphs. (Chinese. English summary) Zbl 1349.05127 Math. Pract. Theory 45, No. 3, 195-201 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun}, Math. Pract. Theory 45, No. 3, 195--201 (2015; Zbl 1349.05127)
Bu, Yuehua; Lu, Xia The choosability of the 2-distance coloring of a graph. (Chinese. English summary) Zbl 1349.05101 J. Zhejiang Norm. Univ., Nat. Sci. 38, No. 3, 279-285 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{Y. Bu} and \textit{X. Lu}, J. Zhejiang Norm. Univ., Nat. Sci. 38, No. 3, 279--285 (2015; Zbl 1349.05101) Full Text: DOI
Tian, Jingjing; Nie, Yufeng Light 3-cycles in IC-planar graphs with degree restrictions. (Chinese. English summary) Zbl 1349.05079 J. Shaanxi Norm. Univ., Nat. Sci. Ed. 43, No. 5, 1-3 (2015). MSC: 05C10 05C38 05C07 05C35 PDF BibTeX XML Cite \textit{J. Tian} and \textit{Y. Nie}, J. Shaanxi Norm. Univ., Nat. Sci. Ed. 43, No. 5, 1--3 (2015; Zbl 1349.05079) Full Text: DOI
Sun, Lin; Wu, Jian-Liang; Cai, Hua; Luo, Zhaoyang On edge colorings of 1-planar graphs with 6-cycles having at most three chords. (English) Zbl 1326.05050 Int. J. Appl. Math. Stat. 53, No. 1, 50-58 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun} et al., Int. J. Appl. Math. Stat. 53, No. 1, 50--58 (2015; Zbl 1326.05050) Full Text: Link
Sun, Lin; Luo, Zhaoyang Edge colorings of embedded special graphs. (Chinese. English summary) Zbl 1340.05082 Oper. Res. Trans. 19, No. 1, 125-130 (2015). MSC: 05C15 PDF BibTeX XML Cite \textit{L. Sun} and \textit{Z. Luo}, Oper. Res. Trans. 19, No. 1, 125--130 (2015; Zbl 1340.05082)
Zhang, Xin; Hou, Jianfeng; Liu, Guizhen On total colorings of 1-planar graphs. (English) Zbl 1317.05066 J. Comb. Optim. 30, No. 1, 160-173 (2015). MSC: 05C15 05C10 05C62 PDF BibTeX XML Cite \textit{X. Zhang} et al., J. Comb. Optim. 30, No. 1, 160--173 (2015; Zbl 1317.05066) Full Text: DOI arXiv
Choi, Ilkyoo; Raspaud, André Planar graphs with girth at least 5 are \((3, 5)\)-colorable. (English) Zbl 1305.05072 Discrete Math. 338, No. 4, 661-667 (2015). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{I. Choi} and \textit{A. Raspaud}, Discrete Math. 338, No. 4, 661--667 (2015; Zbl 1305.05072) Full Text: DOI
Cranston, Daniel W.; Jahanbekam, Sogol; West, Douglas B. The \(1,2,3\)-conjecture and \(1,2\)-conjecture for sparse graphs. (English) Zbl 1303.05172 Discuss. Math., Graph Theory 34, No. 4, 769-799 (2014). MSC: 05C78 05C15 05C42 05C22 05C75 PDF BibTeX XML Cite \textit{D. W. Cranston} et al., Discuss. Math., Graph Theory 34, No. 4, 769--799 (2014; Zbl 1303.05172) Full Text: DOI arXiv
Ackerman, Eyal; Nitzan, Noa; Pinchasi, Rom The maximum number of edges in geometric graphs with pairwise virtually avoiding edges. (English) Zbl 1298.05082 Graphs Comb. 30, No. 5, 1065-1072 (2014). MSC: 05C10 PDF BibTeX XML Cite \textit{E. Ackerman} et al., Graphs Comb. 30, No. 5, 1065--1072 (2014; Zbl 1298.05082) Full Text: DOI
Hu, Xiaoxue; Wang, Yiqiao Plane graphs are entirely \((\Delta + 5)\)-choosable. (English) Zbl 1301.05125 Discrete Math. Algorithms Appl. 6, No. 2, Article ID 1450023, 9 p. (2014). Reviewer: Marcin Anholcer (Poznan) MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{X. Hu} and \textit{Y. Wang}, Discrete Math. Algorithms Appl. 6, No. 2, Article ID 1450023, 9 p. (2014; Zbl 1301.05125) Full Text: DOI
Hudák, Dávid; Lužar, Borut; Soták, Roman; Škrekovski, Riste Strong edge-coloring of planar graphs. (English) Zbl 1284.05101 Discrete Math. 324, 41-49 (2014). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{D. Hudák} et al., Discrete Math. 324, 41--49 (2014; Zbl 1284.05101) Full Text: DOI arXiv
Foucaud, Florent; Laihonen, Tero; Parreau, Aline An improved lower bound for \((1,\leq 2)\)-identifying codes in the king grid. (English) Zbl 1283.05201 Adv. Math. Commun. 8, No. 1, 35-52 (2014). MSC: 05C69 68P30 94B60 PDF BibTeX XML Cite \textit{F. Foucaud} et al., Adv. Math. Commun. 8, No. 1, 35--52 (2014; Zbl 1283.05201) Full Text: DOI arXiv
Cukierman, Ari; Yu, Gexin New bounds on the minimum density of an identifying code for the infinite hexagonal grid. (English) Zbl 1287.05065 Discrete Appl. Math. 161, No. 18, 2910-2924 (2013). MSC: 05C35 94B65 68R10 PDF BibTeX XML Cite \textit{A. Cukierman} and \textit{G. Yu}, Discrete Appl. Math. 161, No. 18, 2910--2924 (2013; Zbl 1287.05065) Full Text: DOI arXiv
Wang, Yingqian; Mao, Xianghua; Miao, Zhengke Plane graphs with maximum degree \(\Delta \geq 8\) are entirely (\(\Delta +3\))-colorable. (English) Zbl 1269.05042 J. Graph Theory 73, No. 3-4, 305-317 (2013). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{Y. Wang} et al., J. Graph Theory 73, No. 3--4, 305--317 (2013; Zbl 1269.05042) Full Text: DOI
Zhang, Xin; Liu, Guizhen On edge colorings of 1-planar graphs without chordal 5-cycles. (English) Zbl 1274.05186 Ars Comb. 104, 431-436 (2012). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{X. Zhang} and \textit{G. Liu}, Ars Comb. 104, 431--436 (2012; Zbl 1274.05186)
Li, Rui; Xu, Baogang Edge choosablity and total choosability of toroidal graphs without intersecting triangles. (English) Zbl 1265.05235 Ars Comb. 103, 109-118 (2012). MSC: 05C15 05C35 PDF BibTeX XML Cite \textit{R. Li} and \textit{B. Xu}, Ars Comb. 103, 109--118 (2012; Zbl 1265.05235)
Balogh, József; Pluhár, András The positive minimum degree game on sparse graphs. (English) Zbl 1243.05163 Electron. J. Comb. 19, No. 1, Research Paper P22, 7 p. (2012). MSC: 05C57 05C35 05C65 91A43 91A46 PDF BibTeX XML Cite \textit{J. Balogh} and \textit{A. Pluhár}, Electron. J. Comb. 19, No. 1, Research Paper P22, 7 p. (2012; Zbl 1243.05163) Full Text: EMIS
Hudák, Dávid; Kardoš, František; Lužar, Borut; Soták, Roman; Škrekovski, Riste Acyclic edge coloring of planar graphs with \(\varDelta\) colors. (English) Zbl 1239.05068 Discrete Appl. Math. 160, No. 9, 1356-1368 (2012). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{D. Hudák} et al., Discrete Appl. Math. 160, No. 9, 1356--1368 (2012; Zbl 1239.05068) Full Text: DOI
Cohen, Nathann; Havet, Frédéric Linear and 2-frugal choosability of graphs of small maximum average degree. (English) Zbl 1234.05083 Graphs Comb. 27, No. 6, 831-849 (2011). MSC: 05C15 05C35 05C10 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{F. Havet}, Graphs Comb. 27, No. 6, 831--849 (2011; Zbl 1234.05083) Full Text: DOI
Cranston, Daniel W.; Yu, Gexin Linear choosability of sparse graphs. (English) Zbl 1225.05095 Discrete Math. 311, No. 17, 1910-1917 (2011). MSC: 05C15 PDF BibTeX XML Cite \textit{D. W. Cranston} and \textit{G. Yu}, Discrete Math. 311, No. 17, 1910--1917 (2011; Zbl 1225.05095) Full Text: DOI arXiv
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
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 PDF BibTeX XML Cite \textit{J. Czap} et al., Discrete Math. 311, No. 6, 512--520 (2011; Zbl 1222.05051) Full Text: DOI
Cai, Leizhen; Wang, Weifan; Zhu, Xuding Choosability of toroidal graphs without short cycles. (English) Zbl 1205.05083 J. Graph Theory 65, No. 1, 1-15 (2010). MSC: 05C15 05C10 05C38 PDF BibTeX XML Cite \textit{L. Cai} et al., J. Graph Theory 65, No. 1, 1--15 (2010; Zbl 1205.05083) Full Text: DOI
Hou, Jianfeng; Liu, Guizhen; Wu, Jianliang On 3-degeneracy of some \(C_7\)-free plane graphs with application to choosability. (English) Zbl 1224.05114 Ars Comb. 91, 289-296 (2009). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{J. Hou} et al., Ars Comb. 91, 289--296 (2009; Zbl 1224.05114)
Lužar, Borut; Škrekovski, Riste; Tancer, Martin Injective colorings of planar graphs with few colors. (English) Zbl 1209.05093 Discrete Math. 309, No. 18, 5636-5649 (2009). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{B. Lužar} et al., Discrete Math. 309, No. 18, 5636--5649 (2009; Zbl 1209.05093) Full Text: DOI
Ackerman, Eyal On the maximum number of edges in topological graphs with no four pairwise crossing edges. (English) Zbl 1161.05313 Discrete Comput. Geom. 41, No. 3, 365-375 (2009). MSC: 05C10 05C35 PDF BibTeX XML Cite \textit{E. Ackerman}, Discrete Comput. Geom. 41, No. 3, 365--375 (2009; Zbl 1161.05313) Full Text: DOI
Kowalik, Ukasz; Sereni, Jean-Sébastien; Škrekovski, Riste Total-coloring of plane graphs with maximum degree nine. (English) Zbl 1184.05046 SIAM J. Discrete Math. 22, No. 4, 1462-1479 (2008). MSC: 05C15 PDF BibTeX XML Cite \textit{U. Kowalik} et al., SIAM J. Discrete Math. 22, No. 4, 1462--1479 (2008; Zbl 1184.05046) Full Text: DOI
Havet, Frédéric; Sereni, Jean-Sébastien; Škrekovski, Riste 3-facial coloring of plane graphs. (English) Zbl 1171.05019 SIAM J. Discrete Math. 22, No. 1, 231-247 (2008). Reviewer: Ko-Wei Lih (Nankang) MSC: 05C15 PDF BibTeX XML Cite \textit{F. Havet} et al., SIAM J. Discrete Math. 22, No. 1, 231--247 (2008; Zbl 1171.05019) Full Text: DOI
Radoičić, Radoš; Tóth, Géza The discharging method in combinatorial geometry and the Pach-Sharir conjecture. (English) Zbl 1152.05025 Goodman, Jacob E. (ed.) et al., Surveys on discrete and computational geometry. Twenty years later. AMS-IMS-SIAM summer research conference, Snowbird, UT, USA, June 18–22, 2006. Providence, RI: American Mathematical Society (AMS) (ISBN 978-0-8218-4239-3/pbk). Contemporary Mathematics 453, 319-342 (2008). Reviewer: Arthur T. White (Kalamazoo) MSC: 05C10 05C15 05C35 05D10 05C55 PDF BibTeX XML Cite \textit{R. Radoičić} and \textit{G. Tóth}, Contemp. Math. 453, 319--342 (2008; Zbl 1152.05025)
Belotserkovsky, D. The smallest number of edges in a 2-connected graph with specified diameter. (English) Zbl 1123.05033 Discrete Math. 307, No. 19-20, 2376-2384 (2007). MSC: 05C12 PDF BibTeX XML Cite \textit{D. Belotserkovsky}, Discrete Math. 307, No. 19--20, 2376--2384 (2007; Zbl 1123.05033) Full Text: DOI
Ackerman, Eyal; Tardos, Gábor On the maximum number of edges in quasi-planar graphs. (English) Zbl 1120.05045 J. Comb. Theory, Ser. A 114, No. 3, 563-571 (2007). Reviewer: Adrian Riskin (Staunton) MSC: 05C35 05C10 PDF BibTeX XML Cite \textit{E. Ackerman} and \textit{G. Tardos}, J. Comb. Theory, Ser. A 114, No. 3, 563--571 (2007; Zbl 1120.05045) Full Text: DOI
Gonçalves, Daniel; Ochem, Pascal On some arboricities in planar graphs. (English) Zbl 1200.05054 Raspaud, André (ed.) et al., 7th international colloquium on graph theory, Hyeres, France, September 12–16, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 22, 427-432 (2005). MSC: 05C05 05C10 PDF BibTeX XML Cite \textit{D. Gonçalves} and \textit{P. Ochem}, Electron. Notes Discrete Math. 22, 427--432 (2005; Zbl 1200.05054) Full Text: DOI
Sanders, Daniel P.; Zhao, Yue On spanning trees and walks of low maximum degree. (English) Zbl 0973.05023 J. Graph Theory 36, No. 2, 67-74 (2001). Reviewer: Ismail Naci Cangül (Bursa) MSC: 05C05 05C35 PDF BibTeX XML Cite \textit{D. P. Sanders} and \textit{Y. Zhao}, J. Graph Theory 36, No. 2, 67--74 (2001; Zbl 0973.05023) Full Text: DOI
Wiȩckowski, Zdzisław; Youn, Sung-Kie; Yeon, Jeoung-Heum A particle-in-cell solution to the silo discharging problem. (English) Zbl 0945.74075 Int. J. Numer. Methods Eng. 45, No. 9, 1203-1225 (1999). MSC: 74S05 74S30 74E20 PDF BibTeX XML Cite \textit{Z. Wiȩckowski} et al., Int. J. Numer. Methods Eng. 45, No. 9, 1203--1225 (1999; Zbl 0945.74075) Full Text: DOI
Hind, Hugh; Zhao, Yue Edge colorings of graphs embeddable in a surface of low genus. (English) Zbl 0956.05043 Discrete Math. 190, No. 1-3, 107-114 (1998). MSC: 05C15 05C10 PDF BibTeX XML Cite \textit{H. Hind} and \textit{Y. Zhao}, Discrete Math. 190, No. 1--3, 107--114 (1998; Zbl 0956.05043) Full Text: DOI
Li, C. W.; Lee, J. H. W. Continuous source in tidal flow: A numerical study of the transport equation. (English) Zbl 0582.76013 Appl. Math. Modelling 9, 281-288 (1985). MSC: 76B15 86A05 PDF BibTeX XML Cite \textit{C. W. Li} and \textit{J. H. W. Lee}, Appl. Math. Modelling 9, 281--288 (1985; Zbl 0582.76013) Full Text: DOI