Limbach, Anna M.; Winter, Martin Characterising clique convergence for locally cyclic graphs of minimum degree \(\delta \geq 6\). (English) Zbl 1545.05184 Discrete Math. 347, No. 11, Article ID 114144, 17 p. (2024). MSC: 05C70 05C10 05C60 05C85 57M15 05C69 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
El-Mesady, A.; Farahat, T.; El-Shanawany, R.; Romanov, A. Y.; Sukhov, A. M. The novel generally described graphs for cyclic orthogonal double covers of some circulants. (English) Zbl 1525.05175 Lobachevskii J. Math. 44, No. 7, 2638-2650 (2023). MSC: 05C82 05C40 05C76 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
He, Yujia; Zhang, Shurong; Chen, Lin; Yang, Weihua The disjoint path cover in the data center network HSDC with prescribed vertices in each path. (English) Zbl 1531.05203 Appl. Math. Comput. 459, Article ID 128262, 24 p. (2023). MSC: 05C70 05C38 05C45 × Cite Format Result Cite Review PDF Full Text: DOI
McNew, Nathan Permutations and the divisor graph of \([1, n]\). (English) Zbl 1545.05005 Mathematika 69, No. 1, 51-67 (2023). MSC: 05A05 05C25 05C38 05C70 11A05 11B75 × Cite Format Result Cite Review PDF Full Text: DOI arXiv Backlinks: MO
Lee, Destine; Rosenblum-Sellers, Iris; Safin, Jakwanul; Tenie, Anda Graph coverings and (im)primitive homology: examples of low degree. (English) Zbl 1522.05381 Exp. Math. 32, No. 2, 313-320 (2023). MSC: 05C70 20F34 57M07 57M10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Huang, Dawei; Pettie, Seth Approximate generalized matching: \(f\)-matchings and \(f\)-edge covers. (English) Zbl 1492.68144 Algorithmica 84, No. 7, 1952-1992 (2022). MSC: 68W25 05C70 05C85 68R10 90C27 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
El-Mesady, A.; Farahat, T. Orthogonal labeling for some different infinite graph classes. (English) Zbl 1487.05040 Missouri J. Math. Sci. 34, No. 1, 40-61 (2022). MSC: 05B30 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Iverson, Joseph W.; Mixon, Dustin G. Doubly transitive lines. I: Higman pairs and roux. (English) Zbl 1476.05169 J. Comb. Theory, Ser. A 185, Article ID 105540, 47 p. (2022). MSC: 05C70 05C12 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Liu, Wenzhong; Wang, Jiancheng; Cui, Qing; Yang, Yan Strongly even cycle decomposable 4-regular line graphs. (English) Zbl 1461.05169 Eur. J. Comb. 94, Article ID 103315, 17 p. (2021). MSC: 05C70 05C38 05C12 05C76 × Cite Format Result Cite Review PDF Full Text: DOI
Matsushita, Takahiro Graphs whose Kronecker covers are bipartite Kneser graphs. (English) Zbl 1465.05153 Discrete Math. 344, No. 4, Article ID 112264, 6 p. (2021). Reviewer: Isabel Beckenbach (Berlin) MSC: 05C76 05C25 05C15 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Petruševski, Mirko; Škrekovski, Riste Odd decompositions and coverings of graphs. (English) Zbl 1458.05217 Eur. J. Comb. 91, Article ID 103225, 13 p. (2021). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Li, Jing; Melekian, Chris; Zuo, Shurong; Cheng, Eddie Unpaired many-to-many disjoint path covers on bipartite \(k\)-ary \(n\)-cube networks with faulty elements. (English) Zbl 1458.68024 Int. J. Found. Comput. Sci. 31, No. 3, 371-383 (2020). MSC: 68M15 05C70 68R10 × Cite Format Result Cite Review PDF Full Text: DOI
Churchill, Gregory; Nagle, Brendan Bipartite Hansel results for hypergraphs. (English) Zbl 1447.05146 Eur. J. Comb. 89, Article ID 103136, 19 p. (2020). MSC: 05C65 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Raman, Venkatesh; Ramanujan, M. S.; Saurabh, Saket A characterization of König-Egerváry graphs with extendable vertex covers. (English) Zbl 1447.05175 Inf. Process. Lett. 161, Article ID 105964, 9 p. (2020). MSC: 05C70 05C85 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Shabanov, D. A.; Shaikheeva, T. M. The list-chromatic number of complete multipartite hypergraphs and multiple covers by independent sets. (English. Russian original) Zbl 1442.05069 Math. Notes 107, No. 3, 499-508 (2020); translation from Mat. Zametki 107, No. 3, 454-465 (2020). MSC: 05C15 05C65 05C69 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Lazarovich, Nir; Levit, Arie Edge Kempe equivalence of regular graph covers. (English) Zbl 1495.05099 J. Graph Theory 93, No. 4, 553-559 (2020). MSC: 05C15 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Narayanan, G. Venkat; Suseela, J. Suresh; Kala, R. Simple graphoidal cover on tensor product of graphs. (English) Zbl 1495.05264 Adv. Appl. Discrete Math. 22, No. 1, 1-40 (2019). MSC: 05C70 05C76 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
El-Shanawany, R.; El-Mesady, A. On the one edge algorithm for the orthogonal double covers. (English) Zbl 1459.05255 Prikl. Diskretn. Mat. 2019, No. 45, 78-84 (2019). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI MNR
Hudry, Olivier; Lobstein, Antoine Complexity of unique (optimal) solutions in graphs: vertex cover and domination. (English) Zbl 1473.68120 J. Comb. Math. Comb. Comput. 110, 217-240 (2019). MSC: 68R10 05C69 05C70 68Q17 68Q25 68R07 × Cite Format Result Cite Review PDF
Doležal, Martin; Hladký, Jan Matching polytons. (English) Zbl 1428.05243 Electron. J. Comb. 26, No. 4, Research Paper P4.38, 33 p. (2019). MSC: 05C70 90C05 90C27 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Imbesi, Maurizio; La Barbiera, Monica Vertex covers in graphs with loops. (English) Zbl 1424.05138 Turk. J. Math. 42, No. 3, 1192-1202 (2018). MSC: 05C25 05C70 13C14 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Huang, Hau-Wen; Li, Wen-Ching Winnie Unramified graph covers of finite degree. (English) Zbl 1400.05182 Butler, Steve (ed.) et al., Connections in discrete mathematics. A celebration of the work of Ron Graham. Cambridge: Cambridge University Press (ISBN 978-1-316-60788-6/pbk; 978-1-107-15398-1/hbk; 978-131-665029-5/ebook). 104-124 (2018). MSC: 05C70 05C40 05C60 × Cite Format Result Cite Review PDF Full Text: DOI
Mumba, N. B.; Mwambene, E. Automorphism groups of graph covers and uniform subset graphs. (English) Zbl 1390.05093 AKCE Int. J. Graphs Comb. 15, No. 1, 27-30 (2018). MSC: 05C25 05C70 05C60 × Cite Format Result Cite Review PDF Full Text: DOI
Suzuki, Hiroshi Coverings and homotopy of a graph. (English) Zbl 1387.05212 Discrete Math. 341, No. 7, 1994-2010 (2018). MSC: 05C70 05C12 05C40 × Cite Format Result Cite Review PDF Full Text: DOI
Barton, Carl; Pissis, Solon P. Crochemore’s partitioning on weighted strings and applications. (English) Zbl 1391.68128 Algorithmica 80, No. 2, 496-514 (2018). MSC: 68W32 × Cite Format Result Cite Review PDF Full Text: DOI Link
Bustamante, Sebastián; Stein, Maya Monochromatic tree covers and Ramsey numbers for set-coloured graphs. (English) Zbl 1372.05136 Discrete Math. 341, No. 1, 266-276 (2018). MSC: 05C55 05C15 05C05 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Fan, Genghua Integer 4-flows and cycle covers. (English) Zbl 1399.05180 Combinatorica 37, No. 6, 1097-1112 (2017). MSC: 05C70 05C38 05C15 05C12 × Cite Format Result Cite Review PDF Full Text: DOI
Füredi, Zoltán; Kantor, Ida Kneser ranks of random graphs and minimum difference representations. (English) Zbl 1378.05185 Drmota, Michael (ed.) et al., Extended abstracts of the ninth European conference on combinatorics, graph theory and applications, EuroComb 2017, Vienna, Austria, August 28 – September 1, 2017. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 61, 499-503 (2017). MSC: 05C80 05C70 05C69 × Cite Format Result Cite Review PDF Full Text: DOI Link
Bollobás, Béla; Scott, Alex On a problem of Erdős and Moser. (English) Zbl 1457.05054 Abh. Math. Semin. Univ. Hamb. 87, No. 2, 213-222 (2017). Reviewer: Nicolás Sanhueza-Matamala (Praha) MSC: 05C35 05C69 05C70 05C65 05C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
El-Shanawany, R.; El-Mesady, A. On cyclic orthogonal double covers of circulant graphs by special infinite graphs. (English) Zbl 1375.05210 AKCE Int. J. Graphs Comb. 14, No. 3, 269-276 (2017). MSC: 05C70 05C63 × Cite Format Result Cite Review PDF Full Text: DOI
Aharoni, Ron; Holzman, Ron; Zerbib, Shira Edge-covers in \(d\)-interval hypergraphs. (English) Zbl 1372.05144 Discrete Comput. Geom. 58, No. 3, 650-662 (2017). MSC: 05C65 05C69 05C70 05D15 05B40 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Laforest, Christian On the discovery of graphs and graph algorithms. (À la découverte des graphes et des algorithmes de graphes.) (French) Zbl 1362.05001 Les Ulis: EDP Sciences (ISBN 978-2-7598-1830-3/pbk; 978-2-7598-2102-0/ebook). vi, 223 p. (2017). Reviewer: Marcin Anholcer (Poznan) MSC: 05-01 05C05 05C10 05C15 05C21 05C45 05C70 05C85 05C90 × Cite Format Result Cite Review PDF
Jin, Ligang; Steffen, Eckhard Petersen cores and the oddness of cubic graphs. (English) Zbl 1354.05113 J. Graph Theory 84, No. 2, 109-120 (2017). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kronenthal, Brian G.; Wong, Wing Hong Tony Paired many-to-many disjoint path covers of hypertori. (English) Zbl 1352.05151 Discrete Appl. Math. 218, 14-20 (2017). MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Anderson, Mark; Brigham, Robert C.; Carrington, Julie R.; Dutton, Ronald D.; Vitray, Richard P. Mortal and eternal vertex covers. (English) Zbl 1356.05103 J. Comb. Math. Comb. Comput. 99, 3-21 (2016). MSC: 05C70 05C05 × Cite Format Result Cite Review PDF
Beimel, Amos; Farràs, Oriol; Peter, Naty Secret sharing schemes for dense forbidden graphs. (English) Zbl 1482.94065 Zikas, Vassilis (ed.) et al., Security and cryptography for networks. 10th international conference, SCN 2016, Amalfi, Italy, August 31 – September 2, 2016. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9841, 509-528 (2016). MSC: 94A62 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Hägglund, Jonas On snarks that are far from being 3-edge colorable. (English) Zbl 1335.05064 Electron. J. Comb. 23, No. 2, Research Paper P2.6, 10 p. (2016). MSC: 05C15 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Buzatu, Radu; Cataranciuc, Sergiu Convex graph covers. (English) Zbl 1390.05187 Comput. Sci. J. Mold. 23, No. 3(69), 251-269 (2015). MSC: 05C70 68Q17 × Cite Format Result Cite Review PDF Full Text: Link
Chen, Jinkun; Lin, Yaojin; Lin, Guoping; Li, Jinjin; Ma, Zhouming The relationship between attribute reducts in rough sets and minimal vertex covers of graphs. (English) Zbl 1390.68636 Inf. Sci. 325, 87-97 (2015). MSC: 68T37 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Mohar, Bojan; Tayfeh-Rezaie, Behruz Median eigenvalues of bipartite graphs. (English) Zbl 1317.05112 J. Algebr. Comb. 41, No. 3, 899-909 (2015). Reviewer: William G. Brown (Montréal) MSC: 05C50 05B20 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
You, Lantao; Fan, Jianxi; Han, Yuejuan; Jia, Xiaohua One-to-one disjoint path covers on alternating group graphs. (English) Zbl 1303.68097 Theor. Comput. Sci. 562, 146-164 (2015). MSC: 68R10 05C38 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Sáenz-de-Cabezón, Eduardo; Wynn, H. P. Measuring the robustness of a network using minimal vertex covers. (English) Zbl 1467.68144 Math. Comput. Simul. 104, 82-94 (2014). MSC: 68R10 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Grohe, Martin; Marx, Dániel Constraint solving via fractional edge covers. (English) Zbl 1398.68240 ACM Trans. Algorithms 11, No. 1, Article No. 4, 20 p. (2014). MSC: 68Q25 05C65 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Buzatu, Radu Covering undirected graphs by convex sets. (English) Zbl 1330.05123 Choban, Mitrofan (ed.) et al., The third conference of the Mathematical Society of the Republic of Moldova dedicated to the 50th anniversary of the foundation of the Institute of Mathematics and Computer Science, ASM, Chişinău, Republic of Moldova, August 19–23, 2014. Abstracts. Chişinău: Academy of Sciences of Moldova, Institute of Mathematics and Computer Science (ISBN 978-9975-68-244-2/pbk). Proceedings IMCS-50, 322-325 (2014). MSC: 05C70 × Cite Format Result Cite Review PDF
Sava-Huss, Ecaterina; Huss, Wilfried Erratum to: “Transience and recurrence of rotor-router walks on directed covers of graphs”. (English) Zbl 1305.05047 Electron. Commun. Probab. 19, Paper No. 71, 6 p. (2014). MSC: 05C05 05C70 05C81 82C20 × Cite Format Result Cite Review PDF Full Text: DOI
Pinto, Trevor Biclique covers and partitions. (English) Zbl 1300.05259 Electron. J. Comb. 21, No. 1, Research Paper P1.19, 12 p. (2014). MSC: 05C70 05C60 05D05 × Cite Format Result Cite Review PDF Full Text: arXiv Link
Fiala, Jiří; Klavík, Pavel; Kratochvíl, Jan; Nedela, Roman Algorithmic aspects of regular graph covers with applications to planar graphs. (English) Zbl 1416.05224 Esparza, Javier (ed.) et al., Automata, languages, and programming. 41st international colloquium, ICALP 2014, Copenhagen, Denmark, July 8–11, 2014. Proceedings, Part I. Berlin: Springer. Lect. Notes Comput. Sci. 8572, 489-501 (2014). MSC: 05C70 05C10 05C85 68W40 68R10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kenyon, Richard Conformal invariance of loops in the double-dimer model. (English) Zbl 1283.05218 Commun. Math. Phys. 326, No. 2, 477-497 (2014). MSC: 05C70 05C10 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Deford, Daryl Counting rearrangements on generalized wheel graphs. (English) Zbl 1278.05126 Fibonacci Q. 51, No. 3, 259-267 (2013). MSC: 05C30 05C70 05A19 11B39 33C45 × Cite Format Result Cite Review PDF Full Text: Link
Wang, Shiping; Zhu, Qingxin; Zhu, William; Min, Fan Equivalent characterizations of some graph problems by covering-based rough sets. (English) Zbl 1283.05227 J. Appl. Math. 2013, Article ID 519173, 7 p. (2013). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Huss, Wilfried; Sava, Ecaterina Transience and recurrence of rotor-router walks on directed covers of graphs. (English) Zbl 1252.05035 Electron. Commun. Probab. 17, Paper No. 41, 13 p. (2012); erratum ibid. 19, Paper No. 71, 6 p. (2014). MSC: 05C05 05C70 05C81 82C20 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Zhou, Jin-Xin; Feng, Yan-Quan Edge-transitive cyclic regular covers of the Möbius-Kantor graph. (English) Zbl 1233.05117 Eur. J. Comb. 33, No. 2, 139-147 (2012). MSC: 05C25 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Sampathkumar, R.; Srinivasan, S. Cyclic orthogonal double covers of 4-regular circulant graphs. (English) Zbl 1239.05154 Discrete Math. 311, No. 21, 2417-2422 (2011). MSC: 05C70 05C25 05C78 × Cite Format Result Cite Review PDF Full Text: DOI
Máčajová, Edita; Raspaud, André; Tarsi, Michael; Zhu, Xuding Short cycle covers of graphs and nowhere-zero flows. (English) Zbl 1234.05138 J. Graph Theory 68, No. 4, 340-348 (2011). MSC: 05C38 05C70 05C21 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Benedetti, Bruno; Varbaro, Matteo Unmixed graphs that are domains. (English) Zbl 1232.05178 Commun. Algebra 39, No. 7, 2260-2267 (2011). MSC: 05C70 13A30 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Kuzman, Boštjan Arc-transitive elementary abelian covers of the complete graph \(K_{5}\). (English) Zbl 1208.05113 Linear Algebra Appl. 433, No. 11-12, 1909-1921 (2010). MSC: 05C70 05C25 20B25 × Cite Format Result Cite Review PDF Full Text: DOI
Malmskog, Beth; Manes, Michelle “Almost divisibility” in the Ihara zeta functions of certain ramified covers of \(q+1\)-regular graphs. (English) Zbl 1219.05144 Linear Algebra Appl. 432, No. 10, 2486-2506 (2010). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Sampathkumar, R.; Srinivasan, S. Cyclic orthogonal double covers of complete graphs by some complete multipartite graphs. (English) Zbl 1200.05183 J. Comb. Math. Comb. Comput. 69, 183-189 (2009). MSC: 05C70 × Cite Format Result Cite Review PDF
Wunderlich, Henning On cover-structure graphs. (English) Zbl 1227.05154 Discrete Appl. Math. 157, No. 15, 3289-3299 (2009). MSC: 05C17 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Nowakowski, R. J.; Seyffarth, K. Small cycle double covers of products. II: Categorical and strong products with paths and cycles. (English) Zbl 1179.05090 Graphs Comb. 25, No. 3, 385-400 (2009). MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Manthey, Bodo Minimum-weight cycle covers and their approximability. (English) Zbl 1172.05344 Discrete Appl. Math. 157, No. 7, 1470-1480 (2009). MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI Link
Jukna, S.; Kulikov, A. S. On covering graphs by complete bipartite subgraphs. (English) Zbl 1218.05136 Discrete Math. 309, No. 10, 3399-3403 (2009). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Nutov, Zeev Listing minimal edge-covers of intersecting families with applications to connectivity problems. (English) Zbl 1228.05188 Discrete Appl. Math. 157, No. 1, 112-117 (2009). MSC: 05C35 05C70 05C40 × Cite Format Result Cite Review PDF Full Text: DOI
Lin, Min-Sheng; Chen, Yung-Jui Linear time algorithms for counting the number of minimal vertex covers with minimum/maximum size in an interval graph. (English) Zbl 1185.05138 Inf. Process. Lett. 107, No. 6, 257-264 (2008). MSC: 05C85 05C30 05C35 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Sampathkumar, R.; Sriram, V. Orthogonal \(\sigma\)-labellings of graphs. (English) Zbl 1177.05094 AKCE Int. J. Graphs Comb. 5, No. 1, 57-60 (2008). MSC: 05C70 05C78 × Cite Format Result Cite Review PDF
Imrich, Wilfried; Pisanski, Tomaž Multiple Kronecker covering graphs. (English) Zbl 1168.05359 Eur. J. Comb. 29, No. 5, 1116-1122 (2008). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI arXiv
Nagamochi, Hiroshi; Okada, Kohei Approximating the minmax rooted-tree cover in a tree. (English) Zbl 1184.68646 Inf. Process. Lett. 104, No. 5, 173-178 (2007). MSC: 68W25 68R10 05C85 × Cite Format Result Cite Review PDF Full Text: DOI
Boothe, Peter; Dvořák, Zdeněk; Farley, Arthur M.; Proskurowski, Andrzej Graph covering via shortest paths. (English) Zbl 1137.05056 Congr. Numerantium 187, 145-155 (2007). Reviewer: Jun-Ming Xu (Hefei) MSC: 05C70 05C38 × Cite Format Result Cite Review PDF
Fleischner, Herbert; Genest, François; Jackson, Bill Compatible circuit decompositions of 4-regular graphs. (English) Zbl 1128.05044 J. Graph Theory 56, No. 3, 227-240 (2007). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Couperus, Peter Circulant covers of trivalent circulants. (English) Zbl 1113.05080 Discrete Math. 307, No. 9-10, 1054-1064 (2007). MSC: 05C70 05C25 × Cite Format Result Cite Review PDF Full Text: DOI
Fetter, Hans L. Some basic properties of multiple Hamiltonian covers. (English) Zbl 1096.05032 Discrete Appl. Math. 154, No. 13, 1803-1815 (2006). MSC: 05C45 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Fiala, Jiří; Kratochvíl, Jan; Pór, Attila On the computational complexity of partial covers of theta graphs. (English) Zbl 1203.05152 Feofiloff, Paulo (ed.) et al., Proceedings of GRACO2005. Papers from the 2nd Brazilian symposium on graphs, algorithms, and combinatorics, Angra dos Reis, Brazil, April 27–29, 2005. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 19, 79-85 (2005). MSC: 05C85 05C70 68Q25 × Cite Format Result Cite Review PDF
Horák, Peter; Rosa, Alexander Extended Petersen graphs. (English) Zbl 1073.05056 Discrete Math. 299, No. 1-3, 129-140 (2005). MSC: 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Bläser, Markus; Manthey, Bodo Approximating maximum weight cycle covers in directed graphs with weights zero and one. (English) Zbl 1079.68068 Algorithmica 42, No. 2, 121-139 (2005). MSC: 68R10 05C20 05C70 05C85 68W25 90C27 90C35 90C59 × Cite Format Result Cite Review PDF Full Text: DOI Link
de Caen, D.; Fon-Der-Flaass, D. Distance regular covers of complete graphs from Latin squares. (English) Zbl 1056.05150 Des. Codes Cryptography 34, No. 2-3, 149-153 (2005). MSC: 05E30 05C70 05B15 × Cite Format Result Cite Review PDF Full Text: DOI
Iwai, Shin-ichi; Ogawa, Kenjiro; Tsuchiya, Morimasa A note on bound graphs and clique covers. (English) Zbl 1028.05098 J. Comb. Math. Comb. Comput. 44, 97-101 (2003). Reviewer: H.-J.Presia (Ilmenau) MSC: 05C75 05C69 05C35 05C70 × Cite Format Result Cite Review PDF
Gronau, Hans-Dietrich O. F.; Grüttmüller, Martin; Hartmann, Sven; Leck, Uwe; Leck, Volker On orthogonal double covers of graphs. (English) Zbl 1001.05091 Des. Codes Cryptography 27, No. 1-2, 49-91 (2002). Reviewer: Dalibor Fronček (Duluth) MSC: 05C70 05B05 × Cite Format Result Cite Review PDF Full Text: DOI
Scott, A. D. On induced subgraphs with all degree odd. (English) Zbl 1010.05066 Graphs Comb. 17, No. 3, 539-553 (2001). MSC: 05C70 05C80 × Cite Format Result Cite Review PDF Full Text: DOI
Nakagawa, Nobuo On strongly regular graphs with parameters \((k,0,2)\) and their antipodal double covers. (English) Zbl 0982.05114 Hokkaido Math. J. 30, No. 2, 431-450 (2001). Reviewer: Alexandre A.Makhnev (Ekaterinburg) MSC: 05E30 20B20 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Wei, Erling; Liu, Yanpei Determination of regular embeddings of graphs on surfaces. (English) Zbl 0983.05029 Util. Math. 59, 237-251 (2001). Reviewer: G.Wegner (Dortmund) MSC: 05C10 05C38 05C70 05B15 × Cite Format Result Cite Review PDF
Maxová, Jana; Nešetřil, Jaroslav On oriented path double covers. (English) Zbl 0983.05064 Discrete Math. 233, No. 1-3, 371-380 (2001). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Huck, Andreas On cycle-double covers of graphs of small oddness. (English) Zbl 0982.05081 Discrete Math. 229, No. 1-3, 125-165 (2001). Reviewer: C.Lai (Zhangzhou) MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Feng, Rongquan; Kwak, Jin Ho Some results on covers of complete graphs. (English) Zbl 1041.05059 Chin. Sci. Bull. 45, No. 9, 796-798 (2000). MSC: 05C70 05E30 × Cite Format Result Cite Review PDF Full Text: DOI
Rizzi, Romeo A note on range-restricted circuit covers. (English) Zbl 0963.05114 Graphs Comb. 16, No. 3, 355-358 (2000). MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI Link
Abbott, H. L.; Moon, J. W. On the number of cycle covers of the rectangular grid graph. (English) Zbl 0937.05062 Bull. Inst. Comb. Appl. 27, 41-50 (1999). Reviewer: Ian Wanless (Oxford) MSC: 05C70 × Cite Format Result Cite Review PDF
Hliněný, Petr A note on possible extensions of Negami’s conjecture. (English) Zbl 0934.05105 J. Graph Theory 32, No. 3, 234-240 (1999). Reviewer: Fedor Fomin (St.Peterburg) MSC: 05C70 05C10 × Cite Format Result Cite Review PDF Full Text: DOI
Schumacher, Ulrike Suborthogonal double covers of the complete graph by stars. (English) Zbl 0932.05078 Discrete Appl. Math. 95, No. 1-3, 439-444 (1999). MSC: 05C70 05C05 × Cite Format Result Cite Review PDF Full Text: DOI
Favaron, O.; Li, H.; Plummer, M. D. Some results on \(K_r\)-covered graphs. (English) Zbl 0919.05048 Util. Math. 54, 33-44 (1998). Reviewer: M.Truszczyński (Lexington) MSC: 05C70 05C35 × Cite Format Result Cite Review PDF
Keijsper, J.; Pendavingh, R. An efficient algorithm for minimum-weight bibranching. (English) Zbl 0916.05065 J. Comb. Theory, Ser. B 73, No. 2, 130-145 (1998). Reviewer: Z.Chen (Indianapolis) MSC: 05C85 05C20 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Kahn, Jeff On some hypergraph problems of Paul Erdös and the asymptotics of matchings, covers and colorings. (English) Zbl 0865.05056 Graham, Ronald L. (ed.) et al., The mathematics of Paul Erdős. Vol. I. Berlin: Springer. Algorithms Comb. 13, 345-371 (1997). Reviewer: T.Ishihara (Tokushima) MSC: 05C65 05C70 05C15 × Cite Format Result Cite Review PDF
Bullen, P. S.; Sarkhel, D. N. Properties of derivative-like functions. (English) Zbl 0942.26013 Real Anal. Exch. 22(1996-97), No. 2, 740-759 (1997). Reviewer: Jaroslav Tišer (Praha) MSC: 26A24 × Cite Format Result Cite Review PDF
Klimmek, Regina Small cycle decompositions and small cycle double covers of graphs. (English) Zbl 0899.05053 Berlin: Univ. Berlin, FB Mathematik, 103 p. (1997). MSC: 05C70 05C38 × Cite Format Result Cite Review PDF
Cheriyan, Joseph Randomized \(\widetilde O(M(| V|))\) algorithms for problems in matching theory. (English) Zbl 0885.68119 SIAM J. Comput. 26, No. 6, 1635-1655 (1997). MSC: 68R10 05C85 05C50 05C40 05C70 90C27 × Cite Format Result Cite Review PDF Full Text: DOI
Kahn, Jeff; Kayll, P. Mark Fractional v. integral covers in hypergraphs of bounded edge size. (English) Zbl 0884.05067 J. Comb. Theory, Ser. A 78, No. 2, 199-235 (1997). Reviewer: T.Ishihara (Tokushima) MSC: 05C65 05C70 × Cite Format Result Cite Review PDF Full Text: DOI
Gregory, David A.; Vander Meulen, Kevin N. Sharp bounds for decompositions of graphs into complete \(r\)-partite subgraphs. (English) Zbl 0856.05081 J. Graph Theory 21, No. 4, 393-400 (1996). Reviewer: C.Schulz (Wiesbaden) MSC: 05C70 05C50 05C35 × Cite Format Result Cite Review PDF Full Text: DOI
Heinrich, K.; Horak, P.; Wallis, W.; Yu, Qinglin Perfect double covers with paths of length four. (English) Zbl 0839.05079 J. Graph Theory 21, No. 2, 187-197 (1996). Reviewer: M.Truszczyński (Lexington) MSC: 05C70 05C38 × Cite Format Result Cite Review PDF Full Text: DOI
Billington, Elizabeth J.; Lindner, C. C. The spectrum for \(3\)-perfect \(\lambda\)-fold \(6\)-cycle systems. (English) Zbl 0859.05034 Util. Math. 48, 243-253 (1995). Reviewer: R.N.Mohan (Nuzvid) MSC: 05B30 05C70 × Cite Format Result Cite Review PDF
Schellwat, Holger Induced Cayley graphs and double covers. (English) Zbl 0832.05054 Linear Multilinear Algebra 39, No. 1-2, 161-164 (1995). MSC: 05C25 05C70 05C50 × Cite Format Result Cite Review PDF Full Text: DOI
Huck, Andreas; Kochol, Martin Five cycle double covers of some cubic graphs. (English) Zbl 0820.05045 J. Comb. Theory, Ser. B 64, No. 1, 119-125 (1995). Reviewer: M.Kochol (Bratislava) MSC: 05C38 05C70 05C45 × Cite Format Result Cite Review PDF Full Text: DOI
Kahn, J. Recent results on some not-so-recent hypergraph matching and covering problems. (English) Zbl 0820.05050 Frankl, P. (ed.) et al., Extremal problems for finite sets. Proceedings of the conference, held in Visegrád, Hungary between June 16-21, 1991. Budapest: János Bolyai Mathematical Society. Bolyai Soc. Math. Stud. 3, 305-353 (1994). Reviewer: K.R.Parthasarathy (Narayanapuram) MSC: 05C65 05C70 05D05 60C05 05C35 05B15 × Cite Format Result Cite Review PDF