Florian Pfender

According to our database1, Florian Pfender authored at least 43 papers between 2002 and 2021.

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

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

On csauthors.net:

Bibliography

2021
Sharp bounds for decomposing graphs into edges and triangles.
Comb. Probab. Comput., 2021

2020
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets.
J. Graph Theory, 2020

Inducibility of directed paths.
Discret. Math., 2020

Color-line and proper color-line graphs.
Discret. Appl. Math., 2020

2018
Notes on complexity of packing coloring.
Inf. Process. Lett., 2018

Pentagons in triangle-free graphs.
Eur. J. Comb., 2018

2017
The 1-2-3-Conjecture for Hypergraphs.
J. Graph Theory, 2017

On Crossing Numbers of Complete Tripartite and Balanced Complete Multipartite Graphs.
J. Graph Theory, 2017

Rainbow triangles in three-colored graphs.
J. Comb. Theory, Ser. B, 2017

2016
Quartic Graphs with Every Edge in a Triangle.
J. Graph Theory, 2016

Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle.
Eur. J. Comb., 2016

Increasing Paths in Edge-Ordered Graphs: The Hypercube and Random Graph.
Electron. J. Comb., 2016

Local gap colorings from edge labelings.
Australas. J Comb., 2016

2015
Combined Degree and Connectivity Conditions for H-Linked Graphs.
SIAM J. Discret. Math., 2015

2014
Complexity results for rainbow matchings.
Theor. Comput. Sci., 2014

Preface.
Discret. Appl. Math., 2014

2013
Monochromatic triangles in three-coloured graphs.
J. Comb. Theory, Ser. B, 2013

Degree Conditions for <i>H</i>-Linked Digraphs.
Comb. Probab. Comput., 2013

Extremal Graphs Having No Stable Cutset.
Electron. J. Comb., 2013

2012
New Ore-Type Conditions for <i>H</i>-Linked Graphs.
J. Graph Theory, 2012

Cycle spectra of Hamiltonian graphs.
J. Comb. Theory, Ser. B, 2012

Total edge irregularity strength of large graphs.
Discret. Math., 2012

Rainbow Matchings of Size δ(G) in Properly Edge-Colored Graphs.
Electron. J. Comb., 2012

Complete subgraphs in multipartite graphs.
Comb., 2012

2011
A New Upper Bound for the Irregularity Strength of Graphs.
SIAM J. Discret. Math., 2011

2010
Rooted induced trees in triangle-free graphs.
J. Graph Theory, 2010

Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture.
J. Comb. Theory, Ser. B, 2010

An iterative approach to graph irregularity strength.
Discret. Appl. Math., 2010

2009
Critical graphs for subpancyclicity of 3-connected claw-free graphs.
J. Graph Theory, 2009

A note on cycle spectra of line graphs.
Discret. Math., 2009

2007
Improved Delsarte bounds for spherical codes in small dimensions.
J. Comb. Theory, Ser. A, 2007

2006
Visibility graphs of point sets in the plane.
Electron. Notes Discret. Math., 2006

2005
Hamiltonicity and forbidden subgraphs in 4-connected graphs.
J. Graph Theory, 2005

Graph minors and linkages.
J. Graph Theory, 2005

2004
Claw-free 3-connected <i>P</i><sub>11</sub>-free graphs are hamiltonian.
J. Graph Theory, 2004

Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs.
J. Graph Theory, 2004

Linear forests and ordered cycles.
Discuss. Math. Graph Theory, 2004

2-Factors in Hamiltonian Graphs.
Ars Comb., 2004

New Conditions for k-ordered Hamiltonian Graphs.
Ars Comb., 2004

2003
Extremal graphs for intersecting cliques.
J. Comb. Theory, Ser. B, 2003

On k-Ordered Bipartite Graphs.
Electron. J. Comb., 2003

2002
On graph irregularity strength.
J. Graph Theory, 2002

Pancyclicity in claw-free graphs.
Discret. Math., 2002


  Loading...