J. Harant

Publications80
h-index16
Citations980
Highly Influential Citations55
Claim Author Page
Author pages are created from data sourced from our academic publisher partnerships and public sources.

Recommended Authors

  • S. Jendrol’
  • 165 Publications • 1,953 Citations
  • V. Lozin
  • 217 Publications • 3,193 Citations
  • Igor Fabrici
  • 27 Publications • 355 Citations
  • I. Schiermeyer
  • 193 Publications • 2,265 Citations
  • Publications
  • Influence
On Double Domination in Graphs
TLDR
If G has order n with minimum degree ‐ and average degree d, then ∞£2(G) • ((ln(1 + d) + ln‐ + 1)=‐)n, where the minimum is taken over the n-dimensional cube C n.
View via Publisher
On Domination in Graphs
TLDR
It is proved that their optimum values equal the domination number γ of G, and an efficient approximation method is developed and known upper bounds on γ are slightly improved.
View PDF
Nonrepetitive vertex colorings of graphs
View via Publisher
On Dominating Sets and Independent Sets of Graphs
TLDR
The approach yields an improvement of an upper bound for the domination number found by N. Alon and J. H. Spencer, and it is proved that γk(G) = min fk(p), where the minimum is taken over the n-dimensional cube Cn.
View on Cambridge Press
Some news about the independence number of a graph
  • J. Harant
  • Mathematics
    Discuss. Math. Graph Theory
  • 2000
For a finite undirected graph G on n vertices some continuous optimization problems taken over the n-dimensional cube are presented and it is proved that their optimum values equal the independence…
View PDF
On the radius of graphs
View via Publisher
On cycles through specified vertices
View via Publisher
Non-hamiltonian 4/5-tough maximal planar graphs
View via Publisher
Menger's Theorem
TLDR
A short and elementary proof of a more general theorem is given of Menger's Theorem for digraphs, which states that for any two vertex sets A and B of a digraph D such that A cannot be separated from B by a set of at most t vertices, there are t + 1 disjoint A-B- paths in D.
View on Wiley
A lower bound on the independence number of a graph
  • J. Harant
  • Mathematics, Computer Science
    Discret. Math.
  • 28 June 1998
View via Publisher
...
...