André Kündgen

Orcid: 0000-0002-5374-1318

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

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2022
Fractional Cocoloring of Graphs.
Graphs Comb., 2022

2019
Fractional Coloring Methods with Applications to Degenerate Graphs and Graphs on Surfaces.
SIAM J. Discret. Math., 2019

Expected reliability of communication protocols.
Discret. Math., 2019

2017
Cycles through all finite vertex sets in infinite graphs.
Eur. J. Comb., 2017

Nonrepetitive edge-colorings of trees.
Discret. Math. Theor. Comput. Sci., 2017

2015
Finding Minors in Graphs with a Given Path Structure.
J. Graph Theory, 2015

2012
Covering Complete Hypergraphs with Cuts of Minimum Total Size.
Graphs Comb., 2012

2011
Switchings, extensions, and reductions in central digraphs.
J. Comb. Theory A, 2011

Covering Complete <i>r</i>-Graphs with Spanning Complete <i>r</i>-Partite <i>r</i>-Graphs.
Comb. Probab. Comput., 2011

On 2-factors with long cycles in cubic graphs.
Ars Math. Contemp., 2011

2010
k-Robust Single-Message Transmission.
SIAM J. Discret. Math., 2010

Star coloring planar graphs from small lists.
J. Graph Theory, 2010

2009
Star coloring bipartite planar graphs.
J. Graph Theory, 2009

On decompositions of complete hypergraphs.
J. Comb. Theory A, 2009

2008
Nonrepetitive colorings of graphs of bounded tree-width.
Discret. Math., 2008

2006
Moments of graphs in monotone families.
J. Graph Theory, 2006

Orthogonal art galleries with interior walls.
Discret. Appl. Math., 2006

2005
Graph Minors and Reliable Single Message Transmission.
SIAM J. Discret. Math., 2005

A bound on the total size of a cut cover.
Discret. Math., 2005

2004
Bipartite anti-Ramsey numbers of cycles.
J. Graph Theory, 2004

Coloring with no 2-Colored P<sub>4</sub>'s.
Electron. J. Comb., 2004

2003
Maximal Paths in Bipartite Graphs: 10920.
Am. Math. Mon., 2003

Probabilistic Methods for Decomposition Dimension of Graphs.
Graphs Comb., 2003

2002
Problem 10920.
Am. Math. Mon., 2002

Extremal problems for chromatic neighborhood sets.
J. Graph Theory, 2002

Turán problems for integer-weighted graphs.
J. Graph Theory, 2002

Coloring Face-Hypergraphs of Graphs on Surfaces.
J. Comb. Theory B, 2002

Minimum average distance subsets in the hamming cube.
Discret. Math., 2002

2001
Minimal Completely Separating Systems of k-Sets.
J. Comb. Theory A, 2001

Covering a graph with cuts of minimum total size.
Discret. Math., 2001

Gaps in the Chromatic Spectrum of Face-Constrained Plane Graphs.
Electron. J. Comb., 2001

On a Generalized Anti-Ramsey Problem.
Comb., 2001

2000
Tiling Rectangles with Trominoes: 10641.
Am. Math. Mon., 2000

An Identity Involving Derangements: 10643.
Am. Math. Mon., 2000

Perfection thickness of graphs.
Discret. Math., 2000

Colouring Planar Mixed Hypergraphs.
Electron. J. Comb., 2000

1999
Art Galleries with Interior Walls.
Discret. Comput. Geom., 1999

1998
Covering cliques with spanning bicliques.
J. Graph Theory, 1998


  Loading...