Florian Pfender

Publication Activity (10 Years)

Years Active: 2002-2023
Publications (10 Years): 20

Top Topics

Image Indexing And Retrieval

Graph Theoretic

Top Venues

J. Graph Theory

SIAM J. Discret. Math.

Comb. Probab. Comput.

Publications

József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro
Crossing numbers of complete bipartite graphs. LAGOS (2023)
Bernard Lidický, Connor Mattes, Florian Pfender
C5 ${C}_{5}$ is almost a fractalizer. J. Graph Theory 104 (1) (2023)
Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec
Counterexamples to a Conjecture of Harris on Hall Ratio. SIAM J. Discret. Math. 36 (3) (2022)
Bernard Lidický, Florian Pfender
Semidefinite Programming and Ramsey Numbers. SIAM J. Discret. Math. 35 (4) (2021)
Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec
Sharp bounds for decomposing graphs into edges and triangles. Comb. Probab. Comput. 30 (2) (2021)
James Davies, Florian Pfender
Edge-maximal graphs on orientable and some nonorientable surfaces. J. Graph Theory 98 (3) (2021)
József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30 (4) (2021)
Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. J. Graph Theory 94 (2) (2020)
Ilkyoo Choi, Bernard Lidický, Florian Pfender
Inducibility of directed paths. Discret. Math. 343 (10) (2020)
Van Bang Le, Florian Pfender
Color-line and proper color-line graphs. Discret. Appl. Math. 278 (2020)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. Inf. Process. Lett. 137 (2018)
Bernard Lidický, Florian Pfender
Pentagons in triangle-free graphs. Eur. J. Comb. 74 (2018)
Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender
Notes on complexity of packing coloring. CoRR (2017)
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young
Rainbow triangles in three-colored graphs. J. Comb. Theory, Ser. B 126 (2017)
Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young
On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs. J. Graph Theory 84 (4) (2017)
Maciej Kalkowski, Michal Karonski, Florian Pfender
The 1-2-3-Conjecture for Hypergraphs. J. Graph Theory 85 (3) (2017)
Axel Brandt, Brent Moran, Kapil Nepal, Florian Pfender, Devon Sigler
Local gap colorings from edge labelings. Australas. J Comb. 65 (2016)
Jessica De Silva, Theodore Molla, Florian Pfender, Troy Retter, Michael Tait
Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph. Electron. J. Comb. 23 (2) (2016)
Florian Pfender, Gordon F. Royle
Quartic Graphs with Every Edge in a Triangle. J. Graph Theory 82 (2) (2016)
József Balogh, Ping Hu, Bernard Lidický, Florian Pfender
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle. Eur. J. Comb. 52 (2016)
Florian Pfender
Combined Degree and Connectivity Conditions for H-Linked Graphs. SIAM J. Discret. Math. 29 (2) (2015)
Van Bang Le, Florian Pfender
Color-line and Proper Color-line Graphs. CoRR (2015)
Van Bang Le, Florian Pfender
Complexity results for rainbow matchings. Theor. Comput. Sci. 524 (2014)
Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender
Preface. Discret. Appl. Math. 163 (2014)
Van Bang Le, Florian Pfender
Extremal Graphs Having No Stable Cutset. Electron. J. Comb. 20 (1) (2013)
Van Bang Le, Florian Pfender
Complexity Results for Rainbow Matchings. CoRR (2013)
Michael Ferrara, Michael S. Jacobson, Florian Pfender
-Linked Digraphs. Comb. Probab. Comput. 22 (5) (2013)
James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young
Monochromatic triangles in three-coloured graphs. J. Comb. Theory, Ser. B 103 (4) (2013)
Florian Pfender
Total edge irregularity strength of large graphs. Discret. Math. 312 (2) (2012)
Florian Pfender
Complete subgraphs in multipartite graphs. Comb. 32 (4) (2012)
Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, Paul S. Wenger
Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs. Electron. J. Comb. 19 (2) (2012)
Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West
Cycle spectra of Hamiltonian graphs. J. Comb. Theory, Ser. B 102 (4) (2012)
Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen
-Linked Graphs. J. Graph Theory 71 (1) (2012)
Maciej Kalkowski, Michal Karonski, Florian Pfender
A New Upper Bound for the Irregularity Strength of Graphs. SIAM J. Discret. Math. 25 (3) (2011)
Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158 (11) (2010)
Florian Pfender
Rooted induced trees in triangle-free graphs. J. Graph Theory 64 (3) (2010)
Maciej Kalkowski, Michal Karonski, Florian Pfender
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. J. Comb. Theory, Ser. B 100 (3) (2010)
Ronald J. Gould, Tomasz Luczak, Florian Pfender
Critical graphs for subpancyclicity of 3-connected claw-free graphs. J. Graph Theory 62 (3) (2009)
Florian Pfender
A note on cycle spectra of line graphs. Discret. Math. 309 (9) (2009)
Florian Pfender
Visibility Graphs of Point Sets in the Plane. Discret. Comput. Geom. 39 (1-3) (2008)
Florian Pfender
Improved Delsarte bounds for spherical codes in small dimensions. J. Comb. Theory, Ser. A 114 (6) (2007)
Florian Pfender
Visibility graphs of point sets in the plane. Electron. Notes Discret. Math. 27 (2006)
Florian Pfender
Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49 (4) (2005)
Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei
Graph minors and linkages. J. Graph Theory 49 (1) (2005)
Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender
Linear forests and ordered cycles. Discuss. Math. Graph Theory 24 (3) (2004)
Guantao Chen, Ronald J. Gould, Florian Pfender
New Conditions for k-ordered Hamiltonian Graphs. Ars Comb. 70 (2004)
Florian Pfender
2-Factors in Hamiltonian Graphs. Ars Comb. 72 (2004)
Tomasz Luczak, Florian Pfender
-free graphs are hamiltonian. J. Graph Theory 47 (2) (2004)
Ronald J. Gould, Tomasz Luczak, Florian Pfender
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47 (3) (2004)
Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei
Extremal graphs for intersecting cliques. J. Comb. Theory, Ser. B 89 (2) (2003)
Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf
On k-Ordered Bipartite Graphs. Electron. J. Comb. 10 (2003)
Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender
On graph irregularity strength. J. Graph Theory 41 (2) (2002)
Ronald J. Gould, Florian Pfender
Pancyclicity in claw-free graphs. Discret. Math. 256 (1-2) (2002)