var bibbase_data = {"data":"\"Loading..\"\n\n
\n\n \n\n \n\n \n \n\n \n\n \n \n\n \n\n \n
\n generated by\n \n \"bibbase.org\"\n\n \n
\n \n\n
\n\n \n\n\n
\n\n Excellent! Next you can\n create a new website with this list, or\n embed it in an existing web page by copying & pasting\n any of the following snippets.\n\n
\n JavaScript\n (easiest)\n
\n \n <script src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FCeqDyAcnJn2TfjmmF&jsonp=1&noBootstrap=1&jsonp=1\"></script>\n \n
\n\n PHP\n
\n \n <?php\n $contents = file_get_contents(\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FCeqDyAcnJn2TfjmmF&jsonp=1&noBootstrap=1\");\n print_r($contents);\n ?>\n \n
\n\n iFrame\n (not recommended)\n
\n \n <iframe src=\"https://bibbase.org/show?bib=https%3A%2F%2Fbibbase.org%2Fnetwork%2Ffiles%2FCeqDyAcnJn2TfjmmF&jsonp=1&noBootstrap=1\"></iframe>\n \n
\n\n

\n For more details see the documention.\n

\n
\n
\n\n
\n\n This is a preview! To use this list on your own web site\n or create a new web site from it,\n create a free account. The file will be added\n and you will be able to edit it in the File Manager.\n We will show you instructions once you've created your account.\n
\n\n
\n\n

To the site owner:

\n\n

Action required! Mendeley is changing its\n API. In order to keep using Mendeley with BibBase past April\n 14th, you need to:\n

    \n
  1. renew the authorization for BibBase on Mendeley, and
  2. \n
  3. update the BibBase URL\n in your page the same way you did when you initially set up\n this page.\n
  4. \n
\n

\n\n

\n \n \n Fix it now\n

\n
\n\n
\n\n\n
\n \n \n
\n
\n  \n 2025\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Refining a chain theorem from matroids to internally 4-connected graphs.\n \n \n \n \n\n\n \n Lewchalermvongs, C.; and Ding, G.\n\n\n \n\n\n\n Advances in Applied Mathematics, 163. 2025.\n Cited by: 0; All Open Access, Hybrid Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"RefiningPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Lewchalermvongs2025,\n\tauthor = {Lewchalermvongs, Chanun and Ding, Guoli},\n\ttitle = {Refining a chain theorem from matroids to internally 4-connected graphs},\n\tyear = {2025},\n\tjournal = {Advances in Applied Mathematics},\n\tvolume = {163},\n\tdoi = {10.1016/j.aam.2024.102802},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85208185194&doi=10.1016%2fj.aam.2024.102802&partnerID=40&md5=e2df50cac3be9a9b378dfff60224f065},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; All Open Access, Hybrid Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Maximizing vertex rescue: investigating the firefighter problem with edge subdivision.\n \n \n \n \n\n\n \n Weeranukunjit, C.; and Lewchalermvongs, C.\n\n\n \n\n\n\n AKCE International Journal of Graphs and Combinatorics, 22(1): 85 – 90. 2025.\n Cited by: 0; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"MaximizingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Weeranukunjit202585,\n\tauthor = {Weeranukunjit, Chutchawon and Lewchalermvongs, Chanun},\n\ttitle = {Maximizing vertex rescue: investigating the firefighter problem with edge subdivision},\n\tyear = {2025},\n\tjournal = {AKCE International Journal of Graphs and Combinatorics},\n\tvolume = {22},\n\tnumber = {1},\n\tpages = {85 – 90},\n\tdoi = {10.1080/09728600.2024.2418643},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-105001929744&doi=10.1080%2f09728600.2024.2418643&partnerID=40&md5=e3036ec101b217288a19698f0aa8839a},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; All Open Access, Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2024\n \n \n (2)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok.\n \n \n \n \n\n\n \n Lewchalermvongs, C.; Lewchalermvongs, P.; Chuesuphan, C.; Weeranukunjit, C.; Boonkangwan, C.; Chaikittiporn, M.; Srikirinth, P.; and Glinpatgij, T.\n\n\n \n\n\n\n Transportation Research Interdisciplinary Perspectives, 27. 2024.\n Cited by: 0; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"APaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Lewchalermvongs2024,\n\tauthor = {Lewchalermvongs, Chanun and Lewchalermvongs, Phakaporn and Chuesuphan, Chettaporn and Weeranukunjit, Chutchawon and Boonkangwan, Chanon and Chaikittiporn, Montika and Srikirinth, Patid and Glinpatgij, Tanaphoom},\n\ttitle = {A game-theoretic approach for route planning on traveling by public transportation in the PM2.5 pollution: A case study in Bangkok},\n\tyear = {2024},\n\tjournal = {Transportation Research Interdisciplinary Perspectives},\n\tvolume = {27},\n\tdoi = {10.1016/j.trip.2024.101185},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85200988502&doi=10.1016%2fj.trip.2024.101185&partnerID=40&md5=ee1e0f08227d9a65b0c5cfc57e53bc57},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; All Open Access, Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n
\n \n\n \n \n \n \n \n \n Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis.\n \n \n \n \n\n\n \n Kaewhit, P.; Lewchalermvongs, C.; and Lewchalermvongs, P.\n\n\n \n\n\n\n TEM Journal, 13(2): 885 – 896. 2024.\n Cited by: 0; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"EnhancingPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Kaewhit2024885,\n\tauthor = {Kaewhit, Panatda and Lewchalermvongs, Chanun and Lewchalermvongs, Phakaporn},\n\ttitle = {Enhancing Signed Graph Attention Network by Graph Characteristics: An Analysis},\n\tyear = {2024},\n\tjournal = {TEM Journal},\n\tvolume = {13},\n\tnumber = {2},\n\tpages = {885 – 896},\n\tdoi = {10.18421/TEM132-05},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85196088718&doi=10.18421%2fTEM132-05&partnerID=40&md5=e465cdb383edf7c97a1308dcb61a6c69},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 0; All Open Access, Gold Open Access}\n}
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2021\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Internally 4-Connected Graphs with No Cube, V8-Minor.\n \n \n \n \n\n\n \n Lewchalermvongs, C.; and Ananchuen, N.\n\n\n \n\n\n\n Discussiones Mathematicae - Graph Theory, 41(2): 481 – 501. 2021.\n Cited by: 4; All Open Access, Gold Open Access\n\n\n\n
\n\n\n\n \n \n \"InternallyPaper\n  \n \n\n \n \n doi\n  \n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Lewchalermvongs2021481,\n\tauthor = {Lewchalermvongs, Chanun and Ananchuen, Nawarat},\n\ttitle = {Internally 4-Connected Graphs with No {Cube, V8}-Minor},\n\tyear = {2021},\n\tjournal = {Discussiones Mathematicae - Graph Theory},\n\tvolume = {41},\n\tnumber = {2},\n\tpages = {481 – 501},\n\tdoi = {10.7151/dmgt.2205},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85100555636&doi=10.7151%2fdmgt.2205&partnerID=40&md5=d28ee31cdb5ada78fa61154c429e3aca},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 4; All Open Access, Gold Open Access}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2019\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Domination game played on a graph constructed from 1-sum of paths.\n \n \n \n \n\n\n \n Weeranukujit, C.; and Lewchalermvongs, C.\n\n\n \n\n\n\n Thai Journal of Mathematics, 17(SpecialIssue(2019)AnnalMeeting): 34 – 45. 2019.\n Cited by: 3\n\n\n\n
\n\n\n\n \n \n \"DominationPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Weeranukujit201934,\n\tauthor = {Weeranukujit, Chutchawon and Lewchalermvongs, Chanun},\n\ttitle = {Domination game played on a graph constructed from 1-sum of paths},\n\tyear = {2019},\n\tjournal = {Thai Journal of Mathematics},\n\tvolume = {17},\n\tnumber = {SpecialIssue(2019)AnnalMeeting},\n\tpages = {34 – 45},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071170066&partnerID=40&md5=e815a66623522154e42e12631fa9bd1a},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 3}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n
\n
\n  \n 2016\n \n \n (1)\n \n \n
\n
\n \n \n
\n \n\n \n \n \n \n \n \n Graphs with no P7-minor.\n \n \n \n \n\n\n \n Ding, G.; Lewchalermvongs, C.; and Maharry, J.\n\n\n \n\n\n\n Electronic Journal of Combinatorics, 23(2). 2016.\n Cited by: 9\n\n\n\n
\n\n\n\n \n \n \"GraphsPaper\n  \n \n\n \n\n \n link\n  \n \n\n bibtex\n \n\n \n\n \n\n \n \n \n \n \n \n \n\n  \n \n \n\n\n\n
\n
@ARTICLE{Ding2016,\n\tauthor = {Ding, Guoli and Lewchalermvongs, Chanun and Maharry, John},\n\ttitle = {Graphs with no P7-minor},\n\tyear = {2016},\n\tjournal = {Electronic Journal of Combinatorics},\n\tvolume = {23},\n\tnumber = {2},\n\turl = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84963864069&partnerID=40&md5=5f286ca046e564800c585bb1ac6d8136},\n\ttype = {Article},\n\tpublication_stage = {Final},\n\tsource = {Scopus},\n\tnote = {Cited by: 9}\n}\n\n
\n
\n\n\n\n
\n\n\n\n\n\n
\n
\n\n\n\n\n
\n\n\n \n\n \n \n \n \n\n
\n"}; document.write(bibbase_data.data);