André Kündgen

According to our database, André Kündgen authored at least 38 papers between 1998 and 2022.

Collaborative distances:

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

2022

Fractional Cocoloring of Graphs.

John Gimbel, André Kündgen, Michael Molloy

Graphs Comb., 2022

2019

Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.

John Gimbel, André Kündgen, Binlong Li, Carsten Thomassen

SIAM J. Discret. Math., 2019

Expected reliability of communication protocols.

André Kündgen, Janina Silvana P. Patno

Discret. Math., 2019

2017

Cycles through all finite vertex sets in infinite graphs.

André Kündgen, Binlong Li, Carsten Thomassen

Eur. J. Comb., 2017

Nonrepetitive edge-colorings of trees.

André Kündgen, Tonya Talbot

Discret. Math. Theor. Comput. Sci., 2017

2015

Finding Minors in Graphs with a Given Path Structure.

André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi

J. Graph Theory, 2015

2012

Covering Complete Hypergraphs with Cuts of Minimum Total Size.

Sebastian M. Cioaba, André Kündgen

Graphs Comb., 2012

2011

Switchings, extensions, and reductions in central digraphs.

André Kündgen, Gregor Leander, Carsten Thomassen

J. Comb. Theory, Ser. A, 2011

Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs.

Sebastian M. Cioaba, André Kündgen, Craig Timmons, Vladislav V. Vysotsky

Comb. Probab. Comput., 2011

On 2-factors with long cycles in cubic graphs.

André Kündgen, R. Bruce Richter

Ars Math. Contemp., 2011

2010

k-Robust Single-Message Transmission.

André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi

SIAM J. Discret. Math., 2010

Star coloring planar graphs from small lists.

André Kündgen, Craig Timmons

J. Graph Theory, 2010

2009

Star coloring bipartite planar graphs.

Hal A. Kierstead, André Kündgen, Craig Timmons

J. Graph Theory, 2009

On decompositions of complete hypergraphs.

Sebastian M. Cioaba, André Kündgen, Jacques Verstraëte

J. Comb. Theory, Ser. A, 2009

2008

Nonrepetitive colorings of graphs of bounded tree-width.

André Kündgen, Michael J. Pelsmajer

Discret. Math., 2008

2006

Moments of graphs in monotone families.

Zoltán Füredi, André Kündgen

J. Graph Theory, 2006

Orthogonal art galleries with interior walls.

Joan P. Hutchinson, André Kündgen

Discret. Appl. Math., 2006

2005

Graph Minors and Reliable Single Message Transmission.

Faith Ellen Fich, André Kündgen, Michael J. Pelsmajer, Radhika Ramamurthi

SIAM J. Discret. Math., 2005

A bound on the total size of a cut cover.

André Kündgen, Megan Spangler

Discret. Math., 2005

2004

Bipartite anti-Ramsey numbers of cycles.

Maria Axenovich, Tao Jiang, André Kündgen

J. Graph Theory, 2004

Coloring with no 2-Colored P₄'s.

Michael O. Albertson, Glenn G. Chappell, Henry A. Kierstead, André Kündgen, Radhika Ramamurthi

Electron. J. Comb., 2004

2003

Maximal Paths in Bipartite Graphs: 10920.

André Kündgen, Radhika Ramamurthi, Reiner Martin

Am. Math. Mon., 2003

Probabilistic Methods for Decomposition Dimension of Graphs.

Mariko Hagita, André Kündgen, Douglas B. West

Graphs Comb., 2003

2002

Problem 10920.

André Kündgen, Radhika Ramamurthi

Am. Math. Mon., 2002

Extremal problems for chromatic neighborhood sets.

André Kündgen, Michael Molloy

J. Graph Theory, 2002

Turán problems for integer-weighted graphs.

Zoltán Füredi, André Kündgen

J. Graph Theory, 2002

Coloring Face-Hypergraphs of Graphs on Surfaces.

André Kündgen, Radhika Ramamurthi

J. Comb. Theory, Ser. B, 2002

Minimum average distance subsets in the hamming cube.

André Kündgen

Discret. Math., 2002

2001

Minimal Completely Separating Systems of k-Sets.

André Kündgen, Dhruv Mubayi, Prasad Tetali

J. Comb. Theory, Ser. A, 2001

Covering a graph with cuts of minimum total size.

Zoltán Füredi, André Kündgen

Discret. Math., 2001

Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs.

Daniel Kobler, André Kündgen

Electron. J. Comb., 2001

On a Generalized Anti-Ramsey Problem.

Maria Axenovich, André Kündgen

Comb., 2001

2000

Tiling Rectangles with Trominoes: 10641.

Jerrold R. Griggs, Michael Woltermann, B. Borchers, David Callan, Robin J. Chapman, J. Chilcott, Paul Cull, A. Ferguson, K. Martin, G. G. Gagola, Solomon W. Golomb, J. Guilford, S. Louis Hakimi, Edward F. Schmeichel, J. K. Haugland, C. H. Jepson, R. Johnsonbaugh, André Kündgen, S. Levandosky, J. T. Lewis, John H. Lindsey II, O. P. Lossers, Reiner Martin, R. Morris, Gerald Myerson, José Heber Nieto, E. Rykken, J. Sorensen, J. Schlosberg, W. Seaman, J. T. Ward, Z. Zeuge

Am. Math. Mon., 2000

An Identity Involving Derangements: 10643.

David Callan, Knut Dale, Ivar Skau, John Henry Steelman, Jany C. Binz, Robin J. Chapman, F. Herzig, André Kündgen, Reiner Martin, José Heber Nieto, O. A. Saleh, S. Byrd, Edward F. Schmeichel, Isaac Sofair, Michael Vowe

Am. Math. Mon., 2000

Perfection thickness of graphs.

Hirotsugu Asari, Tao Jiang, André Kündgen, Douglas B. West

Discret. Math., 2000

Colouring Planar Mixed Hypergraphs.

André Kündgen, Eric Mendelsohn, Vitaly I. Voloshin

Electron. J. Comb., 2000

1999

Art Galleries with Interior Walls.

André Kündgen

Discret. Comput. Geom., 1999

1998

Covering cliques with spanning bicliques.

André Kündgen

J. Graph Theory, 1998