Ahn, Jungho; Kim, Eun Jung; Lee, Euiwoong Towards constant-factor approximation for chordal/distance-hereditary vertex deletion. (English) Zbl 07549532 Algorithmica 84, No. 7, 2106-2133 (2022). MSC: 68W25 68R10 PDF BibTeX XML Cite \textit{J. Ahn} et al., Algorithmica 84, No. 7, 2106--2133 (2022; Zbl 07549532) Full Text: DOI OpenURL
Eschen, Elaine M.; Sritharan, R. Bipartite completion of colored graphs avoiding chordless cycles of given lengths. (English) Zbl 07545984 Discrete Appl. Math. 318, 97-112 (2022). MSC: 05C15 68Q17 68R10 PDF BibTeX XML Cite \textit{E. M. Eschen} and \textit{R. Sritharan}, Discrete Appl. Math. 318, 97--112 (2022; Zbl 07545984) Full Text: DOI OpenURL
Konrad, Christian; Zamaraev, Viktor Distributed minimum vertex coloring and maximum independent set in chordal graphs. (English) Zbl 07540225 Theor. Comput. Sci. 922, 486-502 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{C. Konrad} and \textit{V. Zamaraev}, Theor. Comput. Sci. 922, 486--502 (2022; Zbl 07540225) Full Text: DOI OpenURL
Choudhary, Pratibha Polynomial time algorithms for tracking path problems. (English) Zbl 07535645 Algorithmica 84, No. 6, 1548-1570 (2022). MSC: 68Wxx 05Cxx PDF BibTeX XML Cite \textit{P. Choudhary}, Algorithmica 84, No. 6, 1548--1570 (2022; Zbl 07535645) Full Text: DOI OpenURL
Rong, Guozhen; Yang, Yongjie; Li, Wenjun; Wang, Jianxin A divide-and-conquer approach for reconstruction of \(\{C_{ \geq 5}\}\)-free graphs via betweenness queries. (English) Zbl 07533874 Theor. Comput. Sci. 917, 1-11 (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{G. Rong} et al., Theor. Comput. Sci. 917, 1--11 (2022; Zbl 07533874) Full Text: DOI OpenURL
Brešar, Boštjan; Dravec, Tanja; Gorzkowska, Aleksandra; Kleszcz, Elżbieta Graphs with a unique maximum independent set up to automorphisms. (English) Zbl 07533128 Discrete Appl. Math. 317, 124-135 (2022). MSC: 05C69 05C35 05C05 05C76 PDF BibTeX XML Cite \textit{B. Brešar} et al., Discrete Appl. Math. 317, 124--135 (2022; Zbl 07533128) Full Text: DOI OpenURL
Bolognini, Davide; Macchia, Antonio; Strazzanti, Francesco Cohen-Macaulay binomial edge ideals and accessible graphs. (English) Zbl 07531120 J. Algebr. Comb. 55, No. 4, 1139-1170 (2022). MSC: 13H10 13C05 05C25 PDF BibTeX XML Cite \textit{D. Bolognini} et al., J. Algebr. Comb. 55, No. 4, 1139--1170 (2022; Zbl 07531120) Full Text: DOI OpenURL
Anil, Arun; Changat, Manoj Ptolemaic and chordal cover-incomparability graphs. (English) Zbl 07530799 Order 39, No. 1, 29-43 (2022). MSC: 06-XX PDF BibTeX XML Cite \textit{A. Anil} and \textit{M. Changat}, Order 39, No. 1, 29--43 (2022; Zbl 07530799) Full Text: DOI OpenURL
Şeker, Oylum; Heggernes, Pinar; Ekim, Tinaz; Taşkın, Z. Caner Generation of random chordal graphs using subtrees of a tree. (English) Zbl 07523408 RAIRO, Oper. Res. 56, No. 2, 565-582 (2022). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C80 05C05 05C17 PDF BibTeX XML Cite \textit{O. Şeker} et al., RAIRO, Oper. Res. 56, No. 2, 565--582 (2022; Zbl 07523408) Full Text: DOI OpenURL
Moscarini, Marina A necessary condition for the equality of the clique number and the convexity number of a graph. (English) Zbl 07510700 Discrete Appl. Math. 314, 191-196 (2022). MSC: 05C12 05C38 52A99 PDF BibTeX XML Cite \textit{M. Moscarini}, Discrete Appl. Math. 314, 191--196 (2022; Zbl 07510700) Full Text: DOI OpenURL
Ganian, Robert; Hamm, Thekla; Talvitie, Topi An efficient algorithm for counting Markov equivalent DAGs. (English) Zbl 07482901 Artif. Intell. 304, Article ID 103648, 13 p. (2022). MSC: 68Txx PDF BibTeX XML Cite \textit{R. Ganian} et al., Artif. Intell. 304, Article ID 103648, 13 p. (2022; Zbl 07482901) Full Text: DOI OpenURL
Bonato, Anthony; Breen, Jane; Brimkov, Boris; Carlson, Joshua; English, Sean; Geneson, Jesse; Hogben, Leslie; Perry, K. E.; Reinhart, Carolyn Optimizing the trade-off between number of cops and capture time in cops and robbers. (English) Zbl 1482.05229 J. Comb. 13, No. 1, 79-203 (2022). MSC: 05C57 91A43 PDF BibTeX XML Cite \textit{A. Bonato} et al., J. Comb. 13, No. 1, 79--203 (2022; Zbl 1482.05229) Full Text: DOI arXiv OpenURL
Merkel, Owen Recolouring weakly chordal graphs and the complement of triangle-free graphs. (English) Zbl 1485.05067 Discrete Math. 345, No. 3, Article ID 112708, 5 p. (2022). Reviewer: Tanja Dravec (Maribor) MSC: 05C15 PDF BibTeX XML Cite \textit{O. Merkel}, Discrete Math. 345, No. 3, Article ID 112708, 5 p. (2022; Zbl 1485.05067) Full Text: DOI arXiv OpenURL
Bonomo-Braberman, Flavia; Mazzoleni, María Pía; Rean, Mariano Leonardo; Ries, Bernard On some special classes of contact \(B_0\)-VPG graphs. (English) Zbl 1479.05307 Discrete Appl. Math. 308, 111-129 (2022). MSC: 05C75 05C85 68R10 68Q25 PDF BibTeX XML Cite \textit{F. Bonomo-Braberman} et al., Discrete Appl. Math. 308, 111--129 (2022; Zbl 1479.05307) Full Text: DOI arXiv OpenURL
Abu-Khzam, Faisal N. An improved exact algorithm for minimum dominating set in chordal graphs. (English) Zbl 07444820 Inf. Process. Lett. 174, Article ID 106206, 4 p. (2022). MSC: 68Qxx PDF BibTeX XML Cite \textit{F. N. Abu-Khzam}, Inf. Process. Lett. 174, Article ID 106206, 4 p. (2022; Zbl 07444820) Full Text: DOI OpenURL
Del-Vecchio, Renata R.; Kouider, Mekkia New bounds for the \(b\)-chromatic number of vertex deleted graphs. (English) Zbl 1483.05061 Discrete Appl. Math. 306, 108-113 (2022). Reviewer: Aleksander Vesel (Maribor) MSC: 05C15 PDF BibTeX XML Cite \textit{R. R. Del-Vecchio} and \textit{M. Kouider}, Discrete Appl. Math. 306, 108--113 (2022; Zbl 1483.05061) Full Text: DOI arXiv OpenURL
Ducoffe, Guillaume Beyond Helly graphs: the diameter problem on absolute retracts. (English) Zbl 07538587 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 321-335 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{G. Ducoffe}, Lect. Notes Comput. Sci. 12911, 321--335 (2021; Zbl 07538587) Full Text: DOI OpenURL
Blažej, Václav; Dvořák, Pavel; Opler, Michal Bears with hats and independence polynomials. (English) Zbl 07538584 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 283-295 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{V. Blažej} et al., Lect. Notes Comput. Sci. 12911, 283--295 (2021; Zbl 07538584) Full Text: DOI OpenURL
Crespelle, Christophe; Gras, Benjamin; Perez, Anthony Completion to chordal distance-hereditary graphs: a quartic vertex-kernel. (English) Zbl 07538574 Kowalik, Łukasz (ed.) et al., Graph-theoretic concepts in computer science. 47th international workshop, WG 2021, Warsaw, Poland, June 23–25, 2021. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 12911, 156-168 (2021). MSC: 68R10 PDF BibTeX XML Cite \textit{C. Crespelle} et al., Lect. Notes Comput. Sci. 12911, 156--168 (2021; Zbl 07538574) Full Text: DOI OpenURL
Li, Huani; Fu, Ruiqin; Ma, Xuanlong Forbidden subgraphs in reduced power graphs of finite groups. (English) Zbl 1484.05096 AIMS Math. 6, No. 5, 5410-5420 (2021). MSC: 05C25 05C17 PDF BibTeX XML Cite \textit{H. Li} et al., AIMS Math. 6, No. 5, 5410--5420 (2021; Zbl 1484.05096) Full Text: DOI OpenURL
Jana, Satyabrata; Pandit, Supantha; Roy, Sasanka Balanced connected graph partition. (English) Zbl 07497554 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 487-499 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{S. Jana} et al., Lect. Notes Comput. Sci. 12601, 487--499 (2021; Zbl 07497554) Full Text: DOI OpenURL
Narasimhan, Kasthurirangan Prahlad One-sided discrete terrain guarding and chordal graphs. (English) Zbl 07497526 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 122-134 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{K. P. Narasimhan}, Lect. Notes Comput. Sci. 12601, 122--134 (2021; Zbl 07497526) Full Text: DOI OpenURL
Ikeda, Kazutaka; Ogawa, Kenjiro; Tagusari, Satoshi; Tashiro, Shin-Ichiro; Tsuchiya, Morimasa On strict-double-bound numbers of graphs and cut sets. (English) Zbl 1482.05241 Electron. J. Graph Theory Appl. 9, No. 2, 443-449 (2021). MSC: 05C62 05C76 PDF BibTeX XML Cite \textit{K. Ikeda} et al., Electron. J. Graph Theory Appl. 9, No. 2, 443--449 (2021; Zbl 1482.05241) Full Text: DOI OpenURL
Culbertson, Jared; Guralnik, Dan P.; Stiller, Peter F. Edge erasures and chordal graphs. (English) Zbl 1481.05065 Electron. J. Graph Theory Appl. 9, No. 2, 409-418 (2021). MSC: 05C22 05C75 68R10 57Q10 51K05 62H30 PDF BibTeX XML Cite \textit{J. Culbertson} et al., Electron. J. Graph Theory Appl. 9, No. 2, 409--418 (2021; Zbl 1481.05065) Full Text: DOI arXiv OpenURL
Das, Kousik; Samanta, Sovan; De, Kajal Fuzzy chordal graphs and its properties. (English) Zbl 07486474 Int. J. Appl. Comput. Math. 7, No. 2, Paper No. 36, 12 p. (2021). MSC: 68-XX 05-XX PDF BibTeX XML Cite \textit{K. Das} et al., Int. J. Appl. Comput. Math. 7, No. 2, Paper No. 36, 12 p. (2021; Zbl 07486474) Full Text: DOI OpenURL
Talmaciu, Mihai On hyper-chordal graphs. (English) Zbl 07445710 Carpathian J. Math. 37, No. 1, 119-126 (2021). MSC: 05C75 PDF BibTeX XML Cite \textit{M. Talmaciu}, Carpathian J. Math. 37, No. 1, 119--126 (2021; Zbl 07445710) Full Text: DOI OpenURL
Rahman, Md Zamilur; Mukhopadhyay, Asish Semi-dynamic algorithms for strongly chordal graphs. (English) Zbl 07435920 Discrete Math. Algorithms Appl. 13, No. 4, Article ID 2150049, 42 p. (2021). MSC: 68Q25 68R10 68W05 68W40 05C85 PDF BibTeX XML Cite \textit{M. Z. Rahman} and \textit{A. Mukhopadhyay}, Discrete Math. Algorithms Appl. 13, No. 4, Article ID 2150049, 42 p. (2021; Zbl 07435920) Full Text: DOI arXiv OpenURL
Ma, Yulai; Shi, Yongtang; Wang, Weifan Acyclic edge coloring of chordal graphs with bounded degree. (English) Zbl 1479.05116 Graphs Comb. 37, No. 6, 2621-2636 (2021). MSC: 05C15 05C07 05C35 68R10 PDF BibTeX XML Cite \textit{Y. Ma} et al., Graphs Comb. 37, No. 6, 2621--2636 (2021; Zbl 1479.05116) Full Text: DOI OpenURL
Babu, Jasine; Prabhakaran, Veena; Sharma, Arko A substructure based lower bound for eternal vertex cover number. (English) Zbl 07412728 Theor. Comput. Sci. 890, 87-104 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Babu} et al., Theor. Comput. Sci. 890, 87--104 (2021; Zbl 07412728) Full Text: DOI OpenURL
Kočvara, Michal Decomposition of arrow type positive semidefinite matrices with application to topology optimization. (English) Zbl 1478.90080 Math. Program. 190, No. 1-2 (A), 105-134 (2021). MSC: 90C22 74P05 65N55 05C69 PDF BibTeX XML Cite \textit{M. Kočvara}, Math. Program. 190, No. 1--2 (A), 105--134 (2021; Zbl 1478.90080) Full Text: DOI arXiv OpenURL
Mukhopadhyay, Asish; Rahman, Md. Zamilur Algorithms for generating strongly chordal graphs. (English) Zbl 1473.68126 Gavrilova, Marina L. (ed.) et al., Transactions on Computational Science XXXVIII. Berlin: Springer. Lect. Notes Comput. Sci. 12620, 54-75 (2021). MSC: 68R10 05C85 PDF BibTeX XML Cite \textit{A. Mukhopadhyay} and \textit{Md. Z. Rahman}, Lect. Notes Comput. Sci. 12620, 54--75 (2021; Zbl 1473.68126) Full Text: DOI OpenURL
Araujo, J.; Cezar, A.; Lima, C. V. G. C.; dos Santos, V. F.; Silva, A. On the proper orientation number of chordal graphs. (English) Zbl 07401226 Theor. Comput. Sci. 888, 117-132 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. Araujo} et al., Theor. Comput. Sci. 888, 117--132 (2021; Zbl 07401226) Full Text: DOI arXiv OpenURL
Blair, Jean R. S.; Crespelle, Christophe On the effectiveness of the incremental approach to minimal chordal edge modification. (English) Zbl 07401217 Theor. Comput. Sci. 888, 1-12 (2021). MSC: 68Qxx PDF BibTeX XML Cite \textit{J. R. S. Blair} and \textit{C. Crespelle}, Theor. Comput. Sci. 888, 1--12 (2021; Zbl 07401217) Full Text: DOI OpenURL
Rong, Guozhen; Li, Wenjun; Wang, Jianxin; Yang, Yongjie Cycle extendability of Hamiltonian strongly chordal graphs. (English) Zbl 1473.05150 SIAM J. Discrete Math. 35, No. 3, 2115-2128 (2021). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C38 05C45 05C85 PDF BibTeX XML Cite \textit{G. Rong} et al., SIAM J. Discrete Math. 35, No. 3, 2115--2128 (2021; Zbl 1473.05150) Full Text: DOI arXiv OpenURL
Mirghadim, S. M. Saadat; Nikmehr, M. J.; Nikandish, R. On perfect co-annihilating-ideal graph of a commutative Artinian ring. (English) Zbl 1472.13013 Kragujevac J. Math. 45, No. 1, 63-73 (2021). Reviewer: T. Tamizh Chelvam (Tirunelveli) MSC: 13A70 05C75 05C25 PDF BibTeX XML Cite \textit{S. M. S. Mirghadim} et al., Kragujevac J. Math. 45, No. 1, 63--73 (2021; Zbl 1472.13013) Full Text: Link OpenURL
Rouzbahani Malayeri, Mohammad; Saeedi Madani, Sara; Kiani, Dariush Regularity of binomial edge ideals of chordal graphs. (English) Zbl 1467.13035 Collect. Math. 72, No. 2, 411-422 (2021). MSC: 13F65 05E40 16E05 05C75 13D02 PDF BibTeX XML Cite \textit{M. Rouzbahani Malayeri} et al., Collect. Math. 72, No. 2, 411--422 (2021; Zbl 1467.13035) Full Text: DOI arXiv OpenURL
Eoh, Soogang; Kim, Suh-Ryung On chordal phylogeny graphs. (English) Zbl 1469.05063 Discrete Appl. Math. 302, 80-91 (2021). MSC: 05C20 05C10 PDF BibTeX XML Cite \textit{S. Eoh} and \textit{S.-R. Kim}, Discrete Appl. Math. 302, 80--91 (2021; Zbl 1469.05063) Full Text: DOI arXiv OpenURL
Kumar, Jakkepalli Pavan; Reddy, P. Venkata Subba Algorithmic aspects of secure connected domination in graphs. (English) Zbl 1468.05212 Discuss. Math., Graph Theory 41, No. 4, 1179-1197 (2021). MSC: 05C69 68Q25 68W25 PDF BibTeX XML Cite \textit{J. P. Kumar} and \textit{P. V. S. Reddy}, Discuss. Math., Graph Theory 41, No. 4, 1179--1197 (2021; Zbl 1468.05212) Full Text: DOI arXiv OpenURL
Faal, Hossein Teimoori Clique polynomials of \(2\)-connected \(K_5\)-free chordal graphs. (English) Zbl 1465.05087 J. Algebra Comb. Discrete Struct. Appl. 8, No. 1, 23-29 (2021). MSC: 05C31 05C69 30C15 PDF BibTeX XML Cite \textit{H. T. Faal}, J. Algebra Comb. Discrete Struct. Appl. 8, No. 1, 23--29 (2021; Zbl 1465.05087) Full Text: DOI OpenURL
McKee, Terry A. Graphs that have separator tree representations. (English) Zbl 1468.05193 Australas. J. Comb. 80, Part 1, 89-98 (2021). MSC: 05C62 05C05 05C75 05C38 PDF BibTeX XML Cite \textit{T. A. McKee}, Australas. J. Comb. 80, Part 1, 89--98 (2021; Zbl 1468.05193) Full Text: Link OpenURL
Fomin, Fedor V.; Golovach, Petr A. Subexponential parameterized algorithms and kernelization on almost chordal graphs. (English) Zbl 1467.05254 Algorithmica 83, No. 7, 2170-2214 (2021). MSC: 05C85 05C69 68Q25 PDF BibTeX XML Cite \textit{F. V. Fomin} and \textit{P. A. Golovach}, Algorithmica 83, No. 7, 2170--2214 (2021; Zbl 1467.05254) Full Text: DOI arXiv OpenURL
Beisegel, Jesse; Denkert, Carolin; Köhler, Ekkehard; Krnc, Matjaž; Pivač, Nevena; Scheffler, Robert; Strehler, Martin The recognition problem of graph search trees. (English) Zbl 1467.05032 SIAM J. Discrete Math. 35, No. 2, 1418-1446 (2021). MSC: 05C05 05C85 68P10 68W05 PDF BibTeX XML Cite \textit{J. Beisegel} et al., SIAM J. Discrete Math. 35, No. 2, 1418--1446 (2021; Zbl 1467.05032) Full Text: DOI OpenURL
McKee, Terry A. Characterizing 2-trees relative to chordal and series-parallel graphs. (English) Zbl 1462.05062 Theory Appl. Graphs 8, No. 1, Article 4, 7 p. (2021). MSC: 05C05 05C38 PDF BibTeX XML Cite \textit{T. A. McKee}, Theory Appl. Graphs 8, No. 1, Article 4, 7 p. (2021; Zbl 1462.05062) Full Text: Link OpenURL
Huang, Jing; Ye, Ying Ying Chordality of locally semicomplete and weakly quasi-transitive digraphs. (English) Zbl 1462.05158 Discrete Math. 344, No. 6, Article ID 112362, 9 p. (2021). MSC: 05C20 05C25 PDF BibTeX XML Cite \textit{J. Huang} and \textit{Y. Y. Ye}, Discrete Math. 344, No. 6, Article ID 112362, 9 p. (2021; Zbl 1462.05158) Full Text: DOI arXiv OpenURL
Aboomahigir, Elham; Ahanjideh, Milad; Akbari, Saieed Decomposing claw-free subcubic graphs and 4-chordal subcubic graphs. (English) Zbl 1461.05159 Discrete Appl. Math. 296, 52-55 (2021). MSC: 05C70 05C10 05C40 PDF BibTeX XML Cite \textit{E. Aboomahigir} et al., Discrete Appl. Math. 296, 52--55 (2021; Zbl 1461.05159) Full Text: DOI arXiv OpenURL
Yetim, Mehmet Akif Coloring squares of graphs via vertex orderings. (English) Zbl 1458.05059 Discrete Math. Algorithms Appl. 13, No. 1, Article ID 2050093, 9 p. (2021). MSC: 05C12 05C15 PDF BibTeX XML Cite \textit{M. A. Yetim}, Discrete Math. Algorithms Appl. 13, No. 1, Article ID 2050093, 9 p. (2021; Zbl 1458.05059) Full Text: DOI OpenURL
Krithika, R.; Rai, Ashutosh; Saurabh, Saket; Tale, Prafullkumar Parameterized and exact algorithms for class domination coloring. (English) Zbl 07327719 Discrete Appl. Math. 291, 286-299 (2021). MSC: 68Wxx 68Rxx PDF BibTeX XML Cite \textit{R. Krithika} et al., Discrete Appl. Math. 291, 286--299 (2021; Zbl 07327719) Full Text: DOI OpenURL
He, Changxiang; Qian, Shujuan; Shan, Haiying; Wu, Baofeng The signature of chordal graphs and cographs. (English) Zbl 1484.05130 Graphs Comb. 37, No. 2, 643-650 (2021). MSC: 05C50 05C05 05C38 PDF BibTeX XML Cite \textit{C. He} et al., Graphs Comb. 37, No. 2, 643--650 (2021; Zbl 1484.05130) Full Text: DOI OpenURL
Kuroda, Masamichi; Tsujie, Shuhei Unit ball graphs on geodesic spaces. (English) Zbl 1459.05216 Graphs Comb. 37, No. 1, 111-125 (2021). MSC: 05C62 05C75 05C45 PDF BibTeX XML Cite \textit{M. Kuroda} and \textit{S. Tsujie}, Graphs Comb. 37, No. 1, 111--125 (2021; Zbl 1459.05216) Full Text: DOI arXiv OpenURL
Hell, Pavol; Hernández-Cruz, César; Huang, Jing; Lin, Jephian C.-H. Strong chordality of graphs with possible loops. (English) Zbl 1459.05238 SIAM J. Discrete Math. 35, No. 1, 362-375 (2021). MSC: 05C69 05C60 05C75 05C17 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Discrete Math. 35, No. 1, 362--375 (2021; Zbl 1459.05238) Full Text: DOI OpenURL
Cohen, Nir; Pereira, Edgar The cyclic rank completion problem with general blocks. (English) Zbl 1459.05165 Linear Multilinear Algebra 69, No. 1, 48-73 (2021). MSC: 05C50 16G20 15A21 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{E. Pereira}, Linear Multilinear Algebra 69, No. 1, 48--73 (2021; Zbl 1459.05165) Full Text: DOI OpenURL
Cohen, Nir; Pereira, Edgar Symmetric completions of cycles and bipartite graphs. (English) Zbl 1459.05164 Linear Algebra Appl. 614, 164-175 (2021). MSC: 05C50 05C38 16G20 15A21 PDF BibTeX XML Cite \textit{N. Cohen} and \textit{E. Pereira}, Linear Algebra Appl. 614, 164--175 (2021; Zbl 1459.05164) Full Text: DOI OpenURL
Abreu, Nair; Justel, Claudia Marcela; Markenzon, Lilian Integer Laplacian eigenvalues of chordal graphs. (English) Zbl 1459.05153 Linear Algebra Appl. 614, 68-81 (2021). MSC: 05C50 05C75 PDF BibTeX XML Cite \textit{N. Abreu} et al., Linear Algebra Appl. 614, 68--81 (2021; Zbl 1459.05153) Full Text: DOI arXiv OpenURL
Niu, Bei; Li, Bi; Zhang, Xin Hardness and algorithms of equitable tree-coloring problem in chordal graphs. (English) Zbl 1477.68242 Theor. Comput. Sci. 857, 8-15 (2021). MSC: 68R10 05C05 05C15 68Q17 68W25 PDF BibTeX XML Cite \textit{B. Niu} et al., Theor. Comput. Sci. 857, 8--15 (2021; Zbl 1477.68242) Full Text: DOI OpenURL
Mou, Chenqi; Bai, Yang; Lai, Jiahua Chordal graphs in triangular decomposition in top-down style. (English) Zbl 1443.05132 J. Symb. Comput. 102, 108-131 (2021). MSC: 05C62 05C25 13P15 68W30 PDF BibTeX XML Cite \textit{C. Mou} et al., J. Symb. Comput. 102, 108--131 (2021; Zbl 1443.05132) Full Text: DOI arXiv OpenURL
Deepalakshmi, J.; Marimuthu, G.; Somasundaram, A.; Arumugam, S. On the 2-token graph of a graph. (English) Zbl 1473.05253 AKCE Int. J. Graphs Comb. 17, No. 1, 265-268 (2020). MSC: 05C75 05C60 05C40 PDF BibTeX XML Cite \textit{J. Deepalakshmi} et al., AKCE Int. J. Graphs Comb. 17, No. 1, 265--268 (2020; Zbl 1473.05253) Full Text: DOI OpenURL
Bashir, Hamideh Hasanzadeh; Ahmadidelir, Karim Some structural graph properties of the non-commuting graph of a class of finite Moufang loops. (English) Zbl 1468.20111 Electron. J. Graph Theory Appl. 8, No. 2, 319-337 (2020). MSC: 20N05 20D60 05C17 PDF BibTeX XML Cite \textit{H. H. Bashir} and \textit{K. Ahmadidelir}, Electron. J. Graph Theory Appl. 8, No. 2, 319--337 (2020; Zbl 1468.20111) Full Text: DOI OpenURL
Tamizh Chelvam, T.; Balamurugan, M. Complement of the generalized total graph of fields. (English) Zbl 1468.05248 AKCE Int. J. Graphs Comb. 17, No. 3, 730-733 (2020). MSC: 05C75 05C25 13A15 13M05 PDF BibTeX XML Cite \textit{T. Tamizh Chelvam} and \textit{M. Balamurugan}, AKCE Int. J. Graphs Comb. 17, No. 3, 730--733 (2020; Zbl 1468.05248) Full Text: DOI OpenURL
Tian, Jingjing Weight of light chords 4-cycles in IC-planar graphs with degree restrictions. (Chinese. English summary) Zbl 1474.05107 J. Jilin Univ., Sci. 58, No. 5, 1093-1099 (2020). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{J. Tian}, J. Jilin Univ., Sci. 58, No. 5, 1093--1099 (2020; Zbl 1474.05107) Full Text: DOI OpenURL
Babu, Jasine; Prabhakaran, Veena A new lower bound for the eternal vertex cover number of graphs. (English) Zbl 07336092 Kim, Donghyun (ed.) et al., Computing and combinatorics. 26th international conference, COCOON 2020, Atlanta, GA, USA, August 29–31, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12273, 27-39 (2020). MSC: 68Rxx PDF BibTeX XML Cite \textit{J. Babu} and \textit{V. Prabhakaran}, Lect. Notes Comput. Sci. 12273, 27--39 (2020; Zbl 07336092) Full Text: DOI arXiv OpenURL
Das, Sayani; Mishra, Sounaka Lower bounds on approximating some variations of vertex coloring problem over restricted graph classes. (English) Zbl 1458.05061 Discrete Math. Algorithms Appl. 12, No. 6, Article ID 2050086, 11 p. (2020). MSC: 05C15 05C69 05C85 68W25 PDF BibTeX XML Cite \textit{S. Das} and \textit{S. Mishra}, Discrete Math. Algorithms Appl. 12, No. 6, Article ID 2050086, 11 p. (2020; Zbl 1458.05061) Full Text: DOI OpenURL
Rahman, Md. Zamilur; Mukhopadhyay, Asish; Aneja, Yash. P. A separator-based method for generating weakly chordal graphs. (English) Zbl 07332138 Discrete Math. Algorithms Appl. 12, No. 4, Article ID 2050039, 16 p. (2020). MSC: 68P05 68Q25 68R10 68W40 68W05 PDF BibTeX XML Cite \textit{Md. Z. Rahman} et al., Discrete Math. Algorithms Appl. 12, No. 4, Article ID 2050039, 16 p. (2020; Zbl 07332138) Full Text: DOI arXiv OpenURL
Ene, Viviana; Herzog, Jürgen On the symbolic powers of binomial edge ideals. (English) Zbl 1456.05183 Stamate, Dumitru I. (ed.) et al., Combinatorial structures in algebra and geometry. NSA 26, Constanţa, Romania, August 26 – September 1, 2018. Cham: Springer. Springer Proc. Math. Stat. 331, 43-50 (2020). MSC: 05E40 13C15 PDF BibTeX XML Cite \textit{V. Ene} and \textit{J. Herzog}, Springer Proc. Math. Stat. 331, 43--50 (2020; Zbl 1456.05183) Full Text: DOI arXiv OpenURL
Montejano, Luis Pedro; Núñez-Betancourt, Luis \(b\)-vectors of chordal graphs. (English) Zbl 1455.05026 J. Commut. Algebra 12, No. 4, 539-557 (2020). MSC: 05C25 05E40 05E45 13D02 13F55 PDF BibTeX XML Cite \textit{L. P. Montejano} and \textit{L. Núñez-Betancourt}, J. Commut. Algebra 12, No. 4, 539--557 (2020; Zbl 1455.05026) Full Text: DOI arXiv Euclid OpenURL
McKee, Terry A. Uncrossed chords of cycles in chordal graphs. (English) Zbl 1452.05152 Util. Math. 114, 277-281 (2020). MSC: 05C75 05C38 05C70 PDF BibTeX XML Cite \textit{T. A. McKee}, Util. Math. 114, 277--281 (2020; Zbl 1452.05152) OpenURL
Hell, Pavol; Huang, Jing; Lin, Jephian C.-H.; McConnell, Ross M. Bipartite analogues of comparability and cocomparability graphs. (English) Zbl 1450.05089 SIAM J. Discrete Math. 34, No. 3, 1969-1983 (2020). MSC: 05C99 05C75 05C85 PDF BibTeX XML Cite \textit{P. Hell} et al., SIAM J. Discrete Math. 34, No. 3, 1969--1983 (2020; Zbl 1450.05089) Full Text: DOI arXiv OpenURL
Anand, Bijo S.; Anil, Arun; Changat, Manoj; Dourado, Mitre C.; Ramla, Sabeer S. Computing the hull number in \(\Delta \)-convexity. (English) Zbl 1468.05047 Theor. Comput. Sci. 844, 217-226 (2020). MSC: 05C10 05C82 91D30 68Q17 PDF BibTeX XML Cite \textit{B. S. Anand} et al., Theor. Comput. Sci. 844, 217--226 (2020; Zbl 1468.05047) Full Text: DOI OpenURL
Kim, Eun Jung; Kwon, O-joung Erdős-Pósa property of chordless cycles and its applications. (English) Zbl 1448.05115 J. Comb. Theory, Ser. B 145, 65-112 (2020). MSC: 05C38 05C12 PDF BibTeX XML Cite \textit{E. J. Kim} and \textit{O-j. Kwon}, J. Comb. Theory, Ser. B 145, 65--112 (2020; Zbl 1448.05115) Full Text: DOI OpenURL
Couto, Fernanda; Cunha, Luís Felipe I. Hardness and efficiency on minimizing maximum distances in spanning trees. (English) Zbl 1453.68131 Theor. Comput. Sci. 838, 168-179 (2020). MSC: 68R10 05C12 68Q17 68Q25 PDF BibTeX XML Cite \textit{F. Couto} and \textit{L. F. I. Cunha}, Theor. Comput. Sci. 838, 168--179 (2020; Zbl 1453.68131) Full Text: DOI OpenURL
Fukuzono, Naoka; Hanaka, Tesshu; Kiya, Hironori; Ono, Hirotaka; Yamaguchi, Ryogo Two-player competitive diffusion game: graph classes and the existence of a Nash equilibrium. (English) Zbl 1440.91011 Chatzigeorgiou, Alexander (ed.) et al., SOFSEM 2020: theory and practice of computer science. 46th international conference on current trends in theory and practice of informatics, SOFSEM 2020, Limassol, Cyprus, January 20–24, 2020. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12011, 627-635 (2020). MSC: 91A43 05C57 91A68 PDF BibTeX XML Cite \textit{N. Fukuzono} et al., Lect. Notes Comput. Sci. 12011, 627--635 (2020; Zbl 1440.91011) Full Text: DOI OpenURL
McKee, Terry A. Distance-hereditary and strongly distance-hereditary graphs. (English) Zbl 1443.05050 Bull. Inst. Comb. Appl. 88, 50-64 (2020). MSC: 05C12 05C75 PDF BibTeX XML Cite \textit{T. A. McKee}, Bull. Inst. Comb. Appl. 88, 50--64 (2020; Zbl 1443.05050) Full Text: Link OpenURL
Belton, Alexander; Guillot, Dominique; Khare, Apoorva; Putinar, Mihai A panorama of positivity. II: Fixed dimension. (English) Zbl 1452.15021 Dales, H. Garth (ed.) et al., Complex analysis and spectral theory. Conference in celebration of Thomas Ransford’s 60th birthday, Laval University, Québec, Canada, May 21–25, 2018. Providence, RI: American Mathematical Society (AMS). Contemp. Math. 743, 109-150 (2020). Reviewer: Mihail Voicu (Iaşi) MSC: 15B48 15B05 05E05 44A60 15A24 15A15 15A45 15A83 47B35 05C50 30E05 62J10 15-02 PDF BibTeX XML Cite \textit{A. Belton} et al., Contemp. Math. 743, 109--150 (2020; Zbl 1452.15021) Full Text: DOI OpenURL
Eoh, Soogang; Choi, Jihoon; Kim, Suh-Ryung; Oh, Miok The niche graphs of bipartite tournaments. (English) Zbl 1441.05089 Discrete Appl. Math. 282, 86-95 (2020). MSC: 05C20 PDF BibTeX XML Cite \textit{S. Eoh} et al., Discrete Appl. Math. 282, 86--95 (2020; Zbl 1441.05089) Full Text: DOI arXiv OpenURL
Clarke, N. E.; Cox, D.; Duffy, C.; Dyer, D.; Fitzpatrick, S. L.; Messinger, M. E. Limited visibility cops and robber. (English) Zbl 1441.05155 Discrete Appl. Math. 282, 53-64 (2020). MSC: 05C57 91A43 PDF BibTeX XML Cite \textit{N. E. Clarke} et al., Discrete Appl. Math. 282, 53--64 (2020; Zbl 1441.05155) Full Text: DOI arXiv OpenURL
Brandstädt, Andreas; Mosca, Raffaele On efficient domination for some classes of \(H\)-free chordal graphs. (English) Zbl 1440.05158 Discrete Appl. Math. 281, 81-95 (2020). MSC: 05C69 68Q17 PDF BibTeX XML Cite \textit{A. Brandstädt} and \textit{R. Mosca}, Discrete Appl. Math. 281, 81--95 (2020; Zbl 1440.05158) Full Text: DOI arXiv OpenURL
Bornstein, Claudson Ferreira; Coura Pinto, José Wilson; Rautenbach, Dieter; Szwarcfiter, Jayme Luiz Constant threshold intersection graphs of orthodox paths in trees. (English) Zbl 1440.05152 Discrete Appl. Math. 281, 61-68 (2020). MSC: 05C62 05C76 05C10 PDF BibTeX XML Cite \textit{C. F. Bornstein} et al., Discrete Appl. Math. 281, 61--68 (2020; Zbl 1440.05152) Full Text: DOI arXiv OpenURL
Shalu, M. A.; Vijayakumar, S.; Sandhya, T. P. On the complexity of cd-coloring of graphs. (English) Zbl 1439.05093 Discrete Appl. Math. 280, 171-185 (2020). MSC: 05C15 05C69 PDF BibTeX XML Cite \textit{M. A. Shalu} et al., Discrete Appl. Math. 280, 171--185 (2020; Zbl 1439.05093) Full Text: DOI OpenURL
Wang, Guanglei; Hijazi, Hassan Exploiting sparsity for the min \(k\)-partition problem. (English) Zbl 1437.90143 Math. Program. Comput. 12, No. 1, 109-130 (2020). MSC: 90C27 90C10 90C22 90C35 PDF BibTeX XML Cite \textit{G. Wang} and \textit{H. Hijazi}, Math. Program. Comput. 12, No. 1, 109--130 (2020; Zbl 1437.90143) Full Text: DOI arXiv OpenURL
Klusowski, Jason M.; Wu, Yihong Estimating the number of connected components in a graph via subgraph sampling. (English) Zbl 1440.62043 Bernoulli 26, No. 3, 1635-1664 (2020). Reviewer: Kurt Marti (München) MSC: 62D05 05C90 62C20 PDF BibTeX XML Cite \textit{J. M. Klusowski} and \textit{Y. Wu}, Bernoulli 26, No. 3, 1635--1664 (2020; Zbl 1440.62043) Full Text: DOI arXiv Euclid OpenURL
Laurent, Monique; Tanigawa, Shin-Ichi Perfect elimination orderings for symmetric matrices. (English) Zbl 1442.05080 Optim. Lett. 14, No. 2, 339-353 (2020). MSC: 05C22 05C99 05B20 PDF BibTeX XML Cite \textit{M. Laurent} and \textit{S.-I. Tanigawa}, Optim. Lett. 14, No. 2, 339--353 (2020; Zbl 1442.05080) Full Text: DOI arXiv OpenURL
Golovach, Petr A.; Heggernes, Pinar; Kratsch, Dieter; Saei, Reza Enumeration of minimal connected dominating sets for chordal graphs. (English) Zbl 1437.05104 Discrete Appl. Math. 278, 3-11 (2020). MSC: 05C30 05C69 PDF BibTeX XML Cite \textit{P. A. Golovach} et al., Discrete Appl. Math. 278, 3--11 (2020; Zbl 1437.05104) Full Text: DOI OpenURL
Ahmad, Safyan; Anwar, Imran; Kosar, Zunaira Cohen-Macaulay modifications of the facet ideal of a simplicial complex. (English) Zbl 1434.13021 J. Algebra Appl. 19, No. 3, Article ID 2050060, 11 p. (2020). MSC: 13F55 13A02 13C14 13D02 13P10 PDF BibTeX XML Cite \textit{S. Ahmad} et al., J. Algebra Appl. 19, No. 3, Article ID 2050060, 11 p. (2020; Zbl 1434.13021) Full Text: DOI OpenURL
Conte, Alessio; Kanté, Mamadou Moustapha; Otachi, Yota; Uno, Takeaki; Wasa, Kunihiro Efficient enumeration of maximal \(k\)-degenerate induced subgraphs of a chordal graph. (English) Zbl 1437.05102 Theor. Comput. Sci. 818, 2-11 (2020). MSC: 05C30 05C60 05C05 05C42 PDF BibTeX XML Cite \textit{A. Conte} et al., Theor. Comput. Sci. 818, 2--11 (2020; Zbl 1437.05102) Full Text: DOI OpenURL
Quiroz, Daniel A. Colouring exact distance graphs of chordal graphs. (English) Zbl 1435.05085 Discrete Math. 343, No. 5, Article ID 111769, 7 p. (2020). MSC: 05C15 05C12 05C60 PDF BibTeX XML Cite \textit{D. A. Quiroz}, Discrete Math. 343, No. 5, Article ID 111769, 7 p. (2020; Zbl 1435.05085) Full Text: DOI arXiv OpenURL
Galby, Esther; Munaro, Andrea; Ries, Bernard Semitotal domination: new hardness results and a polynomial-time algorithm for graphs of bounded mim-width. (English) Zbl 1435.68112 Theor. Comput. Sci. 814, 28-48 (2020). MSC: 68Q17 05C69 05C85 68W40 PDF BibTeX XML Cite \textit{E. Galby} et al., Theor. Comput. Sci. 814, 28--48 (2020; Zbl 1435.68112) Full Text: DOI arXiv Link OpenURL
Galvin, David; Pacurar, Adrian Total non-negativity of some combinatorial matrices. (English) Zbl 1439.05136 J. Comb. Theory, Ser. A 172, Article ID 105179, 21 p. (2020). Reviewer: Ioan Tomescu (Bucureşti) MSC: 05C50 05B20 11B73 15B99 PDF BibTeX XML Cite \textit{D. Galvin} and \textit{A. Pacurar}, J. Comb. Theory, Ser. A 172, Article ID 105179, 21 p. (2020; Zbl 1439.05136) Full Text: DOI arXiv OpenURL
Feghali, Carl; Fiala, Jiří Reconfiguration graph for vertex colourings of weakly chordal graphs. (English) Zbl 1432.05040 Discrete Math. 343, No. 3, Article ID 111733, 6 p. (2020). MSC: 05C15 PDF BibTeX XML Cite \textit{C. Feghali} and \textit{J. Fiala}, Discrete Math. 343, No. 3, Article ID 111733, 6 p. (2020; Zbl 1432.05040) Full Text: DOI arXiv OpenURL
Kumar, Arvind Regularity bound of generalized binomial edge ideal of graphs. (English) Zbl 1433.13013 J. Algebra 546, 357-369 (2020). Reviewer: S. A. Seyed Fakhari (Tehran) MSC: 13D02 13C13 05E40 PDF BibTeX XML Cite \textit{A. Kumar}, J. Algebra 546, 357--369 (2020; Zbl 1433.13013) Full Text: DOI OpenURL
Pass-Lanneau, Adèle; Igarashi, Ayumi; Meunier, Frédéric Perfect graphs with polynomially computable kernels. (English) Zbl 1429.05079 Discrete Appl. Math. 272, 69-74 (2020). MSC: 05C17 05C20 PDF BibTeX XML Cite \textit{A. Pass-Lanneau} et al., Discrete Appl. Math. 272, 69--74 (2020; Zbl 1429.05079) Full Text: DOI arXiv OpenURL
Markenzon, Lilian Non-inclusion and other subclasses of chordal graphs. (English) Zbl 1429.05196 Discrete Appl. Math. 272, 43-47 (2020). MSC: 05C99 05C35 05C12 PDF BibTeX XML Cite \textit{L. Markenzon}, Discrete Appl. Math. 272, 43--47 (2020; Zbl 1429.05196) Full Text: DOI OpenURL
Dragan, Feodor F. An eccentricity 2-approximating spanning tree of a chordal graph is computable in linear time. (English) Zbl 1481.05029 Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020). MSC: 05C05 05C85 68Q25 05C12 PDF BibTeX XML Cite \textit{F. F. Dragan}, Inf. Process. Lett. 154, Article ID 105873, 4 p. (2020; Zbl 1481.05029) Full Text: DOI OpenURL
Bousquet, Nicolas; Bartier, Valentin Linear transformations between colorings in chordal graphs. (English) Zbl 07525461 Bender, Michael A. (ed.) et al., 27th annual European symposium on algorithms, ESA 2019, Munich/Garching, Germany, September 9–11, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 144, Article 24, 15 p. (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{N. Bousquet} and \textit{V. Bartier}, LIPIcs -- Leibniz Int. Proc. Inform. 144, Article 24, 15 p. (2019; Zbl 07525461) Full Text: DOI OpenURL
Couto, Fernanda; Cunha, Luís Felipe I. Hardness and efficiency on minimizing maximum distances for graphs with few \(P_4\)’s and \((k, \ell)\)-graphs. (English) Zbl 07515194 Coutinho, Gabriel (ed.) et al., Proceedings of LAGOS 2019, the tenth Latin and American algorithms, graphs and optimization symposium, Belo Horizonte, Brazil, June 2–7 2019. Amsterdam: Elsevier. Electron. Notes Theor. Comput. Sci. 346, 355-367 (2019). MSC: 05Cxx 90Cxx PDF BibTeX XML Cite \textit{F. Couto} and \textit{L. F. I. Cunha}, Electron. Notes Theor. Comput. Sci. 346, 355--367 (2019; Zbl 07515194) Full Text: DOI OpenURL
Henning, Michael A.; Pandey, Arti; Tripathi, Vikash Complexity and algorithms for semipaired domination in graphs. (English) Zbl 07173538 Colbourn, Charles J. (ed.) et al., Combinatorial algorithms. 30th international workshop, IWOCA 2019, Pisa, Italy, July 23–25, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11638, 278-289 (2019). MSC: 68Rxx 68Wxx PDF BibTeX XML Cite \textit{M. A. Henning} et al., Lect. Notes Comput. Sci. 11638, 278--289 (2019; Zbl 07173538) Full Text: DOI arXiv OpenURL
Erey, Nursel On the cover ideals of chordal graphs. (English) Zbl 1435.13010 Turk. J. Math. 43, No. 5, 2405-2414 (2019). Reviewer: S. K. Nimbhorkar (Aurangabad) MSC: 13D02 13F55 05C25 05E40 PDF BibTeX XML Cite \textit{N. Erey}, Turk. J. Math. 43, No. 5, 2405--2414 (2019; Zbl 1435.13010) Full Text: arXiv Link OpenURL
Chan, Wai Hong; Xu, Shou-Jun Note on the upper bound on mean distance in terms of minimum degree. (English) Zbl 1463.05131 Ars Comb. 143, 165-172 (2019). MSC: 05C12 05C07 PDF BibTeX XML Cite \textit{W. H. Chan} and \textit{S.-J. Xu}, Ars Comb. 143, 165--172 (2019; Zbl 1463.05131) OpenURL
Schleißinger, Sebastian Loewner’s differential equation and spidernets. (English) Zbl 1462.30047 Complex Anal. Oper. Theory 13, No. 8, 3899-3921 (2019). Reviewer: Dmitri V. Prokhorov (Saratov) MSC: 30C80 30C35 46L53 05C50 PDF BibTeX XML Cite \textit{S. Schleißinger}, Complex Anal. Oper. Theory 13, No. 8, 3899--3921 (2019; Zbl 1462.30047) Full Text: DOI arXiv OpenURL
Panda, B. S.; Verma, Shaily On partial Grundy coloring of bipartite graphs and chordal graphs. (English) Zbl 1428.05114 Discrete Appl. Math. 271, 171-183 (2019). MSC: 05C15 68Q25 PDF BibTeX XML Cite \textit{B. S. Panda} and \textit{S. Verma}, Discrete Appl. Math. 271, 171--183 (2019; Zbl 1428.05114) Full Text: DOI OpenURL
Weißauer, Daniel In absence of long chordless cycles, large tree-width becomes a local phenomenon. (English) Zbl 1428.05122 J. Comb. Theory, Ser. B 139, 342-352 (2019). MSC: 05C15 05C05 05C38 05C12 PDF BibTeX XML Cite \textit{D. Weißauer}, J. Comb. Theory, Ser. B 139, 342--352 (2019; Zbl 1428.05122) Full Text: DOI arXiv OpenURL
Salam, Sameera M.; Chacko, Daphna; Warrier, Nandini J.; Krishnan, K. Murali; Sudeep, K. S. On chordal and perfect plane triangulations. (English) Zbl 07115822 Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 274-285 (2019). MSC: 68Wxx PDF BibTeX XML Cite \textit{S. M. Salam} et al., Lect. Notes Comput. Sci. 11394, 274--285 (2019; Zbl 07115822) Full Text: DOI OpenURL