Ladislav Stacho

2010

A researcher in the Science corpus: 1 paper; trusts 1 researcher and is trusted by 1 researcher here, as inferred from the citation graph.

Whom Ladislav Stacho trusts overall

Their strongest outbound trust, strongest first, inferred from their citations.

  1. Tom Bohman

Who trusts Ladislav Stacho overall

  1. Joseph A. Gallian

Papers from Ladislav Stacho's perspective

Ordered by how strongly the researchers Ladislav Stacho trusts endorse each paper. Same corpus, a different order for every researcher.

  1. The triangle-free process
  2. PEARLS in GRAPH THEORY
  3. A bound on the chromatic number using the longest odd cycle length
  4. The n-ordered graphs: A new graph class
  5. Upper bounds to the clique width of graphs (Discrete Applied Mathematics)
  6. Approximating clique-width and branch-width (J. Comb. Theory B)
  7. An extremal problem for H -linked graphs
  8. Network structure and minimum degree
  9. Directed Tree-Width (J. Comb. Theory B)
  10. Efficient graph representations (Fields Institute Monographs)

Their papers