Bar-Noy, Amotz; Böhnlein, Toni; Lotker, Zvi; Peleg, David; Rawitz, Dror The generalized microscopic image reconstruction problem. (English) Zbl 07585606 Discrete Appl. Math. 321, 402-416 (2022). MSC: 68Uxx 05Cxx 68Qxx PDFBibTeX XMLCite \textit{A. Bar-Noy} et al., Discrete Appl. Math. 321, 402--416 (2022; Zbl 07585606) Full Text: DOI
Caro, Yair; Petruševski, Mirko; Škrekovski, Riste Remarks on odd colorings of graphs. (English) Zbl 1497.05070 Discrete Appl. Math. 321, 392-401 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{Y. Caro} et al., Discrete Appl. Math. 321, 392--401 (2022; Zbl 1497.05070) Full Text: DOI arXiv
Petruševski, Mirko; Škrekovski, Riste Colorings with neighborhood parity condition. (English) Zbl 1497.05096 Discrete Appl. Math. 321, 385-391 (2022). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{M. Petruševski} and \textit{R. Škrekovski}, Discrete Appl. Math. 321, 385--391 (2022; Zbl 1497.05096) Full Text: DOI arXiv
Ábrego, Bernardo M.; Fernández-Merchant, Silvia The outerplanar crossing number of the complete bipartite graph. (English) Zbl 1497.05049 Discrete Appl. Math. 321, 379-384 (2022). MSC: 05C10 05C62 PDFBibTeX XMLCite \textit{B. M. Ábrego} and \textit{S. Fernández-Merchant}, Discrete Appl. Math. 321, 379--384 (2022; Zbl 1497.05049) Full Text: DOI
Cappelle, Márcia R.; Coelho, Erika M. M.; Coelho, Hebert; Silva, Braully R.; Souza, Uéverton S.; Protti, Fábio \(P_3\)-convexity on graphs with diameter two: computing hull and interval numbers. (English) Zbl 1497.05051 Discrete Appl. Math. 321, 368-378 (2022). MSC: 05C10 05C07 05C12 52A99 PDFBibTeX XMLCite \textit{M. R. Cappelle} et al., Discrete Appl. Math. 321, 368--378 (2022; Zbl 1497.05051) Full Text: DOI
Wu, Yueyu; Chen, Yaojun Degree sums and proper connection number of graphs. (English) Zbl 1497.05040 Discrete Appl. Math. 321, 360-367 (2022). MSC: 05C07 05C35 05C12 PDFBibTeX XMLCite \textit{Y. Wu} and \textit{Y. Chen}, Discrete Appl. Math. 321, 360--367 (2022; Zbl 1497.05040) Full Text: DOI
Lai, Hsin-Hao; Lih, Ko-Wei A note on additive choice number of planar graphs. (English) Zbl 1497.05238 Discrete Appl. Math. 321, 357-359 (2022). MSC: 05C78 05C15 05C10 PDFBibTeX XMLCite \textit{H.-H. Lai} and \textit{K.-W. Lih}, Discrete Appl. Math. 321, 357--359 (2022; Zbl 1497.05238) Full Text: DOI
Lin, Xiaoxia; Wang, Keke; Zhang, Meng; Lai, Hong-Jian Bounding \(\ell\)-edge-connectivity in edge-connectivity. (English) Zbl 1497.05136 Discrete Appl. Math. 321, 350-356 (2022). Reviewer: Yilun Shang (Newcastle upon Tyne) MSC: 05C40 PDFBibTeX XMLCite \textit{X. Lin} et al., Discrete Appl. Math. 321, 350--356 (2022; Zbl 1497.05136) Full Text: DOI
Könen, David; Schmidt, Daniel; Spisla, Christiane Finding all minimum cost flows and a faster algorithm for the \(K\) best flow problem. (English) Zbl 1500.90080 Discrete Appl. Math. 321, 333-349 (2022). MSC: 90C35 90C27 PDFBibTeX XMLCite \textit{D. Könen} et al., Discrete Appl. Math. 321, 333--349 (2022; Zbl 1500.90080) Full Text: DOI arXiv
Jaume, Daniel A.; Panelo, Cristian; Toledo, Maikon Machado; Molina, Gonzalo On the structure of the inverse of non-singular unicyclic graphs. (English) Zbl 1497.05133 Discrete Appl. Math. 321, 316-332 (2022). MSC: 05C38 05C50 05C70 PDFBibTeX XMLCite \textit{D. A. Jaume} et al., Discrete Appl. Math. 321, 316--332 (2022; Zbl 1497.05133) Full Text: DOI
Čekanová, K.; Madaras, T. On the structure of essentially-highly-connected polyhedral graphs. (English) Zbl 1497.05135 Discrete Appl. Math. 321, 308-315 (2022). MSC: 05C40 05C10 PDFBibTeX XMLCite \textit{K. Čekanová} and \textit{T. Madaras}, Discrete Appl. Math. 321, 308--315 (2022; Zbl 1497.05135) Full Text: DOI
Dankelmann, Peter; Mafunda, Sonwabile On the difference between proximity and other distance parameters in triangle-free graphs and \(C_4\)-free graphs. (English) Zbl 1497.05058 Discrete Appl. Math. 321, 295-307 (2022). MSC: 05C12 05C07 05C35 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} and \textit{S. Mafunda}, Discrete Appl. Math. 321, 295--307 (2022; Zbl 1497.05058) Full Text: DOI arXiv
Fukuzono, Naoka; Hanaka, Tesshu; Kiya, Hironori; Ono, Hirotaka The existence of a pure Nash equilibrium in the two-player competitive diffusion game on graphs having chordality. (English) Zbl 1498.91089 Discrete Appl. Math. 321, 281-294 (2022). MSC: 91A43 05C57 91D30 PDFBibTeX XMLCite \textit{N. Fukuzono} et al., Discrete Appl. Math. 321, 281--294 (2022; Zbl 1498.91089) Full Text: DOI
Wang, Juan; Liang, Zuosong; Cai, Jiansheng; Miao, Lianying Acyclic coloring of claw-free graphs with small degree. (English) Zbl 1497.05102 Discrete Appl. Math. 321, 272-280 (2022). MSC: 05C15 05C07 PDFBibTeX XMLCite \textit{J. Wang} et al., Discrete Appl. Math. 321, 272--280 (2022; Zbl 1497.05102) Full Text: DOI
Finbow, Arthur S.; Hartnell, Bert L.; Plummer, Michael D. A characterization of well-indumatchable graphs having girth greater than seven. (English) Zbl 1497.05216 Discrete Appl. Math. 321, 261-271 (2022). MSC: 05C70 05C12 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. S. Finbow} et al., Discrete Appl. Math. 321, 261--271 (2022; Zbl 1497.05216) Full Text: DOI
Cranston, Daniel W. Strong edge-coloring of cubic bipartite graphs: a counterexample. (English) Zbl 1497.05074 Discrete Appl. Math. 321, 258-260 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{D. W. Cranston}, Discrete Appl. Math. 321, 258--260 (2022; Zbl 1497.05074) Full Text: DOI arXiv
Dravec, Tanja On the toll number of a graph. (English) Zbl 1497.05059 Discrete Appl. Math. 321, 250-257 (2022). MSC: 05C12 05C10 05C38 52A99 68Q17 PDFBibTeX XMLCite \textit{T. Dravec}, Discrete Appl. Math. 321, 250--257 (2022; Zbl 1497.05059) Full Text: DOI
Qi, Jinfeng; Ni, Jinbo; Geng, Xianya The expected values for the Kirchhoff indices in the random cyclooctatetraene and spiro chains. (English) Zbl 1497.05044 Discrete Appl. Math. 321, 240-249 (2022). MSC: 05C09 05C07 05C92 92E10 PDFBibTeX XMLCite \textit{J. Qi} et al., Discrete Appl. Math. 321, 240--249 (2022; Zbl 1497.05044) Full Text: DOI
Epstein, Leah Open-end bin packing: new and old analysis approaches. (English) Zbl 1500.90056 Discrete Appl. Math. 321, 220-239 (2022). MSC: 90C27 PDFBibTeX XMLCite \textit{L. Epstein}, Discrete Appl. Math. 321, 220--239 (2022; Zbl 1500.90056) Full Text: DOI arXiv
Hellmuth, Marc; Scholz, Guillaume E. From modular decomposition trees to level-1 networks: pseudo-cographs, polar-cats and prime polar-cats. (English) Zbl 1497.05218 Discrete Appl. Math. 321, 179-219 (2022). MSC: 05C70 05C85 92D15 PDFBibTeX XMLCite \textit{M. Hellmuth} and \textit{G. E. Scholz}, Discrete Appl. Math. 321, 179--219 (2022; Zbl 1497.05218) Full Text: DOI arXiv
Wang, Jing; Liu, Xiaogang State transfers in vertex complemented coronas. (English) Zbl 1497.05164 Discrete Appl. Math. 321, 165-178 (2022). MSC: 05C50 05C40 81P45 81P68 15A18 PDFBibTeX XMLCite \textit{J. Wang} and \textit{X. Liu}, Discrete Appl. Math. 321, 165--178 (2022; Zbl 1497.05164) Full Text: DOI arXiv
Chen, Lily; Li, Yanyi; Zhou, Xiangqian The inclusion-free edge-colorings of \((3, \varDelta)\)-bipartite graphs. (English) Zbl 1497.05071 Discrete Appl. Math. 321, 159-164 (2022). MSC: 05C15 PDFBibTeX XMLCite \textit{L. Chen} et al., Discrete Appl. Math. 321, 159--164 (2022; Zbl 1497.05071) Full Text: DOI
Hong, Yunchao; Miao, Lianying Extremal graphs of bipartite graphs of given diameter for two indices on resistance-distance. (English) Zbl 1497.05129 Discrete Appl. Math. 321, 147-158 (2022). MSC: 05C35 05C12 PDFBibTeX XMLCite \textit{Y. Hong} and \textit{L. Miao}, Discrete Appl. Math. 321, 147--158 (2022; Zbl 1497.05129) Full Text: DOI
Fernandes, Rosário On certain trees with the same degree sequence. (English) Zbl 1497.05038 Discrete Appl. Math. 321, 138-146 (2022). MSC: 05C05 05C07 PDFBibTeX XMLCite \textit{R. Fernandes}, Discrete Appl. Math. 321, 138--146 (2022; Zbl 1497.05038) Full Text: DOI
Gauci, John Baptist; Zerafa, Jean Paul Accordion graphs: Hamiltonicity, matchings and isomorphism with quartic circulants. (English) Zbl 1497.05217 Discrete Appl. Math. 321, 126-137 (2022). MSC: 05C70 05C45 PDFBibTeX XMLCite \textit{J. B. Gauci} and \textit{J. P. Zerafa}, Discrete Appl. Math. 321, 126--137 (2022; Zbl 1497.05217) Full Text: DOI arXiv
Escamocher, Guillaume; O’Sullivan, Barry Regular pattern-free coloring. (English) Zbl 1497.05081 Discrete Appl. Math. 321, 109-125 (2022). MSC: 05C15 68Q17 68Q25 PDFBibTeX XMLCite \textit{G. Escamocher} and \textit{B. O'Sullivan}, Discrete Appl. Math. 321, 109--125 (2022; Zbl 1497.05081) Full Text: DOI
Moshkov, Mikhail Rough analysis of computation trees. (English) Zbl 07585580 Discrete Appl. Math. 321, 90-108 (2022). MSC: 68Rxx 68Txx 68Qxx PDFBibTeX XMLCite \textit{M. Moshkov}, Discrete Appl. Math. 321, 90--108 (2022; Zbl 07585580) Full Text: DOI arXiv
Basilio, Ludwin A.; Bermudo, Sergio; Leaños, Jesús; Sigarreta, José M. The differential of the line graph \(\mathcal{L} (G)\). (English) Zbl 1497.05198 Discrete Appl. Math. 321, 82-89 (2022). MSC: 05C69 05C76 PDFBibTeX XMLCite \textit{L. A. Basilio} et al., Discrete Appl. Math. 321, 82--89 (2022; Zbl 1497.05198) Full Text: DOI
Akhmejanova, Margarita; Balogh, József; Shabanov, Dmitrii Chain method for panchromatic colorings of hypergraphs. (English) Zbl 1497.05065 Discrete Appl. Math. 321, 72-81 (2022). MSC: 05C15 05C65 05C35 PDFBibTeX XMLCite \textit{M. Akhmejanova} et al., Discrete Appl. Math. 321, 72--81 (2022; Zbl 1497.05065) Full Text: DOI arXiv
Qin, Xiang; Wu, Baoyindureng Decomposition of graphs with constraint on minimum degree. (English) Zbl 1497.05221 Discrete Appl. Math. 321, 64-71 (2022). MSC: 05C70 05C07 05C35 PDFBibTeX XMLCite \textit{X. Qin} and \textit{B. Wu}, Discrete Appl. Math. 321, 64--71 (2022; Zbl 1497.05221) Full Text: DOI
Bagan, Guillaume; Beggas, Fairouz; Haddad, Mohammed; Kheddouci, Hamamache Complexity of edge monitoring on some graph classes. (English) Zbl 1497.05232 Discrete Appl. Math. 321, 49-63 (2022). MSC: 05C75 05C69 05C85 05C22 68Q25 68Q17 PDFBibTeX XMLCite \textit{G. Bagan} et al., Discrete Appl. Math. 321, 49--63 (2022; Zbl 1497.05232) Full Text: DOI arXiv
Chen, Ye; Fan, Suohai; Lai, Hong-Jian; Xu, Murong Graph \(r\)-hued colorings – a survey. (English) Zbl 1497.05073 Discrete Appl. Math. 321, 24-48 (2022). MSC: 05C15 05-02 05C12 PDFBibTeX XMLCite \textit{Y. Chen} et al., Discrete Appl. Math. 321, 24--48 (2022; Zbl 1497.05073) Full Text: DOI
Chen, Min-Jen; Chao, Kun-Mao Proof of a conjecture about minimum spanning tree cycle intersection. (English) Zbl 1497.05035 Discrete Appl. Math. 321, 19-23 (2022). MSC: 05C05 05C35 05C38 PDFBibTeX XMLCite \textit{M.-J. Chen} and \textit{K.-M. Chao}, Discrete Appl. Math. 321, 19--23 (2022; Zbl 1497.05035) Full Text: DOI
Liu, Xuemei; Meng, Jixiang; Tian, Yingzhi On forcibly \(k\)-connected and forcibly \(k\)-arc-connected digraphic sequences. (English) Zbl 1497.05105 Discrete Appl. Math. 321, 10-18 (2022). MSC: 05C20 05C40 PDFBibTeX XMLCite \textit{X. Liu} et al., Discrete Appl. Math. 321, 10--18 (2022; Zbl 1497.05105) Full Text: DOI
Hurlbert, Glenn; Kamat, Vikram On intersecting families of independent sets in trees. (English) Zbl 1497.05254 Discrete Appl. Math. 321, 4-9 (2022). MSC: 05D05 05C05 05C69 PDFBibTeX XMLCite \textit{G. Hurlbert} and \textit{V. Kamat}, Discrete Appl. Math. 321, 4--9 (2022; Zbl 1497.05254) Full Text: DOI arXiv
Katona, Gyula O. H. A generalization of the independence number. (English) Zbl 1497.05207 Discrete Appl. Math. 321, 1-3 (2022). MSC: 05C69 PDFBibTeX XMLCite \textit{G. O. H. Katona}, Discrete Appl. Math. 321, 1--3 (2022; Zbl 1497.05207) Full Text: DOI