Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. Circumference of essentially 4-connected planar triangulations. (English) Zbl 1457.05108 J. Graph Algorithms Appl. 25, No. 1, 121-132 (2021). MSC: 05C85 PDFBibTeX XMLCite \textit{I. Fabrici} et al., J. Graph Algorithms Appl. 25, No. 1, 121--132 (2021; Zbl 1457.05108) Full Text: DOI arXiv
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. On the circumference of essentially 4-connected planar graphs. (English) Zbl 1433.05085 J. Graph Algorithms Appl. 24, No. 1, 21-46 (2020). Reviewer: Stelian Mihalas (Timişoara) MSC: 05C10 05C40 05C35 05C12 PDFBibTeX XMLCite \textit{I. Fabrici} et al., J. Graph Algorithms Appl. 24, No. 1, 21--46 (2020; Zbl 1433.05085) Full Text: DOI arXiv
Fabrici, Igor; Harant, Jochen; Mohr, Samuel; Schmidt, Jens M. Longer cycles in essentially 4-connected planar graphs. (English) Zbl 1430.05061 Discuss. Math., Graph Theory 40, No. 1, 269-277 (2020). MSC: 05C38 05C10 05C12 05C40 PDFBibTeX XMLCite \textit{I. Fabrici} et al., Discuss. Math., Graph Theory 40, No. 1, 269--277 (2020; Zbl 1430.05061) Full Text: DOI arXiv
Harant, Jochen; Jendrol’, Stanislav Lightweight paths in graphs. (English) Zbl 1437.05091 Opusc. Math. 39, No. 6, 829-837 (2019). MSC: 05C22 05C38 PDFBibTeX XMLCite \textit{J. Harant} and \textit{S. Jendrol'}, Opusc. Math. 39, No. 6, 829--837 (2019; Zbl 1437.05091) Full Text: DOI
Harant, Jochen; Fabrici, Igor; Jendrol’, Stanislav On longest cycles in essentially 4-connected planar graphs. (English) Zbl 1356.05036 Ceselli, Alberto (ed.) et al., Extended abstracts of the 14th Cologne-Twente workshop on graphs and combinatorial optimization (CTW’16), Gargnano, Italy, June 6–8, 2016. Amsterdam: Elsevier. Electronic Notes in Discrete Mathematics 55, 143-146 (2016). MSC: 05C12 05C38 05C40 05C10 PDFBibTeX XMLCite \textit{J. Harant} et al., Electron. Notes Discrete Math. 55, 143--146 (2016; Zbl 1356.05036) Full Text: DOI Link
Fabrici, Igor; Harant, Jochen; Jendrol’, Stanislav On longest cycles in essentially 4-connected planar graphs. (English) Zbl 1339.05073 Discuss. Math., Graph Theory 36, No. 3, 565-575 (2016). MSC: 05C10 05C38 05C40 05C12 PDFBibTeX XMLCite \textit{I. Fabrici} et al., Discuss. Math., Graph Theory 36, No. 3, 565--575 (2016; Zbl 1339.05073) Full Text: DOI
Axenovich, M.; Harant, J.; Przybyło, J.; Soták, R.; Voigt, M.; Weidelich, J. A note on adjacent vertex distinguishing colorings of graphs. (English) Zbl 1333.05101 Discrete Appl. Math. 205, 1-7 (2016). MSC: 05C15 05C78 PDFBibTeX XMLCite \textit{M. Axenovich} et al., Discrete Appl. Math. 205, 1--7 (2016; Zbl 1333.05101) Full Text: DOI
Fabrici, Igor; Harant, Jochen; Jendrol’, Stanislav; Soták, Roman A note on vertex colorings of plane graphs. (English) Zbl 1303.05037 Discuss. Math., Graph Theory 34, No. 4, 849-855 (2014). MSC: 05C10 05C15 PDFBibTeX XMLCite \textit{I. Fabrici} et al., Discuss. Math., Graph Theory 34, No. 4, 849--855 (2014; Zbl 1303.05037) Full Text: DOI
Brandt, Stephan; Harant, Jochen; Naumann, Steffi On degree sums of a triangle-free graph. (English) Zbl 1301.05072 Discrete Math. 337, 76-82 (2014). MSC: 05C07 05C15 PDFBibTeX XMLCite \textit{S. Brandt} et al., Discrete Math. 337, 76--82 (2014; Zbl 1301.05072) Full Text: DOI
Czap, Július; Harant, Jochen; Hudák, Dávid An upper bound on the sum of powers of the degrees of simple 1-planar graphs. (English) Zbl 1288.05051 Discrete Appl. Math. 165, 146-151 (2014). MSC: 05C10 05C07 PDFBibTeX XMLCite \textit{J. Czap} et al., Discrete Appl. Math. 165, 146--151 (2014; Zbl 1288.05051) Full Text: DOI
Harant, Jochen; Jendrol’, Stanislav Nonrepetitive vertex colorings of graphs. (English) Zbl 1233.05103 Discrete Math. 312, No. 2, 374-380 (2012). MSC: 05C15 05C10 PDFBibTeX XMLCite \textit{J. Harant} and \textit{S. Jendrol'}, Discrete Math. 312, No. 2, 374--380 (2012; Zbl 1233.05103) Full Text: DOI
Harant, Jochen; Rautenbach, Dieter; Recht, Peter; Schiermeyer, Ingo; Sprengel, Eva-Maria Packing disjoint cycles over vertex cuts. (English) Zbl 1222.05121 Discrete Math. 310, No. 13-14, 1974-1978 (2010). MSC: 05C38 05C40 PDFBibTeX XMLCite \textit{J. Harant} et al., Discrete Math. 310, No. 13--14, 1974--1978 (2010; Zbl 1222.05121) Full Text: DOI Link
Harant, Jochen; Jendrol’, Stanislav On the existence of specific stars in planar graphs. (English) Zbl 1140.05020 Graphs Comb. 23, No. 5, 529-543 (2007). Reviewer: Reinhardt Euler (Brest) MSC: 05C10 05C38 52B10 05C60 PDFBibTeX XMLCite \textit{J. Harant} and \textit{S. Jendrol'}, Graphs Comb. 23, No. 5, 529--543 (2007; Zbl 1140.05020) Full Text: DOI
Harant, J.; Voigt, M.; Jendrol, S.; Randerath, B.; Ryjáček, A.; Schiermeyer, I. On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs. (English) Zbl 0969.05038 J. Graph Theory 36, No. 3, 131-143 (2001). Reviewer: N.F.Quimpo (Manila) MSC: 05C38 05C35 PDFBibTeX XMLCite \textit{J. Harant} et al., J. Graph Theory 36, No. 3, 131--143 (2001; Zbl 0969.05038) Full Text: DOI
Harant, J.; Jendrol’, S.; Tkáč, M. On \(3\)-connected plane graphs without triangular faces. (English) Zbl 1027.05030 J. Comb. Theory, Ser. B 77, No. 1, 150-161 (1999). MSC: 05C10 05C38 PDFBibTeX XMLCite \textit{J. Harant} et al., J. Comb. Theory, Ser. B 77, No. 1, 150--161 (1999; Zbl 1027.05030) Full Text: DOI
Harant, J.; Owens, P. J.; Tkáč, M.; Walther, H. 5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one. (English) Zbl 0852.05056 Discrete Math. 150, No. 1-3, 143-153 (1996). Reviewer: Ma Zhongfan (Beijing) MSC: 05C35 PDFBibTeX XMLCite \textit{J. Harant} et al., Discrete Math. 150, No. 1--3, 143--153 (1996; Zbl 0852.05056) Full Text: DOI
Harant, J.; Walther, H. A lower bound for the shortness coefficient of a class of graphs. (English) Zbl 0803.05019 Discrete Appl. Math. 51, No. 1-2, 103-105 (1994). Reviewer: Z.Chen (Indianapolis) MSC: 05C10 05C35 05C38 PDFBibTeX XMLCite \textit{J. Harant} and \textit{H. Walther}, Discrete Appl. Math. 51, No. 1--2, 103--105 (1994; Zbl 0803.05019) Full Text: DOI