Julian Pott

According to our database, Julian Pott authored at least 7 papers between 2012 and 2017.

Collaborative distances:

• Dijkstra number of four.
• Erdős number of three.

2017

Dual trees must share their ends.

Reinhard Diestel, Julian Pott

J. Comb. Theory, Ser. B, 2017

2016

Extending Cycles Locally to Hamilton Cycles.

Matthias Hamann, Florian Lehner, Julian Pott

Electron. J. Comb., 2016

2015

Edge-disjoint double rays in infinite graphs: A Halin type result.

Nathan J. Bowler, Johannes Carmesin, Julian Pott

J. Comb. Theory, Ser. B, 2015

2014

Orthogonality and Minimality in the Homology of Locally Finite Graphs.

Reinhard Diestel, Julian Pott

Electron. J. Comb., 2014

2012

Transitivity conditions in infinite graphs.

Matthias Hamann, Julian Pott

Comb., 2012

Analysis of Simulink Models Using Databases and Model Transformations.

Daniel Merschen, Robert Gleis, Julian Pott, Stefan Kowalewski

Proceedings of the Model-Based Methodologies for Pervasive and Embedded Software, 2012

Integration and Analysis of Design Artefacts in Embedded Software Development.

Daniel Merschen, Julian Pott, Stefan Kowalewski

Proceedings of the 36th Annual IEEE Computer Software and Applications Conference Workshops, 2012