Bensmail, Julien; Hocquard, Hervé; Marcille, Pierre-Marie On inducing degenerate sums through 2-labellings. (English) Zbl 07805295 Graphs Comb. 40, No. 2, Paper No. 23, 29 p. (2024). MSC: 05C78 68Q17 68W05 PDFBibTeX XMLCite \textit{J. Bensmail} et al., Graphs Comb. 40, No. 2, Paper No. 23, 29 p. (2024; Zbl 07805295) Full Text: DOI
Saad, Rachid Parallel connectivity in edge-colored complete graphs: complexity results. (English) Zbl 07805290 Graphs Comb. 40, No. 2, Paper No. 25, 25 p. (2024). MSC: 05C40 05C15 68W25 PDFBibTeX XMLCite \textit{R. Saad}, Graphs Comb. 40, No. 2, Paper No. 25, 25 p. (2024; Zbl 07805290) Full Text: DOI
Álvarez-Rebollar, J. L.; Cravioto-Lagos, J.; Marín, N.; Solé-Pi, O.; Urrutia, J. Crossing and intersecting families of geometric graphs on point sets. (English) Zbl 07805286 Graphs Comb. 40, No. 1, Paper No. 17, 23 p. (2024). MSC: 68-XX 05Cxx 52Cxx 68Uxx PDFBibTeX XMLCite \textit{J. L. Álvarez-Rebollar} et al., Graphs Comb. 40, No. 1, Paper No. 17, 23 p. (2024; Zbl 07805286) Full Text: DOI arXiv OA License
Graves, Christina; Lauderdale, L.-K. Fixing numbers of graphs with symmetric and generalized quaternion symmetry groups. (English) Zbl 07796530 Graphs Comb. 40, No. 1, Paper No. 14, 16 p. (2024). MSC: 05C30 05C25 05C90 68R10 05C35 PDFBibTeX XMLCite \textit{C. Graves} and \textit{L. K. Lauderdale}, Graphs Comb. 40, No. 1, Paper No. 14, 16 p. (2024; Zbl 07796530) Full Text: DOI
Henning, Michael A.; Kusum; Pandey, Arti; Paul, Kaustav Complexity of total dominator coloring in graphs. (English) Zbl 07783965 Graphs Comb. 39, No. 6, Paper No. 128, 18 p. (2023). MSC: 05C15 05C69 05C10 68Q25 PDFBibTeX XMLCite \textit{M. A. Henning} et al., Graphs Comb. 39, No. 6, Paper No. 128, 18 p. (2023; Zbl 07783965) Full Text: DOI arXiv
Gangopadhyay, Rahul; Ayan Maximum rectilinear crossing number of uniform hypergraphs. (English) Zbl 1525.05139 Graphs Comb. 39, No. 6, Paper No. 114, 26 p. (2023). MSC: 05C65 05C62 05C35 52B05 68Q17 PDFBibTeX XMLCite \textit{R. Gangopadhyay} and \textit{Ayan}, Graphs Comb. 39, No. 6, Paper No. 114, 26 p. (2023; Zbl 1525.05139) Full Text: DOI arXiv
Tóth, Csaba D.; Urrutia, Jorge; Viglietta, Giovanni Minimizing visible edges in polyhedra. (English) Zbl 1527.52008 Graphs Comb. 39, No. 5, Paper No. 111, 21 p. (2023). Reviewer: Gordon Williams (Fairbanks) MSC: 52B05 52B10 52B70 68U05 PDFBibTeX XMLCite \textit{C. D. Tóth} et al., Graphs Comb. 39, No. 5, Paper No. 111, 21 p. (2023; Zbl 1527.52008) Full Text: DOI arXiv
Bong, Novi H.; Carlson, Joshua; Curtis, Bryan; Haas, Ruth; Hogben, Leslie Isomorphisms and properties of TAR graphs for zero forcing and other \(X\)-set parameters. (English) Zbl 1519.05173 Graphs Comb. 39, No. 4, Paper No. 86, 23 p. (2023). MSC: 05C60 05C69 68R10 05C50 05C57 PDFBibTeX XMLCite \textit{N. H. Bong} et al., Graphs Comb. 39, No. 4, Paper No. 86, 23 p. (2023; Zbl 1519.05173) Full Text: DOI arXiv
Dziewa-Dawidczyk, Diana; Przeździecki, Adam J. Undirected determinant and its complexity. (English) Zbl 1519.05152 Graphs Comb. 39, No. 4, Paper No. 80, 26 p. (2023). MSC: 05C50 05C10 05C30 05C70 68Q17 PDFBibTeX XMLCite \textit{D. Dziewa-Dawidczyk} and \textit{A. J. Przeździecki}, Graphs Comb. 39, No. 4, Paper No. 80, 26 p. (2023; Zbl 1519.05152) Full Text: DOI arXiv
Brause, Christoph; Jendrol’, Stanislav; Schiermeyer, Ingo Loose edge-connection of graphs. (English) Zbl 1519.05138 Graphs Comb. 39, No. 4, Paper No. 79, 18 p. (2023). MSC: 05C40 05C15 05C35 68Q17 PDFBibTeX XMLCite \textit{C. Brause} et al., Graphs Comb. 39, No. 4, Paper No. 79, 18 p. (2023; Zbl 1519.05138) Full Text: DOI arXiv
Daugherty, Caroline; Laison, Joshua D.; Robinson, Rebecca; Salois, Kyle Intersection graphs of maximal sub-polygons of \(k\)-lizards. (English) Zbl 1518.05141 Graphs Comb. 39, No. 4, Paper No. 75, 16 p. (2023). MSC: 05C62 05C75 05C76 68R10 68U05 05C05 PDFBibTeX XMLCite \textit{C. Daugherty} et al., Graphs Comb. 39, No. 4, Paper No. 75, 16 p. (2023; Zbl 1518.05141) Full Text: DOI arXiv
Chen, Xiaodong; Li, Jingjing; Lu, Fuliang Two completely independent spanning trees of \(P_4\)-free graphs. (English) Zbl 1512.05082 Graphs Comb. 39, No. 2, Paper No. 30, 6 p. (2023). MSC: 05C05 68R10 PDFBibTeX XMLCite \textit{X. Chen} et al., Graphs Comb. 39, No. 2, Paper No. 30, 6 p. (2023; Zbl 1512.05082) Full Text: DOI
Lardas, Emmanouil; Protopapas, Evangelos; Thilikos, Dimitrios M.; Zoros, Dimitris On strict brambles. (English) Zbl 1509.05132 Graphs Comb. 39, No. 2, Paper No. 24, 26 p. (2023). MSC: 05C60 05C70 05C05 05C75 05C83 68Q17 PDFBibTeX XMLCite \textit{E. Lardas} et al., Graphs Comb. 39, No. 2, Paper No. 24, 26 p. (2023; Zbl 1509.05132) Full Text: DOI arXiv
Liu, Ruijing; Zhou, Junling Further study on optimal data placements for triple replication. (English) Zbl 07640102 Graphs Comb. 39, No. 1, Paper No. 11, 19 p. (2023). MSC: 68Pxx 68R10 05B07 94C30 PDFBibTeX XMLCite \textit{R. Liu} and \textit{J. Zhou}, Graphs Comb. 39, No. 1, Paper No. 11, 19 p. (2023; Zbl 07640102) Full Text: DOI
Chen, Xiaodong; Guo, Xiyao; Yang, Xiwu 2-proper partition of a graph. (English) Zbl 07625284 Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022). MSC: 68R10 PDFBibTeX XMLCite \textit{X. Chen} et al., Graphs Comb. 38, No. 6, Paper No. 191, 11 p. (2022; Zbl 07625284) Full Text: DOI
Kaul, Hemanshu; Mudrock, Jeffrey A.; Wagstrom, Tim On the equitable choosability of the disjoint union of stars. (English) Zbl 07601292 Graphs Comb. 38, No. 5, Paper No. 163, 22 p. (2022). MSC: 68R10 05C15 PDFBibTeX XMLCite \textit{H. Kaul} et al., Graphs Comb. 38, No. 5, Paper No. 163, 22 p. (2022; Zbl 07601292) Full Text: DOI arXiv
Akitaya, Hugo A.; Löffler, Maarten; Parada, Irene How to fit a tree in a box. (English) Zbl 1497.05185 Graphs Comb. 38, No. 5, Paper No. 155, 11 p. (2022). MSC: 05C62 05C05 05C60 68Q17 PDFBibTeX XMLCite \textit{H. A. Akitaya} et al., Graphs Comb. 38, No. 5, Paper No. 155, 11 p. (2022; Zbl 1497.05185) Full Text: DOI
Arévalo, A.; Chávez-Jiménez, R.; Hernández-Mora, A.; López-López, R.; Marín, N.; Ramírez-Vigueras, A.; Solé-Pi, O.; Urrutia, J. On rainbow quadrilaterals in colored point sets. (English) Zbl 07593903 Graphs Comb. 38, No. 5, Paper No. 152, 16 p. (2022). MSC: 68Uxx 68Qxx 52Axx PDFBibTeX XMLCite \textit{A. Arévalo} et al., Graphs Comb. 38, No. 5, Paper No. 152, 16 p. (2022; Zbl 07593903) Full Text: DOI
Xu, Ronggui; Li, Jiaao; Hou, Xinmin A note on shortest sign-circuit cover of signed 3-edge-colorable cubic graphs. (English) Zbl 1496.05067 Graphs Comb. 38, No. 5, Paper No. 144, 12 p. (2022). Reviewer: V. Lokesha (Bangalore) MSC: 05C22 05C70 68R10 PDFBibTeX XMLCite \textit{R. Xu} et al., Graphs Comb. 38, No. 5, Paper No. 144, 12 p. (2022; Zbl 1496.05067) Full Text: DOI
Ábrego, Bernardo M.; Fernández-Merchant, Silvia; Figueroa, Ana Paulina; Montellano-Ballesteros, Juan José; Rivera-Campo, Eduardo The crossing number of twisted graphs. (English) Zbl 1497.05050 Graphs Comb. 38, No. 5, Paper No. 134, 25 p. (2022). Reviewer: Xueliang Li (Tianjin) MSC: 05C10 05C35 05C62 52C10 05C60 68R10 PDFBibTeX XMLCite \textit{B. M. Ábrego} et al., Graphs Comb. 38, No. 5, Paper No. 134, 25 p. (2022; Zbl 1497.05050) Full Text: DOI
Diner, Öznur Yaşar; Giannopoulou, Archontia C.; Stamoulis, Giannos; Thilikos, Dimitrios M. Block elimination distance. (English) Zbl 1494.05104 Graphs Comb. 38, No. 5, Paper No. 133, 28 p. (2022). MSC: 05C83 05C85 05C75 68Q25 PDFBibTeX XMLCite \textit{Ö. Y. Diner} et al., Graphs Comb. 38, No. 5, Paper No. 133, 28 p. (2022; Zbl 1494.05104) Full Text: DOI
Mosca, Raffaele New results on independent sets in extensions of \(2K_2\)-free graphs. (English) Zbl 1494.05088 Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022). MSC: 05C69 05C35 05C75 68Q25 90C39 PDFBibTeX XMLCite \textit{R. Mosca}, Graphs Comb. 38, No. 4, Paper No. 127, 28 p. (2022; Zbl 1494.05088) Full Text: DOI
Abuadas, Tala; Hoàng, Chính T. On the structure of graphs without claw, \(4K_1\) and co-R. (English) Zbl 1493.05091 Graphs Comb. 38, No. 4, Paper No. 123, 19 p. (2022). MSC: 05C15 05C75 05C76 68Q25 PDFBibTeX XMLCite \textit{T. Abuadas} and \textit{C. T. Hoàng}, Graphs Comb. 38, No. 4, Paper No. 123, 19 p. (2022; Zbl 1493.05091) Full Text: DOI
Markenzon, Lilian; Waga, Christina F. E. M. The scattering number of strictly chordal graphs: linear time determination. (English) Zbl 1490.05254 Graphs Comb. 38, No. 3, Paper No. 102, 14 p. (2022). MSC: 05C85 05C40 68Q25 PDFBibTeX XMLCite \textit{L. Markenzon} and \textit{C. F. E. M. Waga}, Graphs Comb. 38, No. 3, Paper No. 102, 14 p. (2022; Zbl 1490.05254) Full Text: DOI
Pérez-Rosés, Hebert; Bras-Amorós, Maria; Serradilla-Merinero, José Miguel Greedy routing in circulant networks. (English) Zbl 1486.05291 Graphs Comb. 38, No. 3, Paper No. 86, 16 p. (2022). MSC: 05C82 05C20 05C35 05C85 11B39 68R10 PDFBibTeX XMLCite \textit{H. Pérez-Rosés} et al., Graphs Comb. 38, No. 3, Paper No. 86, 16 p. (2022; Zbl 1486.05291) Full Text: DOI
Chen, Hangdi; Lu, Changhong; Ye, Qingjie Generalized power domination in claw-free regular graphs. (English) Zbl 1485.05133 Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022). MSC: 05C69 90C35 05C85 68R10 05C35 05C90 PDFBibTeX XMLCite \textit{H. Chen} et al., Graphs Comb. 38, No. 3, Paper No. 68, 17 p. (2022; Zbl 1485.05133) Full Text: DOI arXiv
Qian, Chengyang; Wu, Yaokun; Xiong, Yanzhen Cyclic arrangements with minimum modulo \(m\) winding numbers. (English) Zbl 1485.05019 Graphs Comb. 38, No. 3, Paper No. 53, 37 p. (2022). MSC: 05B20 05C45 68R15 94A55 94B60 PDFBibTeX XMLCite \textit{C. Qian} et al., Graphs Comb. 38, No. 3, Paper No. 53, 37 p. (2022; Zbl 1485.05019) Full Text: DOI
Ahadi, Arash; Mollahajiaghaei, Mohsen; Dehghan, Ali On the maximum number of non-attacking rooks on a high-dimensional simplicial chessboard. (English) Zbl 1485.05124 Graphs Comb. 38, No. 3, Paper No. 52, 18 p. (2022). MSC: 05C69 68Q25 03D15 05A17 05C25 05C50 PDFBibTeX XMLCite \textit{A. Ahadi} et al., Graphs Comb. 38, No. 3, Paper No. 52, 18 p. (2022; Zbl 1485.05124) Full Text: DOI arXiv
Dehghan, Ali; Ahadi, Arash On the proper arc labeling of directed graphs. (English) Zbl 1480.05110 Graphs Comb. 38, No. 1, Paper No. 1, 19 p. (2022). Reviewer: P. Jeyanthi (Tiruchendur) MSC: 05C78 05C20 05C85 68Q25 PDFBibTeX XMLCite \textit{A. Dehghan} and \textit{A. Ahadi}, Graphs Comb. 38, No. 1, Paper No. 1, 19 p. (2022; Zbl 1480.05110) Full Text: DOI
Bonato, Anthony; English, Sean; Kay, Bill; Moghbel, Daniel Improved bounds for burning fence graphs. (English) Zbl 1479.05337 Graphs Comb. 37, No. 6, 2761-2773 (2021). MSC: 05C85 05C76 68R10 05C82 PDFBibTeX XMLCite \textit{A. Bonato} et al., Graphs Comb. 37, No. 6, 2761--2773 (2021; Zbl 1479.05337) Full Text: DOI arXiv
Richter, R. Bruce; Silva, André C.; Lee, Orlando Bounding the number of non-duplicates of the \(q\)-side in simple drawings of \(K_{p,q}\). (English) Zbl 1479.05233 Graphs Comb. 37, No. 6, 2697-2701 (2021). MSC: 05C62 68R10 PDFBibTeX XMLCite \textit{R. B. Richter} et al., Graphs Comb. 37, No. 6, 2697--2701 (2021; Zbl 1479.05233) Full Text: DOI arXiv
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 PDFBibTeX XMLCite \textit{Y. Ma} et al., Graphs Comb. 37, No. 6, 2621--2636 (2021; Zbl 1479.05116) Full Text: DOI
Li, Shasha; Qin, Zhongmei; Tu, Jianhua; Yue, Jun On tree-connectivity and path-connectivity of graphs. (English) Zbl 1479.05177 Graphs Comb. 37, No. 6, 2521-2533 (2021). MSC: 05C40 05C38 68Q25 PDFBibTeX XMLCite \textit{S. Li} et al., Graphs Comb. 37, No. 6, 2521--2533 (2021; Zbl 1479.05177) Full Text: DOI
Mosca, Raffaele Independent sets in \((P_4+P_4\),triangle)-free graphs. (English) Zbl 1479.05282 Graphs Comb. 37, No. 6, 2173-2189 (2021). MSC: 05C69 68Q17 68R10 05C85 05C35 05C75 PDFBibTeX XMLCite \textit{R. Mosca}, Graphs Comb. 37, No. 6, 2173--2189 (2021; Zbl 1479.05282) Full Text: DOI arXiv
Hidaka, Fumiya; Matsumoto, Naoki; Nakamoto, Atsuhiro Quadrangulations of a polygon with spirality. (English) Zbl 1477.52006 Graphs Comb. 37, No. 5, 1905-1912 (2021). MSC: 52A10 05C10 68U05 PDFBibTeX XMLCite \textit{F. Hidaka} et al., Graphs Comb. 37, No. 5, 1905--1912 (2021; Zbl 1477.52006) Full Text: DOI
Mondal, Debajyoti Simultaneous embedding of colored graphs. (English) Zbl 1524.68238 Graphs Comb. 37, No. 3, 747-760 (2021). MSC: 68R10 05C15 68U05 PDFBibTeX XMLCite \textit{D. Mondal}, Graphs Comb. 37, No. 3, 747--760 (2021; Zbl 1524.68238) Full Text: DOI arXiv
Colbourn, Charles J. Egalitarian edge orderings of complete graphs. (English) Zbl 1469.05148 Graphs Comb. 37, No. 4, 1405-1413 (2021). MSC: 05C78 68R10 68P10 PDFBibTeX XMLCite \textit{C. J. Colbourn}, Graphs Comb. 37, No. 4, 1405--1413 (2021; Zbl 1469.05148) Full Text: DOI
Alonso, Javier; Martín, Pedro Maximum spanning trees in normed planes. (English) Zbl 1480.46021 Graphs Comb. 37, No. 4, 1385-1403 (2021). MSC: 46B20 52A10 52A21 52B55 65D18 68R10 PDFBibTeX XMLCite \textit{J. Alonso} and \textit{P. Martín}, Graphs Comb. 37, No. 4, 1385--1403 (2021; Zbl 1480.46021) Full Text: DOI
Rusu, Irena; Tenner, Bridget Eileen Admissible pinnacle orderings. (English) Zbl 1469.05006 Graphs Comb. 37, No. 4, 1205-1214 (2021). MSC: 05A05 05A18 68R15 PDFBibTeX XMLCite \textit{I. Rusu} and \textit{B. E. Tenner}, Graphs Comb. 37, No. 4, 1205--1214 (2021; Zbl 1469.05006) Full Text: DOI arXiv
Alpert, Hannah; Roldán, Érika Art gallery problem with rook and queen vision. (English) Zbl 1499.68359 Graphs Comb. 37, No. 2, 621-642 (2021). MSC: 68U05 05B40 05B50 68Q17 PDFBibTeX XMLCite \textit{H. Alpert} and \textit{É. Roldán}, Graphs Comb. 37, No. 2, 621--642 (2021; Zbl 1499.68359) Full Text: DOI arXiv
Butler, Steve; Erickson, Craig; Fallat, Shaun; Hall, H. Tracy; Kroschel, Brenda; Lin, Jephian C.-H.; Shader, Bryan; Warnberg, Nathan; Yang, Boting Correction to: “Properties of a \(q\)-analogue of zero forcing”. (English) Zbl 1472.05111 Graphs Comb. 36, No. 5, 1421-1422 (2020). MSC: 05C57 05C85 05C05 68R10 91A43 91A46 PDFBibTeX XMLCite \textit{S. Butler} et al., Graphs Comb. 36, No. 5, 1421--1422 (2020; Zbl 1472.05111)
Butler, Steve; Erickson, Craig; Fallat, Shaun; Hall, H. Tracy; Kroschel, Brenda; Lin, Jephian C.-H.; Shader, Bryan; Warnberg, Nathan; Yang, Boting Properties of a \(q\)-analogue of zero forcing. (English) Zbl 1458.05166 Graphs Comb. 36, No. 5, 1401-1419 (2020); correction ibid. 36, No. 5, 1421-1422 (2020). MSC: 05C57 05C85 05C05 68R10 91A43 91A46 PDFBibTeX XMLCite \textit{S. Butler} et al., Graphs Comb. 36, No. 5, 1401--1419 (2020; Zbl 1458.05166) Full Text: DOI arXiv
Aldana-Galván, I.; Álvarez-Rebollar, J. L.; Catana-Salazar, J. C.; Marín, N.; Solís-Villarreal, E.; Urrutia, J.; Velarde, C. Tight bounds for illuminating and covering of orthotrees with vertex lights and vertex beacons. (English) Zbl 1434.68594 Graphs Comb. 36, No. 3, 617-630 (2020). MSC: 68U05 PDFBibTeX XMLCite \textit{I. Aldana-Galván} et al., Graphs Comb. 36, No. 3, 617--630 (2020; Zbl 1434.68594) Full Text: DOI
Barish, Robert D.; Suyama, Akira Counting Hamiltonian cycles on quartic 4-vertex-connected planar graphs. (English) Zbl 1436.05056 Graphs Comb. 36, No. 2, 387-400 (2020). MSC: 05C45 05C10 05C30 68Q17 PDFBibTeX XMLCite \textit{R. D. Barish} and \textit{A. Suyama}, Graphs Comb. 36, No. 2, 387--400 (2020; Zbl 1436.05056) Full Text: DOI
Takenaga, Yasuhiko; Mishiba, Shohei; Sugiyama, Haruka Matchstick puzzles on a grid. (English) Zbl 1432.68184 Graphs Comb. 36, No. 2, 347-357 (2020). MSC: 68Q25 68Q17 68R05 PDFBibTeX XMLCite \textit{Y. Takenaga} et al., Graphs Comb. 36, No. 2, 347--357 (2020; Zbl 1432.68184) Full Text: DOI
Demaine, Erik D.; Ito, Hiro; Langerman, Stefan; Lynch, Jayson; Rudoy, Mikhail; Xiao, Kai Cookie clicker. (English) Zbl 1436.91015 Graphs Comb. 36, No. 2, 269-302 (2020). MSC: 91A40 91A68 68W25 90C39 PDFBibTeX XMLCite \textit{E. D. Demaine} et al., Graphs Comb. 36, No. 2, 269--302 (2020; Zbl 1436.91015) Full Text: DOI arXiv Link
Bosboom, Jeffrey; Demaine, Erik D.; Demaine, Martin L.; Hesterberg, Adam; Kimball, Roderick; Kopinsky, Justin Path puzzles: discrete tomography with a path constraint is hard. (English) Zbl 1433.68155 Graphs Comb. 36, No. 2, 251-267 (2020). MSC: 68Q17 68U10 PDFBibTeX XMLCite \textit{J. Bosboom} et al., Graphs Comb. 36, No. 2, 251--267 (2020; Zbl 1433.68155) Full Text: DOI arXiv
Akitaya, Hugo A.; Avery, Cordelia; Bergeron, Joseph; Demaine, Erik D.; Kopinsky, Justin; Ku, Jason S. Infinite all-layers simple foldability. (English) Zbl 1433.68477 Graphs Comb. 36, No. 2, 231-244 (2020). MSC: 68U05 51M15 68Q17 PDFBibTeX XMLCite \textit{H. A. Akitaya} et al., Graphs Comb. 36, No. 2, 231--244 (2020; Zbl 1433.68477) Full Text: DOI arXiv
Biniaz, Ahmad; Bose, Prosenjit; Ooms, Aurélien; Verdonschot, Sander Improved bounds for guarding plane graphs with edges. (English) Zbl 1409.05081 Graphs Comb. 35, No. 2, 437-450 (2019). MSC: 05C15 05C10 68U05 PDFBibTeX XMLCite \textit{A. Biniaz} et al., Graphs Comb. 35, No. 2, 437--450 (2019; Zbl 1409.05081) Full Text: DOI arXiv Link
Berry, Anne; Wagler, Annegret K. The normal graph conjecture for two classes of sparse graphs. (English) Zbl 1382.05039 Graphs Comb. 34, No. 1, 139-157 (2018). MSC: 05C42 05C17 05C69 05C85 68W40 PDFBibTeX XMLCite \textit{A. Berry} and \textit{A. K. Wagler}, Graphs Comb. 34, No. 1, 139--157 (2018; Zbl 1382.05039) Full Text: DOI HAL
Wong, Dennis A new universal cycle for permutations. (English) Zbl 1382.05005 Graphs Comb. 33, No. 6, 1393-1399 (2017). Reviewer: Thomas Britz (Sydney) MSC: 05A05 05C45 68R05 PDFBibTeX XMLCite \textit{D. Wong}, Graphs Comb. 33, No. 6, 1393--1399 (2017; Zbl 1382.05005) Full Text: DOI
Malyshev, D. S. The complexity of the vertex 3-colorability problem for some hereditary classes defined by 5-vertex forbidden induced subgraphs. (English) Zbl 1371.05091 Graphs Comb. 33, No. 4, 1009-1022 (2017). MSC: 05C15 68Q17 05C85 05C60 68Q25 PDFBibTeX XMLCite \textit{D. S. Malyshev}, Graphs Comb. 33, No. 4, 1009--1022 (2017; Zbl 1371.05091) Full Text: DOI
Araujo-Pardo, Gabriela; Hernández-Cruz, César; Montellano-Ballesteros, Juan José The strong convexity spectra of grids. (English) Zbl 1371.05059 Graphs Comb. 33, No. 4, 689-713 (2017). MSC: 05C12 05C20 05C40 05C10 68Q17 PDFBibTeX XMLCite \textit{G. Araujo-Pardo} et al., Graphs Comb. 33, No. 4, 689--713 (2017; Zbl 1371.05059) Full Text: DOI arXiv
Abedin, Paniz; Akbari, Saieed; Demange, Marc; Ekim, Tınaz Complexity of the improper twin edge coloring of graphs. (English) Zbl 1371.05067 Graphs Comb. 33, No. 4, 595-615 (2017). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{P. Abedin} et al., Graphs Comb. 33, No. 4, 595--615 (2017; Zbl 1371.05067) Full Text: DOI
Sabri, Ahmad; Vajnovszki, Vincent More restricted growth functions: Gray codes and exhaustive generation. (English) Zbl 1366.05013 Graphs Comb. 33, No. 3, 573-582 (2017). MSC: 05A99 68R10 94B25 PDFBibTeX XMLCite \textit{A. Sabri} and \textit{V. Vajnovszki}, Graphs Comb. 33, No. 3, 573--582 (2017; Zbl 1366.05013) Full Text: DOI arXiv
Chirkov, Aleksandr Yu.; Zolotykh, Nikolai Yu. On the number of irreducible points in polyhedra. (English) Zbl 1356.51014 Graphs Comb. 32, No. 5, 1789-1803 (2016). MSC: 51M20 52B11 68Q32 PDFBibTeX XMLCite \textit{A. Yu. Chirkov} and \textit{N. Yu. Zolotykh}, Graphs Comb. 32, No. 5, 1789--1803 (2016; Zbl 1356.51014) Full Text: DOI arXiv
Bensmail, Julien; Renault, Gabriel Decomposing oriented graphs into six locally irregular oriented graphs. (English) Zbl 1351.05178 Graphs Comb. 32, No. 5, 1707-1721 (2016). MSC: 05C70 68Q17 PDFBibTeX XMLCite \textit{J. Bensmail} and \textit{G. Renault}, Graphs Comb. 32, No. 5, 1707--1721 (2016; Zbl 1351.05178) Full Text: DOI Link
Angel, Omer; Shinkar, Igor A tight upper bound on acquaintance time of graphs. (English) Zbl 1351.05211 Graphs Comb. 32, No. 5, 1667-1673 (2016). MSC: 05C85 68R10 68Q17 PDFBibTeX XMLCite \textit{O. Angel} and \textit{I. Shinkar}, Graphs Comb. 32, No. 5, 1667--1673 (2016; Zbl 1351.05211) Full Text: DOI arXiv
Aïder, Méziane; Gravier, Sylvain; Slimani, Souad Relaxed locally identifying coloring of graphs. (English) Zbl 1351.05070 Graphs Comb. 32, No. 5, 1651-1665 (2016). MSC: 05C15 68Q17 PDFBibTeX XMLCite \textit{M. Aïder} et al., Graphs Comb. 32, No. 5, 1651--1665 (2016; Zbl 1351.05070) Full Text: DOI arXiv
Yin, Jun; Xiong, Liming; Zhao, Haixing Hamiltonian claw-free graphs and \(o\)-heavy graphs involving induced cycles. (English) Zbl 1339.05345 Graphs Comb. 32, No. 2, 823-833 (2016). MSC: 05C76 05C40 05C45 68Q17 PDFBibTeX XMLCite \textit{J. Yin} et al., Graphs Comb. 32, No. 2, 823--833 (2016; Zbl 1339.05345) Full Text: DOI
Daadaa, Yassine; Jamshed, Asif; Shabbir, Mudassir Network decontamination with a single agent. (English) Zbl 1339.05372 Graphs Comb. 32, No. 2, 559-581 (2016). MSC: 05C82 05C85 68Q17 PDFBibTeX XMLCite \textit{Y. Daadaa} et al., Graphs Comb. 32, No. 2, 559--581 (2016; Zbl 1339.05372) Full Text: DOI arXiv
Mosca, Raffaele; Nobili, Paolo Polynomial time recognition of essential graphs having stability number equal to matching number. (English) Zbl 1321.05211 Graphs Comb. 31, No. 5, 1649-1658 (2015). MSC: 05C70 05C35 05C85 68Q25 PDFBibTeX XMLCite \textit{R. Mosca} and \textit{P. Nobili}, Graphs Comb. 31, No. 5, 1649--1658 (2015; Zbl 1321.05211) Full Text: DOI
Berry, Anne; Brandstädt, Andreas; Engel, Konrad The Dilworth number of auto-chordal bipartite graphs. (English) Zbl 1327.05285 Graphs Comb. 31, No. 5, 1463-1471 (2015). MSC: 05C75 05C85 68R10 PDFBibTeX XMLCite \textit{A. Berry} et al., Graphs Comb. 31, No. 5, 1463--1471 (2015; Zbl 1327.05285) Full Text: DOI arXiv
Dehghan, Ali; Sadeghi, Mohammad-Reza; Ahadi, Arash On the complexity of deciding whether the regular number is at most two. (English) Zbl 1321.05082 Graphs Comb. 31, No. 5, 1359-1365 (2015). MSC: 05C15 05C20 68Q25 PDFBibTeX XMLCite \textit{A. Dehghan} et al., Graphs Comb. 31, No. 5, 1359--1365 (2015; Zbl 1321.05082) Full Text: DOI arXiv
Castañeda, Nelson; Gotchev, Ivan S. Path coverings with prescribed ends in faulty hypercubes. (English) Zbl 1317.05101 Graphs Comb. 31, No. 4, 833-869 (2015). MSC: 05C38 05C45 68R10 68M10 68M15 PDFBibTeX XMLCite \textit{N. Castañeda} and \textit{I. S. Gotchev}, Graphs Comb. 31, No. 4, 833--869 (2015; Zbl 1317.05101) Full Text: DOI arXiv
Czyzowicz, J.; Dobrev, S.; Joeris, B.; Kranakis, E.; Krizanc, D.; Maňuch, J.; Morales-Ponce, O.; Opatrny, J.; Stacho, L.; Urrutia, J. Monitoring the plane with rotating radars. (English) Zbl 1328.68260 Graphs Comb. 31, No. 2, 393-405 (2015). MSC: 68U05 68R10 PDFBibTeX XMLCite \textit{J. Czyzowicz} et al., Graphs Comb. 31, No. 2, 393--405 (2015; Zbl 1328.68260) Full Text: DOI
Aloupis, Greg; Barba, Luis; De Carufel, Jean-Lou; Langerman, Stefan; Souvaine, Diane L. Isoperimetric enclosures. (English) Zbl 1317.51010 Graphs Comb. 31, No. 2, 361-392 (2015). MSC: 51M04 68U05 51M25 52A10 68Q25 PDFBibTeX XMLCite \textit{G. Aloupis} et al., Graphs Comb. 31, No. 2, 361--392 (2015; Zbl 1317.51010) Full Text: DOI
Aichholzer, O.; Caraballo, L. E.; Díaz-Báñez, J. M.; Fabila-Monroy, R.; Ochoa, C.; Nigsch, P. Characterization of extremal antipodal polygons. (English) Zbl 1317.52001 Graphs Comb. 31, No. 2, 321-333 (2015). MSC: 52A10 68U05 51M04 52A38 51M25 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Graphs Comb. 31, No. 2, 321--333 (2015; Zbl 1317.52001) Full Text: DOI
Gu, Xiaofeng; Lai, Hong-Jian; Li, Ping; Yao, Senmei Characterizations of strength extremal graphs. (English) Zbl 1306.05106 Graphs Comb. 30, No. 6, 1453-1461 (2014). MSC: 05C35 05C40 05C82 68R10 68M10 68M15 PDFBibTeX XMLCite \textit{X. Gu} et al., Graphs Comb. 30, No. 6, 1453--1461 (2014; Zbl 1306.05106) Full Text: DOI
Dekar, Lyes; Effantin, Brice; Kheddouci, Hamamache \([r,s,t]\)-colorings of graph products. (English) Zbl 1298.05113 Graphs Comb. 30, No. 5, 1135-1147 (2014). MSC: 05C15 05C76 68R10 PDFBibTeX XMLCite \textit{L. Dekar} et al., Graphs Comb. 30, No. 5, 1135--1147 (2014; Zbl 1298.05113) Full Text: DOI
Lozin, Vadim V.; Milanič, Martin; Purcell, Christopher Graphs without large apples and the maximum weight independent set problem. (English) Zbl 1298.05257 Graphs Comb. 30, No. 2, 395-410 (2014). MSC: 05C69 05C75 68R10 PDFBibTeX XMLCite \textit{V. V. Lozin} et al., Graphs Comb. 30, No. 2, 395--410 (2014; Zbl 1298.05257) Full Text: DOI
Bonomo, Flavia; Valencia-Pabon, Mario On the minimum sum coloring of \(P_4\)-sparse graphs. (English) Zbl 1298.05106 Graphs Comb. 30, No. 2, 303-314 (2014). MSC: 05C15 05C42 05C35 05C85 68W25 PDFBibTeX XMLCite \textit{F. Bonomo} and \textit{M. Valencia-Pabon}, Graphs Comb. 30, No. 2, 303--314 (2014; Zbl 1298.05106) Full Text: DOI
Basavaraju, Manu; Chandran, L. Sunil; Rajendraprasad, Deepak; Ramaswamy, Arunselvan Rainbow connection number and radius. (English) Zbl 1298.05103 Graphs Comb. 30, No. 2, 275-285 (2014). MSC: 05C15 05C40 05C35 68W25 PDFBibTeX XMLCite \textit{M. Basavaraju} et al., Graphs Comb. 30, No. 2, 275--285 (2014; Zbl 1298.05103) Full Text: DOI arXiv
Gerzen, Tatjana An NP-completeness result of edge search in graphs. (English) Zbl 1293.05367 Graphs Comb. 30, No. 3, 661-669 (2014). MSC: 05C85 05C80 68M15 68P10 68Q17 90C27 PDFBibTeX XMLCite \textit{T. Gerzen}, Graphs Comb. 30, No. 3, 661--669 (2014; Zbl 1293.05367) Full Text: DOI
Damian, Mirela; Demaine, Erik D.; Flatland, Robin Unfolding orthogonal polyhedra with quadratic refinement: the delta-unfolding algorithm. (English) Zbl 1287.52012 Graphs Comb. 30, No. 1, 125-140 (2014). MSC: 52B99 68U05 PDFBibTeX XMLCite \textit{M. Damian} et al., Graphs Comb. 30, No. 1, 125--140 (2014; Zbl 1287.52012) Full Text: DOI arXiv
Wu, Jichang; Ou, Jianping On edge cut of graphs leaving components of order at least five. (English) Zbl 1282.05083 Graphs Comb. 29, No. 6, 1973-1981 (2013). MSC: 05C40 68R10 68M15 PDFBibTeX XMLCite \textit{J. Wu} and \textit{J. Ou}, Graphs Comb. 29, No. 6, 1973--1981 (2013; Zbl 1282.05083) Full Text: DOI
Chen, Xiaodong; Li, Mingchu; Ma, Xin; Fan, Xinxin Hamiltonian connectedness in claw-free graphs. (English) Zbl 1272.05098 Graphs Comb. 29, No. 5, 1259-1267 (2013). MSC: 05C40 05C45 68R10 PDFBibTeX XMLCite \textit{X. Chen} et al., Graphs Comb. 29, No. 5, 1259--1267 (2013; Zbl 1272.05098) Full Text: DOI
Jelínek, Vít; Jelínková, Eva; Kratochvíl, Jan; Lidický, Bernard; Tesař, Marek; Vyskočil, Tomáš The planar slope number of planar partial 3-trees of bounded degree. (English) Zbl 1268.05052 Graphs Comb. 29, No. 4, 981-1005 (2013). MSC: 05C10 05C05 05C07 68R10 05C62 PDFBibTeX XMLCite \textit{V. Jelínek} et al., Graphs Comb. 29, No. 4, 981--1005 (2013; Zbl 1268.05052) Full Text: DOI arXiv
Li, Xueliang; Shi, Yongtang; Sun, Yuefang Rainbow connections of graphs: a survey. (English) Zbl 1258.05058 Graphs Comb. 29, No. 1, 1-38 (2013). MSC: 05C40 05C15 05C35 05D40 68Q25 68R10 PDFBibTeX XMLCite \textit{X. Li} et al., Graphs Comb. 29, No. 1, 1--38 (2013; Zbl 1258.05058) Full Text: DOI arXiv
Chandran, L. Sunil; Francis, Mathew C.; Sivadasan, Naveen Cubicity and bandwidth. (English) Zbl 1258.05086 Graphs Comb. 29, No. 1, 45-69 (2013). MSC: 05C62 05C85 68W20 PDFBibTeX XMLCite \textit{L. S. Chandran} et al., Graphs Comb. 29, No. 1, 45--69 (2013; Zbl 1258.05086) Full Text: DOI
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R. Finding a sun in building-free graphs. (English) Zbl 1256.05082 Graphs Comb. 28, No. 3, 347-364 (2012). MSC: 05C17 05C85 05C12 68Q17 68R10 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., Graphs Comb. 28, No. 3, 347--364 (2012; Zbl 1256.05082) Full Text: DOI arXiv
Dourado, Mitre C.; Protti, Fábio; Rautenbach, Dieter; Szwarcfiter, Jayme L. On the convexity number of graphs. (English) Zbl 1256.05123 Graphs Comb. 28, No. 3, 333-345 (2012). MSC: 05C38 05C35 05C12 68Q17 PDFBibTeX XMLCite \textit{M. C. Dourado} et al., Graphs Comb. 28, No. 3, 333--345 (2012; Zbl 1256.05123) Full Text: DOI
Cardinal, Jean; Demaine, Erik D.; Demaine, Martin L.; Imahori, Shinji; Ito, Tsuyoshi; Kiyomi, Masashi; Langerman, Stefan; Uehara, Ryuhei; Uno, Takeaki Algorithmic folding complexity. (English) Zbl 1234.68131 Graphs Comb. 27, No. 3, 341-351 (2011). MSC: 68Q17 52B55 68R15 PDFBibTeX XMLCite \textit{J. Cardinal} et al., Graphs Comb. 27, No. 3, 341--351 (2011; Zbl 1234.68131) Full Text: DOI
Kerber, Michael; Sagraloff, Michael A note on the complexity of real algebraic hypersurfaces. (English) Zbl 1238.14044 Graphs Comb. 27, No. 3, 419-430 (2011). Reviewer: Carlos D’Andrea (Barcelona) MSC: 14P25 05C85 68R10 PDFBibTeX XMLCite \textit{M. Kerber} and \textit{M. Sagraloff}, Graphs Comb. 27, No. 3, 419--430 (2011; Zbl 1238.14044) Full Text: DOI
Pach, János; Sarıöz, Deniz On the structure of graphs with low obstacle number. (English) Zbl 1235.05099 Graphs Comb. 27, No. 3, 465-473 (2011). MSC: 05C62 05C75 68R10 PDFBibTeX XMLCite \textit{J. Pach} and \textit{D. Sarıöz}, Graphs Comb. 27, No. 3, 465--473 (2011; Zbl 1235.05099) Full Text: DOI
Ahmed, Syed Ishtiaque; Hasan, Masud; Islam, Md. Ariful Cutting a convex polyhedron out of a sphere. (English) Zbl 1242.52016 Graphs Comb. 27, No. 3, 307-319 (2011). Reviewer: Frank Plastria (Brussels) MSC: 52B55 52B10 68W25 PDFBibTeX XMLCite \textit{S. I. Ahmed} et al., Graphs Comb. 27, No. 3, 307--319 (2011; Zbl 1242.52016) Full Text: DOI arXiv
Dumitrescu, Adrian; Pach, János Minimum clique partition in unit disk graphs. (English) Zbl 1244.68086 Graphs Comb. 27, No. 3, 399-411 (2011). Reviewer: Ludovit Niepel (Safat) MSC: 68W25 05C85 05C70 05C69 68W20 PDFBibTeX XMLCite \textit{A. Dumitrescu} and \textit{J. Pach}, Graphs Comb. 27, No. 3, 399--411 (2011; Zbl 1244.68086) Full Text: DOI arXiv
Mark Kayll, P. König-Egerváry graphs are non-Edmonds. (English) Zbl 1218.05143 Graphs Comb. 26, No. 5, 721-726 (2010). MSC: 05C70 05C35 90C35 68R10 52B99 PDFBibTeX XMLCite \textit{P. Mark Kayll}, Graphs Comb. 26, No. 5, 721--726 (2010; Zbl 1218.05143) Full Text: DOI
De Bruyn, Bart; Shpectorov, Sergey The hyperplanes of the \(U_{4}(3)\) near hexagon. (English) Zbl 1230.05294 Graphs Comb. 26, No. 5, 647-671 (2010). MSC: 05E18 51A45 51A50 51E12 68W30 PDFBibTeX XMLCite \textit{B. De Bruyn} and \textit{S. Shpectorov}, Graphs Comb. 26, No. 5, 647--671 (2010; Zbl 1230.05294) Full Text: DOI
Derhy, Nicolas; Picouleau, Christophe; Trotignon, Nicolas The four-in-a-tree problem in triangle-free graphs. (English) Zbl 1186.05101 Graphs Comb. 25, No. 4, 489-502 (2009). Reviewer: Ulrich Knauer (Oldenburg) MSC: 05C75 05C85 05C05 68R10 90C35 PDFBibTeX XMLCite \textit{N. Derhy} et al., Graphs Comb. 25, No. 4, 489--502 (2009; Zbl 1186.05101) Full Text: DOI arXiv
Gagarin, Andrei; Poghosyan, Anush; Zverovich, Vadim Upper bounds for \(\alpha \)-domination parameters. (English) Zbl 1216.05103 Graphs Comb. 25, No. 4, 513-520 (2009). MSC: 05C69 68R10 68W20 90B15 PDFBibTeX XMLCite \textit{A. Gagarin} et al., Graphs Comb. 25, No. 4, 513--520 (2009; Zbl 1216.05103) Full Text: DOI arXiv
Gethner, Ellen; Sulanke, Thom Thickness-two graphs. II: More new nine-critical graphs, independence ratio, cloned planar graphs, and singly and doubly outerplanar graphs. (English) Zbl 1223.05195 Graphs Comb. 25, No. 2, 197-217 (2009). MSC: 05C62 05C15 05C75 68R10 PDFBibTeX XMLCite \textit{E. Gethner} and \textit{T. Sulanke}, Graphs Comb. 25, No. 2, 197--217 (2009; Zbl 1223.05195) Full Text: DOI
Hagita, Mariko; Matsumoto, Makoto; Natsu, Fumio; Ohtsuka, Yuki Error correcting sequence and projective de Bruijn graph. (English) Zbl 1159.94391 Graphs Comb. 24, No. 3, 185-194 (2008). MSC: 94B25 05C20 68R15 PDFBibTeX XMLCite \textit{M. Hagita} et al., Graphs Comb. 24, No. 3, 185--194 (2008; Zbl 1159.94391) Full Text: DOI
Asratian, Armen S.; Casselgren, Carl Johan On path factors of \((3,4)\)-biregular bigraphs. (English) Zbl 1177.05089 Graphs Comb. 24, No. 5, 405-411 (2008). Reviewer: Adrian Kosowski (Gdańsk) MSC: 05C70 05C38 68R10 PDFBibTeX XMLCite \textit{A. S. Asratian} and \textit{C. J. Casselgren}, Graphs Comb. 24, No. 5, 405--411 (2008; Zbl 1177.05089) Full Text: DOI arXiv
Costa, M. C.; de Werra, D.; Picouleau, C.; Ries, B. Addendum to “Bicolored matchings in some classes of graphs”. (English) Zbl 1175.05108 Graphs Comb. 24, No. 2, 127-128 (2008). MSC: 05C70 05C38 05C15 05C85 68R10 PDFBibTeX XMLCite \textit{M. C. Costa} et al., Graphs Comb. 24, No. 2, 127--128 (2008; Zbl 1175.05108) Full Text: DOI Link
Aichholzer, O.; Huemer, C.; Kappes, S.; Speckmann, B.; Tóth, Cs. D. Decompositions, partitions, and coverings with convex polygons and pseudo-triangles. (English) Zbl 1131.05027 Graphs Comb. 23, No. 5, 481-507 (2007). MSC: 05B45 05D10 52C15 52C20 68U05 PDFBibTeX XMLCite \textit{O. Aichholzer} et al., Graphs Comb. 23, No. 5, 481--507 (2007; Zbl 1131.05027) Full Text: DOI Link
Roy, Sambuddha; Steiger, William Some combinatorial and algorithmic applications of the Borsuk-Ulam theorem. (English) Zbl 1123.52007 Graphs Comb. 23, Suppl., 331-341 (2007). Reviewer: Xuezhi Zhao (Beijing) MSC: 52B55 52B11 05A18 68Q25 68R05 PDFBibTeX XMLCite \textit{S. Roy} and \textit{W. Steiger}, Graphs Comb. 23, 331--341 (2007; Zbl 1123.52007) Full Text: DOI
Demaine, Erik D.; Demaine, Martin L. Jigsaw puzzles, edge matching, and polyomino packing: Connections and complexity. (English) Zbl 1123.05027 Graphs Comb. 23, Suppl., 195-208 (2007). MSC: 05B40 05B50 52C20 68Q17 PDFBibTeX XMLCite \textit{E. D. Demaine} and \textit{M. L. Demaine}, Graphs Comb. 23, 195--208 (2007; Zbl 1123.05027) Full Text: DOI
Avis, David; Katoh, Naoki; Ohsaki, Makoto; Streinu, Ileana; Tanigawa, Shin-ichi Enumerating non-crossing minimally rigid frameworks. (English) Zbl 1123.68084 Graphs Comb. 23, Suppl., 117-134 (2007). MSC: 68R10 05A15 05C10 52C25 68U05 68W05 PDFBibTeX XMLCite \textit{D. Avis} et al., Graphs Comb. 23, 117--134 (2007; Zbl 1123.68084) Full Text: DOI
Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R. An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs. (English) Zbl 1123.68089 Graphs Comb. 23, Suppl., 209-231 (2007). MSC: 68R10 05C38 05C85 68Q25 PDFBibTeX XMLCite \textit{E. M. Eschen} et al., Graphs Comb. 23, 209--231 (2007; Zbl 1123.68089) Full Text: DOI