Jochen Harant

From MaRDI portal
Person:327689

Available identifiers

zbMath Open harant.jochenMaRDI QIDQ327689

List of research outcomes





PublicationDate of PublicationType
Rooted minors and locally spanning subgraphs2024-01-24Paper
Spanning trees of smallest maximum degree in subdivisions of graphs2022-10-10Paper
Long cycles and spanning subgraphs of locally maximal 1‐planar graphs2022-03-31Paper
Circumference of essentially 4-connected planar triangulations2021-03-29Paper
New bounds on domination and independence in graphs2020-08-28Paper
Lightweight paths in graphs2020-04-22Paper
On the Circumference of Essentially 4-connected Planar Graphs2020-01-22Paper
Longer cycles in essentially 4-connected planar graphs2020-01-08Paper
On Selkow's bound on the independence number of graphs2019-05-27Paper
In memoriam: Horst Sachs (1927--2016)2017-09-05Paper
Locally Dense Independent Sets in Regular Graphs of Large Girth—An Example of a New Approach2017-04-07Paper
On longest cycles in essentially 4-connected planar graphs2017-02-14Paper
Lower bounds on the sum choice number of a graph2016-10-19Paper
On longest cycles in essentially 4-connected planar graphs2016-07-13Paper
Maximum weighted induced subgraphs2016-04-27Paper
A note on adjacent vertex distinguishing colorings of graphs2016-04-07Paper
A new eigenvalue bound for independent sets2015-06-01Paper
Eigenvalue conditions for induced subgraphs2015-05-11Paper
A note on vertex colorings of plane graphs2014-11-18Paper
On degree sums of a triangle-free graph2014-10-31Paper
An upper bound on the sum of powers of the degrees of simple 1-planar graphs2014-05-05Paper
Prescribed edges and forbidden edges for a cycle in a planar graph2014-04-16Paper
A note on Barnette's conjecture2013-12-13Paper
The potential of greed for independence2012-11-23Paper
Closures, cycles, and paths2012-06-13Paper
Nonrepetitive vertex colorings of graphs2012-01-11Paper
A lower bound on independence in terms of degrees2011-06-28Paper
Upper bounds on the sum of powers of the degrees of a simple planar graph2011-06-07Paper
Independence in connected graphs2011-01-14Paper
Random procedures for dominating sets in bipartite graphs2010-12-08Paper
Random procedures for dominating sets in graphs2010-08-12Paper
Packing disjoint cycles over vertex cuts2010-05-28Paper
On F-independence in graphs2010-05-14Paper
Packing edge-disjoint cycles in graphs and the cyclomatic number2010-05-05Paper
Hamiltonian cycles through prescribed edges of 4-connected maximal planar graphs2010-05-05Paper
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs2009-12-15Paper
On long cycles through four prescribed vertices of a polyhedral graph2009-06-23Paper
The independence number in graphs of maximum degree three2009-01-28Paper
Domination in bipartite graphs2009-01-28Paper
https://portal.mardi4nfdi.de/entity/Q35342672008-11-03Paper
Paths of low weight in planar graphs2008-09-29Paper
A lower bound on the independence number of a graph in terms of degrees2008-01-18Paper
On the existence of specific stars in planar graphs2007-12-10Paper
On a cycle through a specified linear forest of a graph2007-03-02Paper
On cycles through specified vertices2006-06-30Paper
On Double Domination in Graphs2005-09-12Paper
On Domination in Graphs2005-09-12Paper
https://portal.mardi4nfdi.de/entity/Q48258472004-11-05Paper
On short cycles through prescribed vertices of a graph2004-10-01Paper
On paths and cycles through specified vertices2004-10-01Paper
A note on domination in bipartite graphs2003-11-17Paper
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set2002-12-02Paper
Menger's theorem2002-07-22Paper
A note on the domination number of a bipartite graph2002-06-16Paper
Separating 3-cycles in plane triangulations2002-04-16Paper
On the independence number of a graph in terms of order and size2001-07-12Paper
On weights of induced paths and cycles in claw-free and \(K_{1,r}\)-free graphs2001-07-08Paper
On Dominating Sets and Independent Sets of Graphs2001-04-20Paper
Some news about the independence number of a graph2000-12-20Paper
A lower bound on the independence number of a graph2000-11-02Paper
On Hamiltonian cycles in 4- and 5-connected plane triangulations2000-11-02Paper
A planarity criterion for cubic bipartite graphs2000-11-02Paper
On \(3\)-connected plane graphs without triangular faces2000-06-25Paper
On certain Hamiltonian cycles in planar graphs2000-02-23Paper
More than one tough chordal planar graphs are Hamiltonian2000-02-15Paper
https://portal.mardi4nfdi.de/entity/Q48824771997-02-26Paper
5-regular 3-polytopal graphs with edges of only two types and shortness exponents less than one1996-09-01Paper
Non-hamiltonian \(5 \over 4\)-tough maximal planar graphs1996-03-24Paper
A lower bound for the shortness coefficient of a class of graphs1995-01-02Paper
An upper bound for the radius of a 3-connected graph1994-05-19Paper
Toughness and nonhamiltonicity of polyhedral graphs1993-06-29Paper
https://portal.mardi4nfdi.de/entity/Q57508851990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q57539801990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q47338801989-01-01Paper
Some new results about the shortness exponent in polyhedral graphs1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30290311986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37277571986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37354661985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32179201984-01-01Paper
Ein partitionierungsalgorithmus zur distanzberechnung auf Verkehrsnetzen1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q36744191983-01-01Paper
On the radius of graphs1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39150051981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41892961979-01-01Paper

Research outcomes over time

This page was built for person: Jochen Harant