Friedrich Regen

According to our database1, Friedrich Regen authored at least 12 papers between 2009 and 2013.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of two.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2013
On the Cycle Spectrum of Cubic Hamiltonian Graphs.
Graphs Comb., 2013

Chiraptophobic Cockroaches evading a Torch Light.
Ars Comb., 2013

2012
Cycle spectra of Hamiltonian graphs.
J. Comb. Theory B, 2012

Graphs with many Vertex-Disjoint Cycles.
Discret. Math. Theor. Comput. Sci., 2012

2011
Independence, odd girth, and average degree.
J. Graph Theory, 2011

Lower bounds on the independence number of certain graphs of odd girth at least seven.
Discret. Appl. Math., 2011

On Hamiltonian paths in distance graphs.
Appl. Math. Lett., 2011

2010
Edge-Injective and Edge-Surjective Vertex Labellings.
SIAM J. Discret. Math., 2010

Minimum degree and density of binary sequences.
Eur. J. Comb., 2010

Packing edge-disjoint cycles in graphs and the cyclomatic number.
Discret. Math., 2010

2009
On packing shortest cycles in graphs.
Inf. Process. Lett., 2009

On spanning tree congestion.
Discret. Math., 2009


  Loading...