Agrawal, Akanksha; Fernau, Henning; Kindermann, Philipp; Mann, Kevin; Souza, Uéverton S. Recognizing well-dominated graphs is coNP-complete. (English) Zbl 07749680 Inf. Process. Lett. 183, Article ID 106419, 6 p. (2024). MSC: 05C69 68R10 68Q25 05C85 PDFBibTeX XMLCite \textit{A. Agrawal} et al., Inf. Process. Lett. 183, Article ID 106419, 6 p. (2024; Zbl 07749680) Full Text: DOI arXiv
Hakim, Sheikh Azizul; Papan, Bishal Basak; Rahman, Md. Saidur New results on pairwise compatibility graphs. (English) Zbl 07581522 Inf. Process. Lett. 178, Article ID 106284, 7 p. (2022). MSC: 68Qxx PDFBibTeX XMLCite \textit{S. A. Hakim} et al., Inf. Process. Lett. 178, Article ID 106284, 7 p. (2022; Zbl 07581522) Full Text: DOI arXiv
Jacques, Fabien On the chromatic numbers of signed triangular and hexagonal grids. (English) Zbl 1478.05054 Inf. Process. Lett. 172, Article ID 106156, 5 p. (2021). Reviewer: Hong-Jian Lai (Morgantown) MSC: 05C15 05C22 PDFBibTeX XMLCite \textit{F. Jacques}, Inf. Process. Lett. 172, Article ID 106156, 5 p. (2021; Zbl 1478.05054) Full Text: DOI arXiv
De Carufel, Jean-Lou; Kaykobad, Tanvir Transforming plane triangulations by simultaneous diagonal flips. (English) Zbl 1516.68103 Inf. Process. Lett. 170, Article ID 106120, 6 p. (2021). MSC: 68U05 05C85 68R05 68R10 68W40 PDFBibTeX XMLCite \textit{J.-L. De Carufel} and \textit{T. Kaykobad}, Inf. Process. Lett. 170, Article ID 106120, 6 p. (2021; Zbl 1516.68103) Full Text: DOI Link
Oropeza, Marcos; Tóth, Csaba D. Reconstruction of the crossing type of a point set from the compatible exchange graph of noncrossing spanning trees. (English) Zbl 1519.68303 Inf. Process. Lett. 170, Article ID 106116, 8 p. (2021). MSC: 68U05 05C62 68R10 PDFBibTeX XMLCite \textit{M. Oropeza} and \textit{C. D. Tóth}, Inf. Process. Lett. 170, Article ID 106116, 8 p. (2021; Zbl 1519.68303) Full Text: DOI
Konstantinova, Elena V.; Medvedev, Alexey N. Small cycles, generalized prisms and Hamiltonian cycles in the bubble-sort graph. (English) Zbl 1512.05248 Inf. Process. Lett. 168, Article ID 106094, 9 p. (2021). Reviewer: Hang Lau (Montréal) MSC: 05C45 05C25 PDFBibTeX XMLCite \textit{E. V. Konstantinova} and \textit{A. N. Medvedev}, Inf. Process. Lett. 168, Article ID 106094, 9 p. (2021; Zbl 1512.05248) Full Text: DOI arXiv
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Minimal 2-connected graphs satisfying the even cut condition. (English) Zbl 1512.05239 Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021). MSC: 05C40 05C82 05C35 05C70 68R10 PDFBibTeX XMLCite \textit{A. S. Jobson} et al., Inf. Process. Lett. 167, Article ID 106080, 7 p. (2021; Zbl 1512.05239) Full Text: DOI
Abam, Mohammad Ali; Rezaei Seraji, Mohammad Javad Geodesic spanners for points in \(\mathbb{R}^3\) amid axis-parallel boxes. (English) Zbl 1506.68168 Inf. Process. Lett. 166, Article ID 106063, 6 p. (2021). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{M. A. Abam} and \textit{M. J. Rezaei Seraji}, Inf. Process. Lett. 166, Article ID 106063, 6 p. (2021; Zbl 1506.68168) Full Text: DOI arXiv
Wang, Maoqun; Qian, Jianguo An Ore-type condition for the existence of two disjoint cycles. (English) Zbl 1447.05115 Inf. Process. Lett. 159-160, Article ID 105957, 5 p. (2020). MSC: 05C38 05C85 05C45 PDFBibTeX XMLCite \textit{M. Wang} and \textit{J. Qian}, Inf. Process. Lett. 159--160, Article ID 105957, 5 p. (2020; Zbl 1447.05115) Full Text: DOI arXiv
Severín, Daniel On the additive chromatic number of several families of graphs. (English) Zbl 1436.05041 Inf. Process. Lett. 158, Article ID 105937, 5 p. (2020). MSC: 05C15 05C75 05C85 05C78 PDFBibTeX XMLCite \textit{D. Severín}, Inf. Process. Lett. 158, Article ID 105937, 5 p. (2020; Zbl 1436.05041) Full Text: DOI arXiv
Mafort, Rodrigo Lamblet; Protti, Fábio Vector domination in split-indifference graphs. (English) Zbl 1481.05117 Inf. Process. Lett. 155, Article ID 105899, 6 p. (2020). MSC: 05C69 05C85 PDFBibTeX XMLCite \textit{R. L. Mafort} and \textit{F. Protti}, Inf. Process. Lett. 155, Article ID 105899, 6 p. (2020; Zbl 1481.05117) Full Text: DOI
Henning, Michael A.; Pal, Saikat; Pradhan, D. Algorithm and hardness results on hop domination in graphs. (English) Zbl 1481.05116 Inf. Process. Lett. 153, Article ID 105872, 8 p. (2020). MSC: 05C69 05C85 68Q17 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Inf. Process. Lett. 153, Article ID 105872, 8 p. (2020; Zbl 1481.05116) Full Text: DOI
Abu-Affash, A. Karim; Bhore, Sujoy; Carmi, Paz Monochromatic plane matchings in bicolored point set. (English) Zbl 1478.68418 Inf. Process. Lett. 153, Article ID 105860, 6 p. (2020). MSC: 68U05 05C70 68R10 68W25 PDFBibTeX XMLCite \textit{A. K. Abu-Affash} et al., Inf. Process. Lett. 153, Article ID 105860, 6 p. (2020; Zbl 1478.68418) Full Text: DOI
Zhou, Sizhong; Xu, Yang; Sun, Zhiren Degree conditions for fractional \((a,b,k)\)-critical covered graphs. (English) Zbl 1481.05132 Inf. Process. Lett. 152, Article ID 105838, 5 p. (2019). MSC: 05C72 05C70 PDFBibTeX XMLCite \textit{S. Zhou} et al., Inf. Process. Lett. 152, Article ID 105838, 5 p. (2019; Zbl 1481.05132) Full Text: DOI
Fürst, M. On the hardness of deciding the equality of the induced and the uniquely restricted matching number. (English) Zbl 1473.05291 Inf. Process. Lett. 147, 77-81 (2019). MSC: 05C85 05C70 68Q17 PDFBibTeX XMLCite \textit{M. Fürst}, Inf. Process. Lett. 147, 77--81 (2019; Zbl 1473.05291) Full Text: DOI arXiv
Galby, Esther; Lima, Paloma T.; Paulusma, Daniël; Ries, Bernard Classifying \(k\)-edge colouring for \(H\)-free graphs. (English) Zbl 1481.05045 Inf. Process. Lett. 146, 39-43 (2019). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{E. Galby} et al., Inf. Process. Lett. 146, 39--43 (2019; Zbl 1481.05045) Full Text: DOI arXiv
Yuan, Yuan; Hao, Rong-Xia A degree condition for fractional \([a,b]\)-covered graphs. (English) Zbl 1481.05131 Inf. Process. Lett. 143, 20-23 (2019). MSC: 05C72 05C70 PDFBibTeX XMLCite \textit{Y. Yuan} and \textit{R.-X. Hao}, Inf. Process. Lett. 143, 20--23 (2019; Zbl 1481.05131) Full Text: DOI
Chaplick, Steven; Fürst, Maximilian; Maffray, Frédéric; Rautenbach, Dieter On some graphs with a unique perfect matching. (English) Zbl 1481.05125 Inf. Process. Lett. 139, 60-63 (2018). MSC: 05C70 05C85 PDFBibTeX XMLCite \textit{S. Chaplick} et al., Inf. Process. Lett. 139, 60--63 (2018; Zbl 1481.05125) Full Text: DOI arXiv
Brandenburg, Franz J. On fan-crossing and fan-crossing free graphs. (English) Zbl 1458.68139 Inf. Process. Lett. 138, 67-71 (2018). MSC: 68R10 05C62 68U05 PDFBibTeX XMLCite \textit{F. J. Brandenburg}, Inf. Process. Lett. 138, 67--71 (2018; Zbl 1458.68139) Full Text: DOI
Yan, Jin; Zhang, Shaohua; Ren, Yanyan; Cai, Junqing Degree sum conditions on two disjoint cycles in graphs. (English) Zbl 1391.05088 Inf. Process. Lett. 138, 7-11 (2018). MSC: 05C07 05C38 05C85 PDFBibTeX XMLCite \textit{J. Yan} et al., Inf. Process. Lett. 138, 7--11 (2018; Zbl 1391.05088) Full Text: DOI
Jobson, Adam S.; Kézdy, André E.; Lehel, Jenő Linkage on the infinite grid. (English) Zbl 1478.68246 Inf. Process. Lett. 137, 51-56 (2018). MSC: 68R10 PDFBibTeX XMLCite \textit{A. S. Jobson} et al., Inf. Process. Lett. 137, 51--56 (2018; Zbl 1478.68246) Full Text: DOI
Kochol, Martin Three colorability characterized by shrinking of locally connected subgraphs into triangles. (English) Zbl 1476.05057 Inf. Process. Lett. 135, 33-35 (2018). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{M. Kochol}, Inf. Process. Lett. 135, 33--35 (2018; Zbl 1476.05057) Full Text: DOI
Aichholzer, Oswin; Atienza, Nieves; Díaz-Báñez, José M.; Fabila-Monroy, Ruy; Flores-Peñaloza, David; Pérez-Lantero, Pablo; Vogtenhuber, Birgit; Urrutia, Jorge Computing balanced islands in two colored point sets in the plane. (English) Zbl 1476.68264 Inf. Process. Lett. 135, 28-32 (2018). MSC: 68U05 52B55 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Inf. Process. Lett. 135, 28--32 (2018; Zbl 1476.68264) Full Text: DOI arXiv
Cai, Junqing; Li, Hao; Zhang, Yuzhong An implicit degree condition for \(k\)-connected 2-heavy graphs to be Hamiltonian. (English) Zbl 1476.05100 Inf. Process. Lett. 134, 9-13 (2018). MSC: 05C45 05C07 05C40 PDFBibTeX XMLCite \textit{J. Cai} et al., Inf. Process. Lett. 134, 9--13 (2018; Zbl 1476.05100) Full Text: DOI
Lin, Min Chih; Mestre, Julián; Vasiliev, Saveliy Approximating weighted neighborhood independent sets. (English) Zbl 1419.68217 Inf. Process. Lett. 130, 11-15 (2018). MSC: 68W25 05C69 05C85 68Q25 PDFBibTeX XMLCite \textit{M. C. Lin} et al., Inf. Process. Lett. 130, 11--15 (2018; Zbl 1419.68217) Full Text: DOI
Huang, Xing An implicit degree sum condition for cycles through specified vertices. (English) Zbl 1420.05038 Inf. Process. Lett. 129, 40-43 (2018). MSC: 05C07 05C38 PDFBibTeX XMLCite \textit{X. Huang}, Inf. Process. Lett. 129, 40--43 (2018; Zbl 1420.05038) Full Text: DOI
Brand, Michael Small polyomino packing. (English) Zbl 1407.68208 Inf. Process. Lett. 126, 30-34 (2017). MSC: 68Q25 05B40 05B50 68Q17 68U05 PDFBibTeX XMLCite \textit{M. Brand}, Inf. Process. Lett. 126, 30--34 (2017; Zbl 1407.68208) Full Text: DOI
Brešar, Boštjan; Henning, Michael A. The game total domination problem is log-complete in PSPACE. (English) Zbl 1409.68133 Inf. Process. Lett. 126, 12-17 (2017). MSC: 68Q25 05C57 05C69 68Q17 PDFBibTeX XMLCite \textit{B. Brešar} and \textit{M. A. Henning}, Inf. Process. Lett. 126, 12--17 (2017; Zbl 1409.68133) Full Text: DOI
Wideł, Wojciech Clique-heavy subgraphs and pancyclicity of 2-connected graphs. (English) Zbl 1388.05146 Inf. Process. Lett. 117, 6-9 (2017). MSC: 05C69 05C45 05C40 PDFBibTeX XMLCite \textit{W. Wideł}, Inf. Process. Lett. 117, 6--9 (2017; Zbl 1388.05146) Full Text: DOI
Cai, Junqing; Zhang, Yuzhong Fan-type implicit-heavy subgraphs for Hamiltonicity of implicit claw-heavy graphs. (English) Zbl 1362.05079 Inf. Process. Lett. 116, No. 11, 668-673 (2016). MSC: 05C45 PDFBibTeX XMLCite \textit{J. Cai} and \textit{Y. Zhang}, Inf. Process. Lett. 116, No. 11, 668--673 (2016; Zbl 1362.05079) Full Text: DOI
Dehghan, Ali; Sadeghi, Mohammad-Reza On the algorithmic complexity of zero-sum edge-coloring. (English) Zbl 1362.05047 Inf. Process. Lett. 116, No. 11, 660-667 (2016). MSC: 05C15 05C21 05C85 68Q17 68Q25 PDFBibTeX XMLCite \textit{A. Dehghan} and \textit{M.-R. Sadeghi}, Inf. Process. Lett. 116, No. 11, 660--667 (2016; Zbl 1362.05047) Full Text: DOI
Xu, Jin; Li, Zepeng; Zhu, Enqiang On purely tree-colorable planar graphs. (English) Zbl 1335.05052 Inf. Process. Lett. 116, No. 8, 532-536 (2016). MSC: 05C10 05C15 05C35 05C05 PDFBibTeX XMLCite \textit{J. Xu} et al., Inf. Process. Lett. 116, No. 8, 532--536 (2016; Zbl 1335.05052) Full Text: DOI
Chen, Xie-Bin Hamiltonicity of hypercubes with faulty vertices. (English) Zbl 1352.68194 Inf. Process. Lett. 116, No. 5, 343-346 (2016). MSC: 68R10 05C38 05C45 68M15 PDFBibTeX XMLCite \textit{X.-B. Chen}, Inf. Process. Lett. 116, No. 5, 343--346 (2016; Zbl 1352.68194) Full Text: DOI
Kobayashi, Yuki; Higashikawa, Yuya; Katoh, Naoki; Sljoka, Adnan Characterizing redundant rigidity and redundant global rigidity of body-hinge graphs. (English) Zbl 1347.05110 Inf. Process. Lett. 116, No. 2, 175-178 (2016). MSC: 05C40 05C85 PDFBibTeX XMLCite \textit{Y. Kobayashi} et al., Inf. Process. Lett. 116, No. 2, 175--178 (2016; Zbl 1347.05110) Full Text: DOI
Zhu, Enqiang; Li, Zepeng; Shao, Zehui; Xu, Jin; Liu, Chanjuan Tree-core and tree-coritivity of graphs. (English) Zbl 1329.05068 Inf. Process. Lett. 115, No. 10, 754-759 (2015). MSC: 05C05 05C40 68Q17 PDFBibTeX XMLCite \textit{E. Zhu} et al., Inf. Process. Lett. 115, No. 10, 754--759 (2015; Zbl 1329.05068) Full Text: DOI
Bonomo, Flavia; Duran, Guillermo; Napoli, Amedeo; Valencia-Pabon, Mario A one-to-one correspondence between potential solutions of the cluster deletion problem and the minimum sum coloring problem, and its application to \(P_4\)-sparse graphs. (English) Zbl 1328.68144 Inf. Process. Lett. 115, No. 6-8, 600-603 (2015). MSC: 68R10 05C15 05C85 PDFBibTeX XMLCite \textit{F. Bonomo} et al., Inf. Process. Lett. 115, No. 6--8, 600--603 (2015; Zbl 1328.68144) Full Text: DOI
Zhang, Hailiang; Yu, Guanglong; Li, Shanlin Graphs with six distinct matching roots. (English) Zbl 1309.05103 Inf. Process. Lett. 115, No. 5, 521-526 (2015). MSC: 05C31 05C85 05C70 PDFBibTeX XMLCite \textit{H. Zhang} et al., Inf. Process. Lett. 115, No. 5, 521--526 (2015; Zbl 1309.05103) Full Text: DOI
Dehghan, Ali; Sadeghi, Mohammad-Reza The complexity of the zero-sum 3-flows. (English) Zbl 1305.05093 Inf. Process. Lett. 115, No. 2, 316-320 (2015). MSC: 05C21 68Q17 PDFBibTeX XMLCite \textit{A. Dehghan} and \textit{M.-R. Sadeghi}, Inf. Process. Lett. 115, No. 2, 316--320 (2015; Zbl 1305.05093) Full Text: DOI
Kobayashi, Yasuaki Computing the pathwidth of directed graphs with small vertex cover. (English) Zbl 1304.05061 Inf. Process. Lett. 115, No. 2, 310-312 (2015). MSC: 05C20 05C85 68Q25 90C39 PDFBibTeX XMLCite \textit{Y. Kobayashi}, Inf. Process. Lett. 115, No. 2, 310--312 (2015; Zbl 1304.05061) Full Text: DOI
Chen, Xiang’en; Li, Zepeng Adjacent-vertex-distinguishing proper edge colorings of planar bipartite graphs with \(\Delta=9\), \(10\), or \(11\). (English) Zbl 1304.05023 Inf. Process. Lett. 115, No. 2, 263-268 (2015). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{X. Chen} and \textit{Z. Li}, Inf. Process. Lett. 115, No. 2, 263--268 (2015; Zbl 1304.05023) Full Text: DOI
Janczewski, Robert; Turowski, Krzysztof The computational complexity of the backbone coloring problem for bounded-degree graphs with connected backbones. (English) Zbl 1304.05045 Inf. Process. Lett. 115, No. 2, 232-236 (2015). MSC: 05C15 05C07 05C85 68Q17 PDFBibTeX XMLCite \textit{R. Janczewski} and \textit{K. Turowski}, Inf. Process. Lett. 115, No. 2, 232--236 (2015; Zbl 1304.05045) Full Text: DOI
Cai, Junqing A sufficient condition involving implicit degree and neighborhood intersection for long cycles. (English) Zbl 1304.05080 Inf. Process. Lett. 115, No. 2, 225-227 (2015). MSC: 05C38 05C07 05C40 05C12 PDFBibTeX XMLCite \textit{J. Cai}, Inf. Process. Lett. 115, No. 2, 225--227 (2015; Zbl 1304.05080) Full Text: DOI
Lien, Min-Yun; Kuo, Jyhmin; Fu, Hung-Lin On the decycling number of generalized Kautz digraphs. (English) Zbl 1304.05062 Inf. Process. Lett. 115, No. 2, 209-211 (2015). MSC: 05C20 05C82 PDFBibTeX XMLCite \textit{M.-Y. Lien} et al., Inf. Process. Lett. 115, No. 2, 209--211 (2015; Zbl 1304.05062) Full Text: DOI
Demange, Marc; Ekim, Tınaz Efficient recognition of equimatchable graphs. (English) Zbl 1329.05243 Inf. Process. Lett. 114, No. 1-2, 66-71 (2014). MSC: 05C70 05C85 05C69 PDFBibTeX XMLCite \textit{M. Demange} and \textit{T. Ekim}, Inf. Process. Lett. 114, No. 1--2, 66--71 (2014; Zbl 1329.05243) Full Text: DOI
Garijo, D.; Garrido, M. A.; Grima, C. I.; Márquez, A.; Moreno-González, A.; Portillo, J. R.; Reyes, P.; Robles, R.; Valenzuela, J. Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points. (English) Zbl 1329.68264 Inf. Process. Lett. 114, No. 1-2, 19-24 (2014). MSC: 68U05 PDFBibTeX XMLCite \textit{D. Garijo} et al., Inf. Process. Lett. 114, No. 1--2, 19--24 (2014; Zbl 1329.68264) Full Text: DOI
Huang, Xing Hamilton cycles in implicit claw-heavy graphs. (English) Zbl 1358.05169 Inf. Process. Lett. 114, No. 12, 676-679 (2014). MSC: 05C45 05C38 05C07 PDFBibTeX XMLCite \textit{X. Huang}, Inf. Process. Lett. 114, No. 12, 676--679 (2014; Zbl 1358.05169) Full Text: DOI
Liu, Xiaoping; Dang, Zhilan; Wu, Baoyindureng The hub number, girth and Mycielski graphs. (English) Zbl 1371.05218 Inf. Process. Lett. 114, No. 10, 561-563 (2014). MSC: 05C69 PDFBibTeX XMLCite \textit{X. Liu} et al., Inf. Process. Lett. 114, No. 10, 561--563 (2014; Zbl 1371.05218) Full Text: DOI
Wang, Huijuan; Wu, Jianliang; Liu, Bin; Chen, Hongyu On the linear arboricity of graphs embeddable in surfaces. (English) Zbl 1294.05129 Inf. Process. Lett. 114, No. 9, 475-479 (2014). MSC: 05C70 05C05 05C35 05C60 PDFBibTeX XMLCite \textit{H. Wang} et al., Inf. Process. Lett. 114, No. 9, 475--479 (2014; Zbl 1294.05129) Full Text: DOI
Ning, Bo Fan-type degree condition restricted to triples of induced subgraphs ensuring Hamiltonicity. (English) Zbl 1284.05158 Inf. Process. Lett. 113, No. 19-21, 823-826 (2013). MSC: 05C45 05C30 05C40 PDFBibTeX XMLCite \textit{B. Ning}, Inf. Process. Lett. 113, No. 19--21, 823--826 (2013; Zbl 1284.05158) Full Text: DOI arXiv
Dankelmann, Peter; Erwin, David; Goddard, Wayne; Mukwembi, Simon; Swart, Henda C. Eccentric counts, connectivity and chordality. (English) Zbl 1259.05053 Inf. Process. Lett. 112, No. 24, 944-947 (2012). MSC: 05C12 05C40 PDFBibTeX XMLCite \textit{P. Dankelmann} et al., Inf. Process. Lett. 112, No. 24, 944--947 (2012; Zbl 1259.05053) Full Text: DOI
Su, Hsun; Shih, Yuan-Kang; Kao, Shin-Shin On the 1-fault Hamiltonicity for graphs satisfying Ore’s theorem. (English) Zbl 1248.05110 Inf. Process. Lett. 112, No. 21, 839-843 (2012). MSC: 05C45 05C07 05C38 PDFBibTeX XMLCite \textit{H. Su} et al., Inf. Process. Lett. 112, No. 21, 839--843 (2012; Zbl 1248.05110) Full Text: DOI
Chen, Hong-Yu; Qi, Jian-Ming The linear arboricity of planar graphs with maximum degree at least 5. (English) Zbl 1248.05043 Inf. Process. Lett. 112, No. 20, 767-771 (2012). MSC: 05C10 05C38 PDFBibTeX XMLCite \textit{H.-Y. Chen} and \textit{J.-M. Qi}, Inf. Process. Lett. 112, No. 20, 767--771 (2012; Zbl 1248.05043) Full Text: DOI
Ma, Beibei; Wu, Baoyindureng; Zhang, Wanping Proximity and average eccentricity of a graph. (English) Zbl 1243.05073 Inf. Process. Lett. 112, No. 10, 392-395 (2012). MSC: 05C12 05C35 05C40 05C85 PDFBibTeX XMLCite \textit{B. Ma} et al., Inf. Process. Lett. 112, No. 10, 392--395 (2012; Zbl 1243.05073) Full Text: DOI
Guttmann-Beck, Nili; Hassin, Refael Series-parallel orientations preserving the cycle-radius. (English) Zbl 1239.05054 Inf. Process. Lett. 112, No. 4, 153-160 (2012). MSC: 05C12 05C85 05C20 PDFBibTeX XMLCite \textit{N. Guttmann-Beck} and \textit{R. Hassin}, Inf. Process. Lett. 112, No. 4, 153--160 (2012; Zbl 1239.05054) Full Text: DOI
Zhang, Xin; Liu, Guizhen On edge colorings of 1-planar graphs without adjacent triangles. (English) Zbl 1239.05078 Inf. Process. Lett. 112, No. 4, 138-142 (2012). MSC: 05C15 05C07 05C10 PDFBibTeX XMLCite \textit{X. Zhang} and \textit{G. Liu}, Inf. Process. Lett. 112, No. 4, 138--142 (2012; Zbl 1239.05078) Full Text: DOI
Brandstädt, Andreas; Giakoumakis, Vassilis Maximum weight independent sets in hole- and co-chair-free graphs. (English) Zbl 1233.68139 Inf. Process. Lett. 112, No. 3, 67-71 (2012); addendum ibid. 115, No. 2, 345-350 (2015). MSC: 68Q17 05C69 05C85 PDFBibTeX XMLCite \textit{A. Brandstädt} and \textit{V. Giakoumakis}, Inf. Process. Lett. 112, No. 3, 67--71 (2012; Zbl 1233.68139) Full Text: DOI
Gu, Xiaofeng; Lai, Hong-Jian; Yao, Senmei Characterization of minimally \((2,l)\)-connected graphs. (English) Zbl 1260.05087 Inf. Process. Lett. 111, No. 23-24, 1124-1129 (2011). MSC: 05C40 05C35 PDFBibTeX XMLCite \textit{X. Gu} et al., Inf. Process. Lett. 111, No. 23--24, 1124--1129 (2011; Zbl 1260.05087) Full Text: DOI
Fan, Hao; Kierstead, H. A.; Liu, Guizhen; Molla, Theodore; Wu, Jian-Liang; Zhang, Xin A note on relaxed equitable coloring of graphs. (English) Zbl 1260.05057 Inf. Process. Lett. 111, No. 21-22, 1062-1066 (2011). MSC: 05C15 05C85 PDFBibTeX XMLCite \textit{H. Fan} et al., Inf. Process. Lett. 111, No. 21--22, 1062--1066 (2011; Zbl 1260.05057) Full Text: DOI
Cao, Xiang-Lan; Brglez, Špela; Špacapan, Simon; Vumar, Elkin On edge connectivity of direct products of graphs. (English) Zbl 1260.05085 Inf. Process. Lett. 111, No. 18, 899-902 (2011). MSC: 05C40 05C76 PDFBibTeX XMLCite \textit{X.-L. Cao} et al., Inf. Process. Lett. 111, No. 18, 899--902 (2011; Zbl 1260.05085) Full Text: DOI
Policriti, Alberto; Tomescu, Alexandru I. Counting extensional acyclic digraphs. (English) Zbl 1260.05077 Inf. Process. Lett. 111, No. 16, 787-791 (2011). MSC: 05C30 05C20 PDFBibTeX XMLCite \textit{A. Policriti} and \textit{A. I. Tomescu}, Inf. Process. Lett. 111, No. 16, 787--791 (2011; Zbl 1260.05077) 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 PDFBibTeX XMLCite \textit{Q. Wu} et al., Inf. Process. Lett. 111, No. 15, 767--772 (2011; Zbl 1260.05065) Full Text: DOI
Chen, Xie-Bin Parallel construction of optimal independent spanning trees on Cartesian product of complete graphs. (English) Zbl 1260.68293 Inf. Process. Lett. 111, No. 5, 235-238 (2011). MSC: 68R10 05C85 05C76 PDFBibTeX XMLCite \textit{X.-B. Chen}, Inf. Process. Lett. 111, No. 5, 235--238 (2011; Zbl 1260.68293) Full Text: DOI
Zhang, Xin; Wu, Jian-Liang On edge colorings of \(1\)-planar graphs. (English) Zbl 1259.05050 Inf. Process. Lett. 111, No. 3, 124-128 (2011). MSC: 05C10 05C15 05C62 PDFBibTeX XMLCite \textit{X. Zhang} and \textit{J.-L. Wu}, Inf. Process. Lett. 111, No. 3, 124--128 (2011; Zbl 1259.05050) Full Text: DOI
Zhou, Sizhong; Jiang, Jiashang Toughness and \((a,b,k)\)-critical graphs. (English) Zbl 1260.68310 Inf. Process. Lett. 111, No. 9, 403-407 (2011). MSC: 68R10 PDFBibTeX XMLCite \textit{S. Zhou} and \textit{J. Jiang}, Inf. Process. Lett. 111, No. 9, 403--407 (2011; Zbl 1260.68310) Full Text: DOI
Das, Anita; Francis, Mathew C.; Mathew, Rogers; Sadagopan, N. Non-contractible non-edges in 2-connected graphs. (English) Zbl 1379.05067 Inf. Process. Lett. 110, No. 23, 1044-1048 (2010). MSC: 05C40 PDFBibTeX XMLCite \textit{A. Das} et al., Inf. Process. Lett. 110, No. 23, 1044--1048 (2010; Zbl 1379.05067) Full Text: DOI
Zhou, Jin-Xin; Feng, Yan-Quan Super-connected but not super edge-connected graphs. (English) Zbl 1259.05105 Inf. Process. Lett. 111, No. 1, 22-25 (2010). MSC: 05C40 PDFBibTeX XMLCite \textit{J.-X. Zhou} and \textit{Y.-Q. Feng}, Inf. Process. Lett. 111, No. 1, 22--25 (2010; Zbl 1259.05105) 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 PDFBibTeX XMLCite \textit{G. J. Chang} et al., Inf. Process. Lett. 110, No. 20, 849--853 (2010; Zbl 1234.05081) Full Text: DOI Link
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 PDFBibTeX XMLCite \textit{J. Zhang} and \textit{Y. Wang}, Inf. Process. Lett. 110, No. 18--19, 830--834 (2010; Zbl 1234.05108) Full Text: DOI
Rackham, Tom The complexity of changing colourings with bounded maximum degree. (English) Zbl 1234.68140 Inf. Process. Lett. 110, No. 17, 735-739 (2010). MSC: 68Q17 05C15 05C85 PDFBibTeX XMLCite \textit{T. Rackham}, Inf. Process. Lett. 110, No. 17, 735--739 (2010; Zbl 1234.68140) Full Text: DOI
Vallée, Thierry Normal Eulerian clique-covering and hamiltonicity. (English) Zbl 1233.05161 Inf. Process. Lett. 110, No. 16, 697-701 (2010). MSC: 05C70 05C69 05C45 PDFBibTeX XMLCite \textit{T. Vallée}, Inf. Process. Lett. 110, No. 16, 697--701 (2010; Zbl 1233.05161) Full Text: DOI
Bagheri, Alireza; Razzazi, Mohammadreza Planar straight-line point-set embedding of trees with partial embeddings. (English) Zbl 1233.68137 Inf. Process. Lett. 110, No. 12-13, 521-523 (2010). MSC: 68Q17 68U05 68R10 PDFBibTeX XMLCite \textit{A. Bagheri} and \textit{M. Razzazi}, Inf. Process. Lett. 110, No. 12--13, 521--523 (2010; Zbl 1233.68137) Full Text: DOI
Lin, Jia-Cian; Yang, Jinn-Shyong; Hsu, Chiun-Chieh; Chang, Jou-Ming Independent spanning trees vs. edge-disjoint spanning trees in locally twisted cubes. (English) Zbl 1229.68057 Inf. Process. Lett. 110, No. 10, 414-419 (2010). MSC: 68R10 05C05 68M15 05C69 05C85 PDFBibTeX XMLCite \textit{J.-C. Lin} et al., Inf. Process. Lett. 110, No. 10, 414--419 (2010; Zbl 1229.68057) Full Text: DOI
Roussel, Nicolas; Zhu, Xuding Total coloring of planar graphs of maximum degree eight. (English) Zbl 1197.05057 Inf. Process. Lett. 110, No. 8-9, 321-324 (2010). MSC: 05C15 05C10 05C35 PDFBibTeX XMLCite \textit{N. Roussel} and \textit{X. Zhu}, Inf. Process. Lett. 110, No. 8--9, 321--324 (2010; Zbl 1197.05057) Full Text: DOI
Bretto, Alain; Vallée, Thierry A clique-covering sufficient condition for hamiltonicity of graphs. (English) Zbl 1197.05083 Inf. Process. Lett. 109, No. 20, 1156-1160 (2009). MSC: 05C45 05C69 05C70 05C85 PDFBibTeX XMLCite \textit{A. Bretto} and \textit{T. Vallée}, Inf. Process. Lett. 109, No. 20, 1156--1160 (2009; Zbl 1197.05083) Full Text: DOI HAL
Liu, Juan; Chen, Xing; Meng, Jixiang Super restricted edge connected Cartesian product graphs. (English) Zbl 1197.05082 Inf. Process. Lett. 109, No. 13, 655-659 (2009). MSC: 05C40 05C76 68R10 PDFBibTeX XMLCite \textit{J. Liu} et al., Inf. Process. Lett. 109, No. 13, 655--659 (2009; Zbl 1197.05082) Full Text: DOI
Chen, Meirun; Guo, Xiaofeng Adjacent vertex-distinguishing edge and total chromatic numbers of hypercubes. (English) Zbl 1197.05045 Inf. Process. Lett. 109, No. 12, 599-602 (2009). MSC: 05C15 68M10 68R10 PDFBibTeX XMLCite \textit{M. Chen} and \textit{X. Guo}, Inf. Process. Lett. 109, No. 12, 599--602 (2009; Zbl 1197.05045) Full Text: DOI
Esperet, Louis; Labourel, Arnaud; Ochem, Pascal On induced-universal graphs for the class of bounded-degree graphs. (English) Zbl 1189.05162 Inf. Process. Lett. 108, No. 5, 255-260 (2008). MSC: 05C85 05C35 PDFBibTeX XMLCite \textit{L. Esperet} et al., Inf. Process. Lett. 108, No. 5, 255--260 (2008; Zbl 1189.05162) Full Text: DOI HAL
Czerwiński, Sebastian; Grytczuk, Jarosław Invisible runners in finite fields. (English) Zbl 1191.68448 Inf. Process. Lett. 108, No. 2, 64-67 (2008). MSC: 05C15 11B50 68R05 68R10 PDFBibTeX XMLCite \textit{S. Czerwiński} and \textit{J. Grytczuk}, Inf. Process. Lett. 108, No. 2, 64--67 (2008; Zbl 1191.68448) Full Text: DOI
Akl, Selim G.; Islam, Md. Kamrul; Meijer, Henk On planar path transformation. (English) Zbl 1184.68551 Inf. Process. Lett. 104, No. 2, 59-64 (2007). MSC: 68U05 PDFBibTeX XMLCite \textit{S. G. Akl} et al., Inf. Process. Lett. 104, No. 2, 59--64 (2007; Zbl 1184.68551) Full Text: DOI
Sidorowicz, Elẓbieta The game chromatic number and the game colouring number of cactuses. (English) Zbl 1185.91058 Inf. Process. Lett. 102, No. 4, 147-151 (2007). MSC: 91A43 05C57 05C15 PDFBibTeX XMLCite \textit{E. Sidorowicz}, Inf. Process. Lett. 102, No. 4, 147--151 (2007; Zbl 1185.91058) Full Text: DOI
Honkala, Iiro; Laihonen, Tero On a new class of identifying codes in graphs. (English) Zbl 1185.05053 Inf. Process. Lett. 102, No. 2-3, 92-98 (2007). MSC: 05C12 94B60 05C90 68R10 68M15 PDFBibTeX XMLCite \textit{I. Honkala} and \textit{T. Laihonen}, Inf. Process. Lett. 102, No. 2--3, 92--98 (2007; Zbl 1185.05053) Full Text: DOI
Tzeng, Chi-Hung; Jiang, Jehn-Ruey; Huang, Shing-Tsaan A self-stabilizing \((\Delta +4)\)-edge-coloring algorithm for planar graphs in anonymous uniform systems. (English) Zbl 1185.68078 Inf. Process. Lett. 101, No. 4, 168-173 (2007). MSC: 68M14 68R10 PDFBibTeX XMLCite \textit{C.-H. Tzeng} et al., Inf. Process. Lett. 101, No. 4, 168--173 (2007; Zbl 1185.68078) Full Text: DOI
Bornstein, Claudson; de Figueiredo, Celina M. H.; de Sá, Vinícius G. P. The pair completion algorithm for the homogeneous set sandwich problem. (English) Zbl 1186.68329 Inf. Process. Lett. 98, No. 3, 87-91 (2006). MSC: 68R10 05C85 68W40 PDFBibTeX XMLCite \textit{C. Bornstein} et al., Inf. Process. Lett. 98, No. 3, 87--91 (2006; Zbl 1186.68329) Full Text: DOI
Capponi, Agostino; Pilotto, Concetta Bounded families for the on-line \(t\)-relaxed coloring. (English) Zbl 1184.68650 Inf. Process. Lett. 96, No. 4, 141-145 (2005). MSC: 68W27 68R05 PDFBibTeX XMLCite \textit{A. Capponi} and \textit{C. Pilotto}, Inf. Process. Lett. 96, No. 4, 141--145 (2005; Zbl 1184.68650) Full Text: DOI
Nikolopoulos, S. D.; Nomikos, C.; Rondogiannis, P. A limit characterization for the number of spanning trees of graphs. (English) Zbl 1171.05344 Inf. Process. Lett. 90, No. 6, 307-313 (2004). MSC: 05C30 05C05 68R10 PDFBibTeX XMLCite \textit{S. D. Nikolopoulos} et al., Inf. Process. Lett. 90, No. 6, 307--313 (2004; Zbl 1171.05344) Full Text: DOI
Chandran, L. Sunil Minimum cuts, girth and a spectral threshold. (English) Zbl 1183.68413 Inf. Process. Lett. 89, No. 3, 105-110 (2004). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{L. S. Chandran}, Inf. Process. Lett. 89, No. 3, 105--110 (2004; Zbl 1183.68413) Full Text: DOI
Honkala, Iiro; Laihonen, Tero On identifying codes in the hexagonal mesh. (English) Zbl 1178.68244 Inf. Process. Lett. 89, No. 1, 9-14 (2004). MSC: 68P30 68M15 68R05 PDFBibTeX XMLCite \textit{I. Honkala} and \textit{T. Laihonen}, Inf. Process. Lett. 89, No. 1, 9--14 (2004; Zbl 1178.68244) Full Text: DOI
Chandran, L. Sunil; Subramanian, C. R. A spectral lower bound for the treewidth of a graph and its consequences. (English) Zbl 1161.68647 Inf. Process. Lett. 87, No. 4, 195-200 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{L. S. Chandran} and \textit{C. R. Subramanian}, Inf. Process. Lett. 87, No. 4, 195--200 (2003; Zbl 1161.68647) Full Text: DOI
de Werra, D.; Hansen, P. Using stable sets to bound the chromatic number. (English) Zbl 1161.68704 Inf. Process. Lett. 87, No. 3, 127-131 (2003). MSC: 68R10 PDFBibTeX XMLCite \textit{D. de Werra} and \textit{P. Hansen}, Inf. Process. Lett. 87, No. 3, 127--131 (2003; Zbl 1161.68704) Full Text: DOI
Královič, Rastislav; Ružička, Peter Minimum feedback vertex sets in shuffle-based interconnection networks. (English) Zbl 1173.68590 Inf. Process. Lett. 86, No. 4, 191-196 (2003). MSC: 68R05 PDFBibTeX XMLCite \textit{R. Královič} and \textit{P. Ružička}, Inf. Process. Lett. 86, No. 4, 191--196 (2003; Zbl 1173.68590) Full Text: DOI
Szabó, Tibor On the spectrum of projective norm-graphs. (English) Zbl 1173.68613 Inf. Process. Lett. 86, No. 2, 71-74 (2003). MSC: 68R10 68R05 PDFBibTeX XMLCite \textit{T. Szabó}, Inf. Process. Lett. 86, No. 2, 71--74 (2003; Zbl 1173.68613) Full Text: DOI
Kawano, Sinichiro; Yamazaki, Koichi Worst case analysis of a greedy algorithm for graph thickness. (English) Zbl 1173.68824 Inf. Process. Lett. 85, No. 6, 333-337 (2003). MSC: 68W05 68R10 PDFBibTeX XMLCite \textit{S. Kawano} and \textit{K. Yamazaki}, Inf. Process. Lett. 85, No. 6, 333--337 (2003; Zbl 1173.68824) Full Text: DOI
Fomin, Fedor V.; Kratsch, Dieter; Novelli, Jean-Christophe Approximating minimum cocolorings. (English) Zbl 1042.68091 Inf. Process. Lett. 84, No. 5, 285-290 (2002). MSC: 68R10 68W05 PDFBibTeX XMLCite \textit{F. V. Fomin} et al., Inf. Process. Lett. 84, No. 5, 285--290 (2002; Zbl 1042.68091) Full Text: DOI
Fouquet, Jean-Luc No odd pairs in minimal imperfect NP\({}_{5}\) graphs. (English) Zbl 1043.05055 Inf. Process. Lett. 83, No. 4, 201-204 (2002). MSC: 05C17 68R10 68W05 PDFBibTeX XMLCite \textit{J.-L. Fouquet}, Inf. Process. Lett. 83, No. 4, 201--204 (2002; Zbl 1043.05055) Full Text: DOI
Iwasaki, Yukihiro; Kajiwara, Yuka; Obokata, Koji; Igarashi, Yoshihide Independent spanning trees of chordal rings. (English) Zbl 1338.68220 Inf. Process. Lett. 69, No. 3, 155-160 (1999). MSC: 68R10 68M15 PDFBibTeX XMLCite \textit{Y. Iwasaki} et al., Inf. Process. Lett. 69, No. 3, 155--160 (1999; Zbl 1338.68220) Full Text: DOI Link
Cerioli, Márcia R.; Everett, Hazel; de Figueiredo, Celina M. H.; Klein, Sulamita The homogeneous set sandwich problem. (English) Zbl 1339.05382 Inf. Process. Lett. 67, No. 1, 31-35 (1998). MSC: 05C85 68Q25 PDFBibTeX XMLCite \textit{M. R. Cerioli} et al., Inf. Process. Lett. 67, No. 1, 31--35 (1998; Zbl 1339.05382) Full Text: DOI Link
Wang, Jeng-Jung; Hung, Chun-Nan; Hsu, Lih-Hsing Optimal 1-Hamiltonian graphs. (English) Zbl 1338.68223 Inf. Process. Lett. 65, No. 3, 157-161 (1998). MSC: 68R10 05C45 PDFBibTeX XMLCite \textit{J.-J. Wang} et al., Inf. Process. Lett. 65, No. 3, 157--161 (1998; Zbl 1338.68223) Full Text: DOI Link
Grable, David A. Nearly-perfect hypergraph packing is in NC. (English) Zbl 1336.68127 Inf. Process. Lett. 60, No. 6, 295-299 (1997). MSC: 68Q25 05C65 05C70 68W10 68W20 PDFBibTeX XMLCite \textit{D. A. Grable}, Inf. Process. Lett. 60, No. 6, 295--299 (1997; Zbl 1336.68127) Full Text: DOI
Viswanathan, Suresh; Czabarka, Éva; Sengupta, Abhijit On fault-tolerant embedding of Hamiltonian circuits in line digraph interconnection networks. (English) Zbl 0875.68044 Inf. Process. Lett. 57, No. 5, 265-271 (1996). MSC: 68M10 PDFBibTeX XMLCite \textit{S. Viswanathan} et al., Inf. Process. Lett. 57, No. 5, 265--271 (1996; Zbl 0875.68044) Full Text: DOI
Maire, Frédéric Polyominos and perfect graphs. (English) Zbl 0810.05020 Inf. Process. Lett. 50, No. 2, 57-61 (1994). Reviewer: R.N.Mohan (Nuzvid) MSC: 05B50 05C60 68R10 68U05 05C15 PDFBibTeX XMLCite \textit{F. Maire}, Inf. Process. Lett. 50, No. 2, 57--61 (1994; Zbl 0810.05020) Full Text: DOI