Cheriyan, J.; Dippel, J.; Grandoni, F.; Khan, A.; Narayan, V. V. The matching augmentation problem: a \(\frac{7}{4}\)-approximation algorithm. (English) Zbl 1452.90309 Math. Program. 182, No. (1-2 (A)), 315-354 (2020). MSC: 90C35 05C85 68W25 90C59 PDF BibTeX XML Cite \textit{J. Cheriyan} et al., Math. Program. 182, No. (1--2 (A)), 315--354 (2020; Zbl 1452.90309) Full Text: DOI
Preißer, Johanna E.; Schmidt, Jens M. Computing vertex-disjoint paths in large graphs using MAOs. (English) Zbl 1436.68256 Algorithmica 82, No. 1, 146-162 (2020). MSC: 68R10 05C38 05C40 05C85 68W40 PDF BibTeX XML Cite \textit{J. E. Preißer} and \textit{J. M. Schmidt}, Algorithmica 82, No. 1, 146--162 (2020; Zbl 1436.68256) Full Text: DOI
Voblyĭ, V. A. The second Riddell relation and its consequences. (Russian, English) Zbl 1438.05132 Diskretn. Anal. Issled. Oper. 26, No. 1, 20-32 (2019); translation in J. Appl. Ind. Math. 13, No. 1, 168-174 (2019). MSC: 05C30 05C78 PDF BibTeX XML Cite \textit{V. A. Voblyĭ}, Diskretn. Anal. Issled. Oper. 26, No. 1, 20--32 (2019; Zbl 1438.05132); translation in J. Appl. Ind. Math. 13, No. 1, 168--174 (2019) Full Text: DOI
Hare, Donovan R. Tools for counting odd cycles in graphs. (English) Zbl 1428.05162 J. Comb. Theory, Ser. B 139, 163-192 (2019). MSC: 05C38 PDF BibTeX XML Cite \textit{D. R. Hare}, J. Comb. Theory, Ser. B 139, 163--192 (2019; Zbl 1428.05162) Full Text: DOI
García Barroso, Evelia R.; González Pérez, Pedro D.; Popescu-Pampu, Patrick; Ruggiero, Matteo Ultrametric properties for valuation spaces of normal surface singularities. (English) Zbl 1439.14018 Trans. Am. Math. Soc. 372, No. 12, 8423-8475 (2019). Reviewer: Aleksandr G. Aleksandrov (Moskva) MSC: 14B05 14J17 32S25 PDF BibTeX XML Cite \textit{E. R. García Barroso} et al., Trans. Am. Math. Soc. 372, No. 12, 8423--8475 (2019; Zbl 1439.14018) Full Text: DOI
Schlipf, Lena; Schmidt, Jens M. Edge-orders. (English) Zbl 1423.68356 Algorithmica 81, No. 5, 1881-1900 (2019). Reviewer: Gunther Schmidt (München) MSC: 68R10 05C85 68W40 PDF BibTeX XML Cite \textit{L. Schlipf} and \textit{J. M. Schmidt}, Algorithmica 81, No. 5, 1881--1900 (2019; Zbl 1423.68356) Full Text: DOI
Schlipf, Lena; Schmidt, Jens M. Simple computation of st-edge- and st-numberings from ear decompositions. (English) Zbl 1451.05232 Inf. Process. Lett. 145, 58-63 (2019). MSC: 05C85 05C30 68R10 68P05 PDF BibTeX XML Cite \textit{L. Schlipf} and \textit{J. M. Schmidt}, Inf. Process. Lett. 145, 58--63 (2019; Zbl 1451.05232) Full Text: DOI
Goodall, Andrew; Krajewski, Thomas; Regts, Guus; Vena, Lluís A Tutte polynomial for maps. (English) Zbl 1402.05107 Comb. Probab. Comput. 27, No. 6, 913-945 (2018). MSC: 05C31 05C10 57M15 PDF BibTeX XML Cite \textit{A. Goodall} et al., Comb. Probab. Comput. 27, No. 6, 913--945 (2018; Zbl 1402.05107) Full Text: DOI arXiv
Smith, Derek A.; Traldi, Lorenzo; Watkins, William Duality and the signed Laplacian matrix of a graph. (English) Zbl 1385.05052 Linear Algebra Appl. 548, 1-18 (2018). MSC: 05C50 05C10 15B36 05C05 05C22 PDF BibTeX XML Cite \textit{D. A. Smith} et al., Linear Algebra Appl. 548, 1--18 (2018; Zbl 1385.05052) Full Text: DOI
Borradaile, Glencora; Le, Hung; Sherman-Bennett, Melissa Large induced acyclic and outerplanar subgraphs of 2-outerplanar graph. (English) Zbl 1380.05032 Graphs Comb. 33, No. 6, 1621-1634 (2017). MSC: 05C10 PDF BibTeX XML Cite \textit{G. Borradaile} et al., Graphs Comb. 33, No. 6, 1621--1634 (2017; Zbl 1380.05032) Full Text: DOI
Horváth, Gábor; Nehaniv, Chrystopher L.; Podoski, Károly The maximal subgroups and the complexity of the flow semigroup of finite (di)graphs. (English) Zbl 06814640 Int. J. Algebra Comput. 27, No. 7, 863-886 (2017). MSC: 20M20 05C20 05C25 20B30 PDF BibTeX XML Cite \textit{G. Horváth} et al., Int. J. Algebra Comput. 27, No. 7, 863--886 (2017; Zbl 06814640) Full Text: DOI
Hammack, Richard H.; Taylor, Dewey T. Proper connection of direct products. (English) Zbl 1372.05112 Discuss. Math., Graph Theory 37, No. 4, 1005-1013 (2017). MSC: 05C38 05C40 05C76 PDF BibTeX XML Cite \textit{R. H. Hammack} and \textit{D. T. Taylor}, Discuss. Math., Graph Theory 37, No. 4, 1005--1013 (2017; Zbl 1372.05112) Full Text: DOI
Shi, Lingsheng; Xu, Hongyu Large induced forests in graphs. (English) Zbl 1368.05034 J. Graph Theory 85, No. 4, 759-779 (2017). MSC: 05C10 05C05 PDF BibTeX XML Cite \textit{L. Shi} and \textit{H. Xu}, J. Graph Theory 85, No. 4, 759--779 (2017; Zbl 1368.05034) Full Text: DOI
De Jesús, José F.; Kelmans, Alexander On graphs uniquely defined by their \(K\)-circular matroids. (English) Zbl 1358.05047 Discrete Appl. Math. 217, Part 3, 474-487 (2017). MSC: 05B35 52B40 PDF BibTeX XML Cite \textit{J. F. De Jesús} and \textit{A. Kelmans}, Discrete Appl. Math. 217, Part 3, 474--487 (2017; Zbl 1358.05047) Full Text: DOI arXiv
Engbers, John; Galvin, David Extremal \(H\)-colorings of trees and 2-connected graphs. (English) Zbl 1350.05033 J. Comb. Theory, Ser. B 122, 800-814 (2017). MSC: 05C15 05C05 PDF BibTeX XML Cite \textit{J. Engbers} and \textit{D. Galvin}, J. Comb. Theory, Ser. B 122, 800--814 (2017; Zbl 1350.05033) Full Text: DOI arXiv
Disser, Yann; Matuschke, Jannik Degree-constrained orientations of embedded graphs. (English) Zbl 1333.05202 J. Comb. Optim. 31, No. 2, 758-773 (2016). MSC: 05C60 05C10 68Q17 PDF BibTeX XML Cite \textit{Y. Disser} and \textit{J. Matuschke}, J. Comb. Optim. 31, No. 2, 758--773 (2016; Zbl 1333.05202) Full Text: DOI
Dinh Van Le Broken circuit complexes of series-parallel networks. (English) Zbl 1321.05037 Eur. J. Comb. 51, 12-36 (2016). MSC: 05B35 PDF BibTeX XML Cite \textit{Dinh Van Le}, Eur. J. Comb. 51, 12--36 (2016; Zbl 1321.05037) Full Text: DOI arXiv
Miltzow, Tillmann; Schmidt, Jens M.; Xia, Mingji Counting \(K_4\)-subdivisions. (English) Zbl 1318.05038 Discrete Math. 338, No. 12, 2387-2392 (2015). MSC: 05C30 05C38 05C40 68Q17 PDF BibTeX XML Cite \textit{T. Miltzow} et al., Discrete Math. 338, No. 12, 2387--2392 (2015; Zbl 1318.05038) Full Text: DOI arXiv
Chen, Yaojun; Cheng, T. C. E.; Zhang, Yunqing; Zhou, Guofei The planar Ramsey number \(\mathrm{PR}(C_4,K_8)\). (English) Zbl 1288.05170 Discrete Appl. Math. 171, 28-34 (2014). MSC: 05C55 05C10 PDF BibTeX XML Cite \textit{Y. Chen} et al., Discrete Appl. Math. 171, 28--34 (2014; Zbl 1288.05170) Full Text: DOI
Chen, Yichao; Gross, Jonathan L.; Hu, Xiaodong Enumeration of digraph embeddings. (English) Zbl 1284.05136 Eur. J. Comb. 36, 660-678 (2014). MSC: 05C30 05C20 05C60 05C45 05C10 PDF BibTeX XML Cite \textit{Y. Chen} et al., Eur. J. Comb. 36, 660--678 (2014; Zbl 1284.05136) Full Text: DOI
Geelen, Jim; Gerards, Bert Characterizing graphic matroids by a system of linear equations. (English) Zbl 1408.05029 J. Comb. Theory, Ser. B 103, No. 5, 642-646 (2013). MSC: 05B35 52B40 PDF BibTeX XML Cite \textit{J. Geelen} and \textit{B. Gerards}, J. Comb. Theory, Ser. B 103, No. 5, 642--646 (2013; Zbl 1408.05029) Full Text: DOI
Bruhn, Henning; Diestel, Reinhard; Kriesell, Matthias; Pendavingh, Rudi; Wollan, Paul Axioms for infinite matroids. (English) Zbl 1279.05013 Adv. Math. 239, 18-46 (2013). MSC: 05B35 PDF BibTeX XML Cite \textit{H. Bruhn} et al., Adv. Math. 239, 18--46 (2013; Zbl 1279.05013) Full Text: DOI arXiv
Goodall, Andrew J.; de Mier, Anna; Noble, Steven D.; Noy, Marc The Tutte polynomial characterizes simple outerplanar graphs. (English) Zbl 1274.05234 Nešetřil, Jarik (ed.) et al., Extended abstracts of the sixth European conference on combinatorics, graph theory and applications, EuroComb 2011, Budapest, Hungary, August 29 – September 2, 2011. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 38, 639-644 (2011). MSC: 05C31 05C10 PDF BibTeX XML Cite \textit{A. J. Goodall} et al., Electron. Notes Discrete Math. 38, 639--644 (2011; Zbl 1274.05234) Full Text: Link
Richter, R. Bruce Graph-like spaces: an introduction. (English) Zbl 1408.05044 Discrete Math. 311, No. 15, 1390-1396 (2011). MSC: 05C10 05C63 05B35 52B40 57M15 PDF BibTeX XML Cite \textit{R. B. Richter}, Discrete Math. 311, No. 15, 1390--1396 (2011; Zbl 1408.05044) Full Text: DOI
Moffatt, Iain A characterization of partially dual graphs. (English) Zbl 1232.05059 J. Graph Theory 67, No. 3, 198-217 (2011). MSC: 05C10 05A19 PDF BibTeX XML Cite \textit{I. Moffatt}, J. Graph Theory 67, No. 3, 198--217 (2011; Zbl 1232.05059) Full Text: DOI arXiv
Matuschke, Jannik; Peis, Britta Lattices and maximum flow algorithms in planar graphs. (English) Zbl 1310.05201 Thilikos, Dimitrios M. (ed.), Graph theoretic concepts in computer science. 36th international workshop, WG 2010, Zarós, Crete, Greece, June 28–30, 2010. Revised papers. Berlin: Springer (ISBN 978-3-642-16925-0/pbk). Lecture Notes in Computer Science 6410, 324-335 (2010). MSC: 05C85 05C10 05C21 06C10 90C59 PDF BibTeX XML Cite \textit{J. Matuschke} and \textit{B. Peis}, Lect. Notes Comput. Sci. 6410, 324--335 (2010; Zbl 1310.05201) Full Text: DOI arXiv
Fourtounelli, Olga; Katerinis, P. The existence of \(k\)-factors in squares of graphs. (English) Zbl 1221.05266 Discrete Math. 310, No. 23, 3351-3358 (2010). MSC: 05C70 05C76 PDF BibTeX XML Cite \textit{O. Fourtounelli} and \textit{P. Katerinis}, Discrete Math. 310, No. 23, 3351--3358 (2010; Zbl 1221.05266) Full Text: DOI
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Regen, Friedrich Packing edge-disjoint cycles in graphs and the cyclomatic number. (English) Zbl 1218.05076 Discrete Math. 310, No. 9, 1456-1462 (2010). MSC: 05C38 PDF BibTeX XML Cite \textit{J. Harant} et al., Discrete Math. 310, No. 9, 1456--1462 (2010; Zbl 1218.05076) Full Text: DOI
Ostrovskii, M. I. Minimum congestion spanning trees in planar graphs. (English) Zbl 1230.05112 Discrete Math. 310, No. 6-7, 1204-1209 (2010). MSC: 05C10 05C05 PDF BibTeX XML Cite \textit{M. I. Ostrovskii}, Discrete Math. 310, No. 6--7, 1204--1209 (2010; Zbl 1230.05112) Full Text: DOI arXiv
Recski, András Matroids – the engineers’ revenge. (English) Zbl 1359.05021 Cook, William J. (ed.) et al., Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer (ISBN 978-3-540-76795-4/hbk). 387-398 (2009). MSC: 05B35 90B10 94Cxx PDF BibTeX XML Cite \textit{A. Recski}, in: Research trends in combinatorial optimization. Papers based on the presentations at the workshop Bonn, Germany, 2008. Dedicated to Bernard Korte on the occasion of the 70th birthday. Berlin: Springer. 387--398 (2009; Zbl 1359.05021) Full Text: DOI
Finbow, Arthur S.; Hartnell, Bert L.; Nowakowski, Richard J.; Plummer, Michael D. On well-covered triangulations. II. (English) Zbl 1209.05166 Discrete Appl. Math. 157, No. 13, 2799-2817 (2009). MSC: 05C69 05C70 PDF BibTeX XML Cite \textit{A. S. Finbow} et al., Discrete Appl. Math. 157, No. 13, 2799--2817 (2009; Zbl 1209.05166) Full Text: DOI
Klemm, Konstantin; Stadler, Peter F. A note on fundamental, non-fundamental, and robust cycle bases. (English) Zbl 1163.92002 Discrete Appl. Math. 157, No. 10, 2432-2438 (2009). MSC: 92B05 05C38 05C90 PDF BibTeX XML Cite \textit{K. Klemm} and \textit{P. F. Stadler}, Discrete Appl. Math. 157, No. 10, 2432--2438 (2009; Zbl 1163.92002) Full Text: DOI
Sun, Yongqi; Yang, Yuansheng; Lin, Xiaohui; Song, Yanan The planar Ramsey number \(PR(C_4,K_7)\). (English) Zbl 1223.05187 Discrete Math. 308, No. 23, 5841-5848 (2008). MSC: 05C55 05C10 PDF BibTeX XML Cite \textit{Y. Sun} et al., Discrete Math. 308, No. 23, 5841--5848 (2008; Zbl 1223.05187) Full Text: DOI
Bland, Robert G.; Dietrich, Brenda L. A unified interpretation of several combinatorial dualities. (English) Zbl 1190.90156 Discrete Optim. 5, No. 2, 337-349 (2008). MSC: 90C27 90C46 PDF BibTeX XML Cite \textit{R. G. Bland} and \textit{B. L. Dietrich}, Discrete Optim. 5, No. 2, 337--349 (2008; Zbl 1190.90156) Full Text: DOI
Liebchen, Christian; Rizzi, Romeo Classes of cycle bases. (English) Zbl 1147.05043 Discrete Appl. Math. 155, No. 3, 337-355 (2007). MSC: 05C38 90C27 PDF BibTeX XML Cite \textit{C. Liebchen} and \textit{R. Rizzi}, Discrete Appl. Math. 155, No. 3, 337--355 (2007; Zbl 1147.05043) Full Text: DOI
Allender, Eric; Mahajan, Meena The complexity of planarity testing. (English) Zbl 1072.68045 Inf. Comput. 189, No. 1, 117-134 (2004). MSC: 68Q15 68Q17 68R10 05C85 05C10 PDF BibTeX XML Cite \textit{E. Allender} and \textit{M. Mahajan}, Inf. Comput. 189, No. 1, 117--134 (2004; Zbl 1072.68045) Full Text: DOI
Huh, Woonghee Tim Finding 2-edge connected spanning subgraphs. (English) Zbl 1044.90084 Oper. Res. Lett. 32, No. 3, 212-216 (2004). MSC: 90C35 05C85 PDF BibTeX XML Cite \textit{W. T. Huh}, Oper. Res. Lett. 32, No. 3, 212--216 (2004; Zbl 1044.90084) Full Text: DOI
Zhang, Heping; Lam, Peter Che Bor; Shiu, Wai Chee Cell rotation graphs of strongly connected orientations of plane graphs with an application. (English) Zbl 1020.05055 Discrete Appl. Math. 130, No. 3, 469-485 (2003). MSC: 05C70 05C45 05C75 05C05 PDF BibTeX XML Cite \textit{H. Zhang} et al., Discrete Appl. Math. 130, No. 3, 469--485 (2003; Zbl 1020.05055) Full Text: DOI
Aldred, R. E. L.; Holton, D. A.; Lou, Dingjun; Saito, Akira \(M\)-alternating paths in \(n\)-extendable bipartite graphs. (English) Zbl 1021.05058 Discrete Math. 269, No. 1-3, 1-11 (2003). Reviewer: Stanislav Jendrol’ (Košice) MSC: 05C38 05C70 PDF BibTeX XML Cite \textit{R. E. L. Aldred} et al., Discrete Math. 269, No. 1--3, 1--11 (2003; Zbl 1021.05058) Full Text: DOI
Woeginger, Gerhard J. Embeddings of planar graphs that minimize the number of long-face cycles. (English) Zbl 1010.90090 Oper. Res. Lett. 30, No. 3, 167-168 (2002). MSC: 90C35 05C35 65Y20 PDF BibTeX XML Cite \textit{G. J. Woeginger}, Oper. Res. Lett. 30, No. 3, 167--168 (2002; Zbl 1010.90090) Full Text: DOI
Nall, Van C. Reduced 2-to-1 maps and decompositions of graphs with no 2-to-1 cut sets. (English) Zbl 1025.54009 Topology Appl. 123, No. 3, 523-532 (2002). Reviewer: L.M.Friedler (Swarthmore) MSC: 54C10 PDF BibTeX XML Cite \textit{V. C. Nall}, Topology Appl. 123, No. 3, 523--532 (2002; Zbl 1025.54009) Full Text: DOI
Richter, R. Bruce; Vitray, R. P. On essential and inessential polygons in embedded graphs. (English) Zbl 1025.05016 J. Comb. Theory, Ser. B 84, No. 1, 100-117 (2002). Reviewer: Arthur T.White (Kalamazoo) MSC: 05C10 PDF BibTeX XML Cite \textit{R. B. Richter} and \textit{R. P. Vitray}, J. Comb. Theory, Ser. B 84, No. 1, 100--117 (2002; Zbl 1025.05016) Full Text: DOI
Lages, Martin Ear decomposition for pair comparison data. (English) Zbl 1015.91018 J. Math. Psychol. 46, No. 1, 19-39 (2002). MSC: 91B06 91B14 05C38 PDF BibTeX XML Cite \textit{M. Lages}, J. Math. Psychol. 46, No. 1, 19--39 (2002; Zbl 1015.91018) Full Text: DOI
Chávez de Diego, M. J.; Villar Liñán, M. T. Triangles \(n\)-connectivity in simplicial 2-complexes. (English) Zbl 1171.05351 Nešetřil, Jaroslav (ed.) et al., Comb01—Euroconference on combinatorics, graph theory and applications. Extended abstracts from the conference, Barcelona, Spain, September 12–15, 2001. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 10, 75-76 (2001). MSC: 05C40 57M20 57Q05 PDF BibTeX XML Cite \textit{M. J. Chávez de Diego} and \textit{M. T. Villar Liñán}, Electron. Notes Discrete Math. 10, 75--76 (2001; Zbl 1171.05351) Full Text: DOI
Franzblau, D. S. Generic rigidity of molecular graphs via ear decomposition. (English) Zbl 0940.05063 Discrete Appl. Math. 101, No. 1-3, 131-155 (2000). Reviewer: G.Melançon (Bordeaux) MSC: 05C85 68R10 PDF BibTeX XML Cite \textit{D. S. Franzblau}, Discrete Appl. Math. 101, No. 1--3, 131--155 (2000; Zbl 0940.05063) Full Text: DOI
Annexstein, Fred; Swaminathan, Ram On testing consecutive-ones property in parallel. (English) Zbl 0936.68111 Discrete Appl. Math. 88, No. 1-3, 7-28 (1998). MSC: 68W05 92B99 PDF BibTeX XML Cite \textit{F. Annexstein} and \textit{R. Swaminathan}, Discrete Appl. Math. 88, No. 1--3, 7--28 (1998; Zbl 0936.68111) Full Text: DOI
Cáceres, E.; Dehne, F.; Ferreira, A.; Flocchini, P.; Rieping, I.; Roncato, A.; Santoro, N.; Song, S. W. Efficient parallel graph algorithms for coarse grained multicomputers and BSP. (English) Zbl 1401.68355 Degano, Pierpaolo (ed.) et al., Automata, languages and programming. 24th international colloquium, ICALP ’97, Bologna, Italy, July 7–11, 1997. Proceedings. Berlin: Springer-Verlag (ISBN 978-3-540-63165-1/pbk; 978-3-540-69194-5/ebook). Lecture Notes in Computer Science 1256, 390-400 (1997). MSC: 68W10 05C85 PDF BibTeX XML Cite \textit{E. Cáceres} et al., Lect. Notes Comput. Sci. 1256, 390--400 (1997; Zbl 1401.68355) Full Text: DOI
Niemeyer, Peter; Watkins, Mark E. Geodetic rays and fibers in one-ended planar graphs. (English) Zbl 0873.05039 J. Comb. Theory, Ser. B 69, No. 2, 142-163 (1997). Reviewer: J.Širáň (Bratislava) MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{P. Niemeyer} and \textit{M. E. Watkins}, J. Comb. Theory, Ser. B 69, No. 2, 142--163 (1997; Zbl 0873.05039) Full Text: DOI
de Werra, D. Extensions of coloring models for scheduling purposes. (English) Zbl 0914.90161 Eur. J. Oper. Res. 92, No. 3, 474-492 (1996). MSC: 90B35 90C27 PDF BibTeX XML Cite \textit{D. de Werra}, Eur. J. Oper. Res. 92, No. 3, 474--492 (1996; Zbl 0914.90161) Full Text: DOI
de Werra, D.; Hoffman, A. J.; Mahadev, N. V. R.; Peled, U. N. Restrictions and preassignments in preemptive open shop scheduling. (English) Zbl 0846.90056 Discrete Appl. Math. 68, No. 1-2, 169-188 (1996). MSC: 90B35 05C15 PDF BibTeX XML Cite \textit{D. de Werra} et al., Discrete Appl. Math. 68, No. 1--2, 169--188 (1996; Zbl 0846.90056) Full Text: DOI
Bonnington, C. Paul; Imrich, Wilfried; Watkins, Mark E. Separating double rays in locally finite planar graphs. (English) Zbl 0843.05021 Discrete Math. 145, No. 1-3, 61-72 (1995). Reviewer: H.A.Jung (Berlin) MSC: 05C10 05C75 05C25 05C40 PDF BibTeX XML Cite \textit{C. P. Bonnington} et al., Discrete Math. 145, No. 1--3, 61--72 (1995; Zbl 0843.05021) Full Text: DOI
Negami, Seiya; Kawagoe, Kenichi Polynomial invariants of graphs with state models. (English) Zbl 0842.05091 Discrete Appl. Math. 56, No. 2-3, 323-331 (1995). Reviewer: J.G.Oxley (Baton Rouge) MSC: 05C99 05C15 PDF BibTeX XML Cite \textit{S. Negami} and \textit{K. Kawagoe}, Discrete Appl. Math. 56, No. 2--3, 323--331 (1995; Zbl 0842.05091) Full Text: DOI
Ramachandran, Vijaya; Reif, John Planarity testing in parallel. (English) Zbl 0938.68948 J. Comput. Syst. Sci. 49, No. 3, 517-561 (1994). MSC: 68W10 68R10 PDF BibTeX XML Cite \textit{V. Ramachandran} and \textit{J. Reif}, J. Comput. Syst. Sci. 49, No. 3, 517--561 (1994; Zbl 0938.68948) Full Text: DOI
Gautier, Antoine; Granot, Frieda On the equivalence of constrained and unconstrained flows. (English) Zbl 0830.90045 Discrete Appl. Math. 55, No. 2, 113-132 (1994). Reviewer: A.Girard (Verdun / Quebec) MSC: 90B10 90C08 90C35 PDF BibTeX XML Cite \textit{A. Gautier} and \textit{F. Granot}, Discrete Appl. Math. 55, No. 2, 113--132 (1994; Zbl 0830.90045) Full Text: DOI
Liu, Yanpei A polyhedral theory on graphs. (English) Zbl 0812.05017 Acta Math. Sin., New Ser. 10, No. 2, 136-142 (1994). Reviewer: M.Škoviera (Bratislava) MSC: 05C10 57M15 PDF BibTeX XML Cite \textit{Y. Liu}, Acta Math. Sin., New Ser. 10, No. 2, 136--142 (1994; Zbl 0812.05017) Full Text: DOI
Easwarakumar, K. S.; Rangan, C. Pandu; Cheston, G. A. A linear algorithm for centering a spanning tree of a biconnected graph. (English) Zbl 0799.68144 Inf. Process. Lett. 51, No. 3, 121-124 (1994). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{K. S. Easwarakumar} et al., Inf. Process. Lett. 51, No. 3, 121--124 (1994; Zbl 0799.68144) Full Text: DOI
Kao, Ming-Yang; Klein, Philip N. Towards overcoming the transitive-closure bottleneck: Efficient parallel algorithms for planar digraphs. (English) Zbl 0795.68086 J. Comput. Syst. Sci. 47, No. 3, 459-500 (1993). MSC: 68W15 68R10 68Q25 PDF BibTeX XML Cite \textit{M.-Y. Kao} and \textit{P. N. Klein}, J. Comput. Syst. Sci. 47, No. 3, 459--500 (1993; Zbl 0795.68086) Full Text: DOI
Heath, Lenwood S.; Paripati, Praveen K.; Roach, John W. Representing polyhedra: Faces are better than vertices. (English) Zbl 0801.68170 Comput. Geom. 3, No. 6, 327-351 (1993). MSC: 68U07 68U05 PDF BibTeX XML Cite \textit{L. S. Heath} et al., Comput. Geom. 3, No. 6, 327--351 (1993; Zbl 0801.68170) Full Text: DOI
Cimikowski, Robert J. On certain Hamiltonian inner triangulations. (English) Zbl 0785.05062 Discrete Appl. Math. 43, No. 3, 185-195 (1993). Reviewer: N.F.Quimpo (Manila) MSC: 05C45 05C10 05C38 68Q25 05C85 68R10 PDF BibTeX XML Cite \textit{R. J. Cimikowski}, Discrete Appl. Math. 43, No. 3, 185--195 (1993; Zbl 0785.05062) Full Text: DOI
Chen, Jianer; Gross, Jonathan L. Limit points for average genus. I: 3-connected and 2-connected simplicial graphs. (English) Zbl 0709.05017 J. Comb. Theory, Ser. B 55, No. 1, 83-103 (1992). Reviewer: J.Chen MSC: 05C10 PDF BibTeX XML Cite \textit{J. Chen} and \textit{J. L. Gross}, J. Comb. Theory, Ser. B 55, No. 1, 83--103 (1992; Zbl 0709.05017) Full Text: DOI
Watkins, Mark E. Some conditions for 1-transitivity. (English) Zbl 0803.05018 Discrete Math. 109, No. 1-3, 289-296 (1992). Reviewer: C.Thomassen (Lyngby) MSC: 05C10 PDF BibTeX XML Cite \textit{M. E. Watkins}, Discrete Math. 109, No. 1--3, 289--296 (1992; Zbl 0803.05018) Full Text: DOI
Bienstock, D.; Dean, N. On obstructions to small face covers in planar graphs. (English) Zbl 0781.05014 J. Comb. Theory, Ser. B 55, No. 2, 163-189 (1992). Reviewer: C.Thomassen (Lyngby) MSC: 05C10 05C70 PDF BibTeX XML Cite \textit{D. Bienstock} and \textit{N. Dean}, J. Comb. Theory, Ser. B 55, No. 2, 163--189 (1992; Zbl 0781.05014) Full Text: DOI
Eppstein, David Parallel recognition of series-parallel graphs. (English) Zbl 0754.68056 Inf. Comput. 98, No. 1, 41-55 (1992). MSC: 68W15 68R10 68Q25 PDF BibTeX XML Cite \textit{D. Eppstein}, Inf. Comput. 98, No. 1, 41--55 (1992; Zbl 0754.68056) Full Text: DOI
Kanevsky, Arkady; Ramachandran, Vijaya Improved algorithms for graph four-connectivity. (English) Zbl 0731.68086 J. Comput. Syst. Sci. 42, No. 3, 288-306 (1991). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{A. Kanevsky} and \textit{V. Ramachandran}, J. Comput. Syst. Sci. 42, No. 3, 288--306 (1991; Zbl 0731.68086) Full Text: DOI
Watkins, Mark E. Edge-transitive strips. (English) Zbl 0756.05093 Discrete Math. 95, No. 1-3, 359-372 (1991). Reviewer: J.Širáň (Bratislava) MSC: 05C75 05C10 05C25 PDF BibTeX XML Cite \textit{M. E. Watkins}, Discrete Math. 95, No. 1--3, 359--372 (1991; Zbl 0756.05093) Full Text: DOI
Hartvigsen, David; Mardon, Russell Cycle bases from orderings and coverings. (English) Zbl 0761.05057 Discrete Math. 94, No. 2, 81-94 (1991). Reviewer: Linda Lesniak Foster (Madison) MSC: 05C38 05C75 05C70 PDF BibTeX XML Cite \textit{D. Hartvigsen} and \textit{R. Mardon}, Discrete Math. 94, No. 2, 81--94 (1991; Zbl 0761.05057) Full Text: DOI
Fussell, Donald; Thurimella, Ramakrishna Successive approximation in parallel graph algorithms. (English) Zbl 0701.68046 Theor. Comput. Sci. 74, No. 1, 19-35 (1990). MSC: 68Q25 68Q05 68R10 PDF BibTeX XML Cite \textit{D. Fussell} and \textit{R. Thurimella}, Theor. Comput. Sci. 74, No. 1, 19--35 (1990; Zbl 0701.68046) Full Text: DOI
Lins, Sóstenes On the fundamental group of 3-gems and a ‘planar’ class of 3-manifolds. (English) Zbl 0672.57013 Eur. J. Comb. 9, No. 4, 291-305 (1988). MSC: 57N10 57M15 05C15 PDF BibTeX XML Cite \textit{S. Lins}, Eur. J. Comb. 9, No. 4, 291--305 (1988; Zbl 0672.57013) Full Text: DOI
Klein, Philip N.; Reif, John H. An efficient parallel algorithm for planarity. (English) Zbl 0662.68073 J. Comput. Syst. Sci. 37, No. 2, 190-246 (1988). Reviewer: G.Slutzki MSC: 68R10 05C10 PDF BibTeX XML Cite \textit{P. N. Klein} and \textit{J. H. Reif}, J. Comput. Syst. Sci. 37, No. 2, 190--246 (1988; Zbl 0662.68073) Full Text: DOI
Maon, Yael; Schieber, Baruch; Vishkin, Uzi Parallel ear decomposition search (EDS) and st-numbering in graphs. (English) Zbl 0632.68066 Theor. Comput. Sci. 47, 277-298 (1986). MSC: 68R10 PDF BibTeX XML Cite \textit{Y. Maon} et al., Theor. Comput. Sci. 47, 277--298 (1986; Zbl 0632.68066) Full Text: DOI
Seymour, P. D. Triples in matroid circuits. (English) Zbl 0608.05023 Eur. J. Comb. 7, 177-185 (1986). Reviewer: J.G.Oxley MSC: 05B35 05C38 05C40 PDF BibTeX XML Cite \textit{P. D. Seymour}, Eur. J. Comb. 7, 177--185 (1986; Zbl 0608.05023) Full Text: DOI
Thomassen, Carsten Duality of infinite graphs. (English) Zbl 0501.05054 J. Comb. Theory, Ser. B 33, 137-160 (1982). MSC: 05C99 05C40 PDF BibTeX XML Cite \textit{C. Thomassen}, J. Comb. Theory, Ser. B 33, 137--160 (1982; Zbl 0501.05054) Full Text: DOI
Lins, Sostenes Graph-encoded maps. (English) Zbl 0465.05031 J. Comb. Theory, Ser. B 32, 171-181 (1982). MSC: 05C10 05C15 PDF BibTeX XML Cite \textit{S. Lins}, J. Comb. Theory, Ser. B 32, 171--181 (1982; Zbl 0465.05031) Full Text: DOI
Lehel, J. Deltahedra are realizable as simplicial convex polyhedra. (English) Zbl 0434.05027 Discrete Appl. Math. 2, 81-84 (1980). MSC: 05C10 52Bxx 05C35 PDF BibTeX XML Cite \textit{J. Lehel}, Discrete Appl. Math. 2, 81--84 (1980; Zbl 0434.05027) Full Text: DOI
Cantalupi, Gabriella Tazzi Sulla tracciabilita’ di grafi finiti su superficie compatte. (Italian) Zbl 0446.05018 Rend. Sem. Mat. Fis. Milano 48, 87-103 (1978). MSC: 05C10 05C38 PDF BibTeX XML Cite \textit{G. T. Cantalupi}, Rend. Semin. Mat. Fis. Milano 48, 87--103 (1978; Zbl 0446.05018) Full Text: DOI
Hobbs, Arthur M.; Mitchem, John The entire graph of a bridgeless connected plane graph is Hamiltonian. (English) Zbl 0344.05134 Discrete Math. 16, 233-239 (1976). MSC: 05C35 PDF BibTeX XML Cite \textit{A. M. Hobbs} and \textit{J. Mitchem}, Discrete Math. 16, 233--239 (1976; Zbl 0344.05134) Full Text: DOI
Wilson, Richard M. Graph puzzles, homotopy, and the alternating group. (English) Zbl 0285.05110 J. Comb. Theory, Ser. B 16, 86-96 (1974). MSC: 05C25 20B25 PDF BibTeX XML Cite \textit{R. M. Wilson}, J. Comb. Theory, Ser. B 16, 86--96 (1974; Zbl 0285.05110) Full Text: DOI
Abe, Norihiro; Mizumoto, Masaharu; Toyoda, Jun-ichi; Tanaka, Kohkichi Web grammars and several graphs. (English) Zbl 0253.68013 J. Comput. Syst. Sci. 7, 37-65 (1973). MSC: 68Q45 PDF BibTeX XML Cite \textit{N. Abe} et al., J. Comput. Syst. Sci. 7, 37--65 (1973; Zbl 0253.68013) Full Text: DOI
Fleischner, Herbert The uniquely embeddable planar graphs. (English) Zbl 0253.05110 Discrete Math. 4, 347-358 (1973). MSC: 05C10 57M15 05C35 PDF BibTeX XML Cite \textit{H. Fleischner}, Discrete Math. 4, 347--358 (1973; Zbl 0253.05110) Full Text: DOI
Bognar, M. Über Kategorien mit Involution. (German) Zbl 0249.18016 Acta Math. Acad. Sci. Hung. 23, 147-174 (1972). MSC: 18E99 18D99 PDF BibTeX XML Cite \textit{M. Bognar}, Acta Math. Acad. Sci. Hung. 23, 147--174 (1972; Zbl 0249.18016) Full Text: DOI
Chan, S.-P. Application of graph theory to the synthesis of single-contact networks. (English) Zbl 0196.51901 J. Franklin Inst. 280, 425-442 (1965). PDF BibTeX XML Cite \textit{S. P. Chan}, J. Franklin Inst. 280, 425--442 (1965; Zbl 0196.51901) Full Text: DOI
Yau, S. S. A generalization of the cut-set. (English) Zbl 0138.19302 J. Franklin Inst. 273, 31-48 (1962). PDF BibTeX XML Cite \textit{S. S. Yau}, J. Franklin Inst. 273, 31--48 (1962; Zbl 0138.19302) Full Text: DOI
Hakimi, S. L. Graphs with two kinds of elements. (English) Zbl 0138.19301 J. Franklin Inst. 270, 451-467 (1960). PDF BibTeX XML Cite \textit{S. L. Hakimi}, J. Franklin Inst. 270, 451--467 (1960; Zbl 0138.19301) Full Text: DOI