Florian Pfender

According to our database, Florian Pfender authored at least 49 papers between 2002 and 2023.

Collaborative distances:

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

2023

C5 ${C}_{5}$ is almost a fractalizer.

Bernard Lidický, Connor Mattes, Florian Pfender

J. Graph Theory, September, 2023

Crossing numbers of complete bipartite graphs.

József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro

Proceedings of the XII Latin-American Algorithms, Graphs and Optimization Symposium, 2023

2022

Counterexamples to a Conjecture of Harris on Hall Ratio.

Adam Blumenthal, Bernard Lidický, Ryan R. Martin, Sergey Norin, Florian Pfender, Jan Volec

SIAM J. Discret. Math., 2022

2021

Semidefinite Programming and Ramsey Numbers.

Bernard Lidický, Florian Pfender

SIAM J. Discret. Math., 2021

Edge-maximal graphs on orientable and some nonorientable surfaces.

James Davies, Florian Pfender

J. Graph Theory, 2021

Sharp bounds for decomposing graphs into edges and triangles.

Adam Blumenthal, Bernard Lidický, Yanitsa Pehova, Florian Pfender, Oleg Pikhurko, Jan Volec

Comb. Probab. Comput., 2021

Making Kr+1-free graphs r-partite.

József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender

Comb. Probab. Comput., 2021

2020

Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.

Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell

J. Graph Theory, 2020

Inducibility of directed paths.

Ilkyoo Choi, Bernard Lidický, Florian Pfender

Discret. Math., 2020

Color-line and proper color-line graphs.

Van Bang Le, Florian Pfender

Discret. Appl. Math., 2020

2018

Notes on complexity of packing coloring.

Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender

Inf. Process. Lett., 2018

Pentagons in triangle-free graphs.

Bernard Lidický, Florian Pfender

Eur. J. Comb., 2018

2017

The 1-2-3-Conjecture for Hypergraphs.

Maciej Kalkowski, Michal Karonski, Florian Pfender

J. Graph Theory, 2017

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.

Ellen Gethner, Leslie Hogben, Bernard Lidický, Florian Pfender, Amanda Ruiz, Michael Young

J. Graph Theory, 2017

Rainbow triangles in three-colored graphs.

József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young

J. Comb. Theory B, 2017

2016

Quartic Graphs with Every Edge in a Triangle.

Florian Pfender, Gordon F. Royle

J. Graph Theory, 2016

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.

József Balogh, Ping Hu, Bernard Lidický, Florian Pfender

Eur. J. Comb., 2016

Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph.

Jessica De Silva, Theodore Molla, Florian Pfender, Troy Retter, Michael Tait

Electron. J. Comb., 2016

Local gap colorings from edge labelings.

Axel Brandt, Brent Moran, Kapil Nepal, Florian Pfender, Devon Sigler

Australas. J Comb., 2016

2015

Combined Degree and Connectivity Conditions for H-Linked Graphs.

Florian Pfender

SIAM J. Discret. Math., 2015

2014

Complexity results for rainbow matchings.

Van Bang Le, Florian Pfender

Theor. Comput. Sci., 2014

Preface.

Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender

Discret. Appl. Math., 2014

2013

Monochromatic triangles in three-coloured graphs.

James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young

J. Comb. Theory B, 2013

Degree Conditions for <i>H</i>-Linked Digraphs.

Michael Ferrara, Michael S. Jacobson, Florian Pfender

Comb. Probab. Comput., 2013

Extremal Graphs Having No Stable Cutset.

Van Bang Le, Florian Pfender

Electron. J. Comb., 2013

2012

New Ore-Type Conditions for <i>H</i>-Linked Graphs.

Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen

J. Graph Theory, 2012

Cycle spectra of Hamiltonian graphs.

Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West

J. Comb. Theory B, 2012

Total edge irregularity strength of large graphs.

Florian Pfender

Discret. Math., 2012

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs.

Jennifer Diemunsch, Michael Ferrara, Allan Lo, Casey Moffatt, Florian Pfender, Paul S. Wenger

Electron. J. Comb., 2012

Complete subgraphs in multipartite graphs.

Florian Pfender

Comb., 2012

2011

A New Upper Bound for the Irregularity Strength of Graphs.

Maciej Kalkowski, Michal Karonski, Florian Pfender

SIAM J. Discret. Math., 2011

2010

Rooted induced trees in triangle-free graphs.

Florian Pfender

J. Graph Theory, 2010

Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture.

Maciej Kalkowski, Michal Karonski, Florian Pfender

J. Comb. Theory B, 2010

An iterative approach to graph irregularity strength.

Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender

Discret. Appl. Math., 2010

2009

Critical graphs for subpancyclicity of 3-connected claw-free graphs.

Ronald J. Gould, Tomasz Luczak, Florian Pfender

J. Graph Theory, 2009

A note on cycle spectra of line graphs.

Florian Pfender

Discret. Math., 2009

2007

Improved Delsarte bounds for spherical codes in small dimensions.

Florian Pfender

J. Comb. Theory A, 2007

2006

Visibility graphs of point sets in the plane.

Florian Pfender

Electron. Notes Discret. Math., 2006

2005

Hamiltonicity and forbidden subgraphs in 4-connected graphs.

Florian Pfender

J. Graph Theory, 2005

Graph minors and linkages.

Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei

J. Graph Theory, 2005

2004

Claw-free 3-connected <i>P</i>₁₁-free graphs are hamiltonian.

Tomasz Luczak, Florian Pfender

J. Graph Theory, 2004

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.

Ronald J. Gould, Tomasz Luczak, Florian Pfender

J. Graph Theory, 2004

Linear forests and ordered cycles.

Guantao Chen, Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Linda M. Lesniak, Florian Pfender

Discuss. Math. Graph Theory, 2004

2-Factors in Hamiltonian Graphs.

Florian Pfender

Ars Comb., 2004

New Conditions for k-ordered Hamiltonian Graphs.

Guantao Chen, Ronald J. Gould, Florian Pfender

Ars Comb., 2004

2003

Extremal graphs for intersecting cliques.

Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei

J. Comb. Theory B, 2003

On k-Ordered Bipartite Graphs.

Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf

Electron. J. Comb., 2003

2002

On graph irregularity strength.

Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender

J. Graph Theory, 2002

Pancyclicity in claw-free graphs.

Ronald J. Gould, Florian Pfender

Discret. Math., 2002