An Upper Bound for the Minimum Diameter of Integral Point Sets. - Heiko Harborth; Arnfried Kemnitz; Meinhard Möller (Discret. Comput. Geom., 1993)

Coloring of integer distance graphs. - Arnfried Kemnitz; Halka Kolberg (Discret. Math., 1998)

List Edge Colorings of Outerplanar Graphs. - Andrea Hackmann; Arnfried Kemnitz (Ars Comb., 2001)

Plane integral drawings of planar graphs. - Arnfried Kemnitz; Heiko Harborth (Discret. Math., 2001)

Chromatic numbers of integer distance graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discret. Math., 2001)

Edge colorings and total colorings of integer distance graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discuss. Math. Graph Theory, 2002)

The circular chromatic index. - Andrea Hackmann; Arnfried Kemnitz (Discret. Math., 2004)

Coloring The Line. - Arnfried Kemnitz; Massimiliano Marangio (Ars Comb., 2007)

[r, s, t]-Colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discret. Math., 2007)

[r, s, t]-Chromatic numbers and hereditary properties of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Peter Mihók (Discret. Math., 2007)

Rainbows in the Hypercube. - Maria Axenovich; Heiko Harborth; Arnfried Kemnitz; Meinhard Möller; Ingo Schiermeyer (Graphs Comb., 2007)

Generalized total colorings of graphs. - Mieczyslaw Borowiecki; Arnfried Kemnitz; Massimiliano Marangio; Peter Mihók (Discuss. Math. Graph Theory, 2011)

Graphs with rainbow connection number two. - Arnfried Kemnitz; Ingo Schiermeyer (Discuss. Math. Graph Theory, 2011)

Improved degree conditions for Hamiltonian properties. - Arnfried Kemnitz; Ingo Schiermeyer (Discret. Math., 2012)

Closures, cycles, and paths. - Jochen Harant; Arnfried Kemnitz; Akira Saito; Ingo Schiermeyer (J. Graph Theory, 2012)

Hypercube-Anti-Ramsey Numbers of Q5. - Jens-P. Bode; Dorothee Grimm; Arnfried Kemnitz (Ars Comb., 2013)

Fractional ( P, Q)-total list colorings of graphs. - Arnfried Kemnitz; Peter Mihók; Margit Voigt (Discuss. Math. Graph Theory, 2013)

Rainbow connection in sparse graphs. - Arnfried Kemnitz; Jakub Przybylo; Ingo Schiermeyer; Mariusz Wozniak (Discuss. Math. Graph Theory, 2013)

$$[1, 1, t]$$ -Colorings of Complete Graphs. - Arnfried Kemnitz; Massimiliano Marangio; Zsolt Tuza (Graphs Comb., 2013)

d-strong Edge Colorings of Graphs. - Arnfried Kemnitz; Massimiliano Marangio (Graphs Comb., 2014)

d-strong total colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discret. Math., 2015)

(P, Q)-Total (r, s)-colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Anja Pruchnewski; Margit Voigt (Discret. Math., 2015)

Improved sufficient conditions for Hamiltonian properties. - Jens-P. Bode; Anika Fricke; Arnfried Kemnitz (Discuss. Math. Graph Theory, 2015)

Generalized fractional and circular total colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Peter Mihók; Janka Oravcová; Roman Soták (Discuss. Math. Graph Theory, 2015)

Hypohamiltonian Oriented Graphs of All Possible Orders. - Susan A. van Aardt; Alewyn P. Burger; Marietjie Frick; Arnfried Kemnitz; Ingo Schiermeyer (Graphs Comb., 2015)

Sum List Colorings of Wheels. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Graphs Comb., 2015)

Sufficient conditions for 2-rainbow connected graphs. - Arnfried Kemnitz; Ingo Schiermeyer (Discret. Appl. Math., 2016)

Sum list edge colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Discuss. Math. Graph Theory, 2016)

Lower bounds on the sum choice number of a graph. - Jochen Harant; Arnfried Kemnitz (Electron. Notes Discret. Math., 2016)

Proper connection and size of graphs. - Susan A. van Aardt; Christoph Brause; Alewyn P. Burger; Marietjie Frick; Arnfried Kemnitz; Ingo Schiermeyer (Discret. Math., 2017)

Sum choice number of generalized θ-graphs. - Christoph Brause; Arnfried Kemnitz; Massimiliano Marangio; Anja Pruchnewski; Margit Voigt (Discret. Math., 2017)

Bounds for the sum choice number. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Electron. Notes Discret. Math., 2017)

A Note on Not-4-List Colorable Planar Graphs. - Margit Voigt; Arnfried Kemnitz (Electron. J. Comb., 2018)

On the Chromatic Edge Stability Number of Graphs. - Arnfried Kemnitz; Massimiliano Marangio; Nazanin Movarraei (Graphs Comb., 2018)

Generalized sum list colorings of graphs. - Arnfried Kemnitz; Massimiliano Marangio; Margit Voigt (Discuss. Math. Graph Theory, 2019)

A Note on Complex-4-Colorability of Signed Planar Graphs. - Arnfried Kemnitz; Margit Voigt (Electron. J. Comb., 2021)

Comparison of sum choice number with chromatic sum. - Arnfried Kemnitz; Massimiliano Marangio; Zsolt Tuza; Margit Voigt (Discret. Math., 2021)

On the ρ-edge stability number of graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discuss. Math. Graph Theory, 2022)

On the ρ-subdivision number of graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discuss. Math. Graph Theory, 2023)

On the vertex stability numbers of graphs. - Arnfried Kemnitz; Massimiliano Marangio (Discret. Appl. Math., 2024)