Horst Sachs

Known as: Sachs 
Horst Sachs (27 March 1927 – 25 April 2016) was a German mathematician, an expert in graph theory, a recipient of the Euler Medal (2000). He earned… (More)
Wikipedia

Topic mentions per year

Topic mentions per year

1995-2018
012319952018

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2017
2017
While preparing the present issue in honour of Horst Sachs’ 90th birthday, we have been caught up by reality: Horst Sachs passed… (More)
Is this relevant?
Review
2017
Review
2017
  • Shunqing Cao, Zhoukun Han
  • 2017
In their article "The Theoretical Basis and Framework of Variation Theory" Shunqing Cao and Zhoukun Han re-examine the… (More)
Is this relevant?
2016
2016
Prof. Dr. phil. Thomas Beddies, Berlin PD Dr. Rolf Helmut Beetz, Mainz Dr. Marcus Benz, Dachau Prof. Dr. Reinhard Berner, Dresden… (More)
Is this relevant?
2013
2013
where s is a Sachs graph (as defined in 3 ) , Sn is the set of all Sachs graphs with n vertices, c(s) is the number of… (More)
  • table 1
Is this relevant?
2008
2008
Let G be a 4-regular planar graph and suppose that G has a cycle decomposition S (i.e., each edge of G is in exactly one cycle of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • table I
Is this relevant?
Review
2007
Review
2007
Data on the prevalence of bone cancer in dinosaurs is available from past radiological examination of preserved bones. We… (More)
  • table 1
Is this relevant?
Review
2006
Review
2006
The acquisition of word meaning is often partially attributed to fast mapping. However, recent research suggests that fast… (More)
  • figure 1
  • figure 2
  • figure 4
  • figure 3
  • figure 5
Is this relevant?
2005
2005
BY SERGEI PETROVSKII, HORST MALCHOW AND BAI-LIAN LI Shirshov Institute of Oceanology, Russian Academy of Science, Nakhimovsky… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1997
1997
A (vertex) k-ranking of a graph G = (V; E) is a proper vertex coloring ' : V ! f1; : : : ; kg such that each path with… (More)
Is this relevant?
1997
1997
A semicomplete multipartite digraph is obtained by replacing each edge of a complete multipartite graph by an arc or by a pair of… (More)
Is this relevant?