default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDFlorian Pfender
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j49]Bernard Lidický
, Connor Mattes, Florian Pfender:
C5 ${C}_{5}$ is almost a fractalizer. J. Graph Theory 104(1): 220-244 (2023)- [c1]József Balogh, Bernard Lidický, Sergey Norin, Florian Pfender, Gelasio Salazar, Sam Spiro:
Crossing numbers of complete bipartite graphs. LAGOS 2023: 78-87 - 2022
- [j48]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): 1678-1686 (2022) - 2021
- [j47]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): 271-287 (2021) - [j46]József Balogh, Felix Christian Clemen, Mikhail Lavrov, Bernard Lidický, Florian Pfender:
Making Kr+1-free graphs r-partite. Comb. Probab. Comput. 30(4): 609-618 (2021) - [j45]James Davies, Florian Pfender:
Edge-maximal graphs on orientable and some nonorientable surfaces. J. Graph Theory 98(3): 405-425 (2021) - [j44]Bernard Lidický, Florian Pfender:
Semidefinite Programming and Ramsey Numbers. SIAM J. Discret. Math. 35(4): 2328-2344 (2021) - 2020
- [j43]Van Bang Le, Florian Pfender:
Color-line and proper color-line graphs. Discret. Appl. Math. 278: 73-82 (2020) - [j42]Ilkyoo Choi, Bernard Lidický, Florian Pfender:
Inducibility of directed paths. Discret. Math. 343(10): 112015 (2020) - [j41]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): 252-266 (2020)
2010 – 2019
- 2018
- [j40]Bernard Lidický, Florian Pfender:
Pentagons in triangle-free graphs. Eur. J. Comb. 74: 85-89 (2018) - [j39]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. Inf. Process. Lett. 137: 6-10 (2018) - 2017
- [j38]József Balogh, Ping Hu, Bernard Lidický, Florian Pfender, Jan Volec, Michael Young:
Rainbow triangles in three-colored graphs. J. Comb. Theory B 126: 83-113 (2017) - [j37]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): 552-565 (2017) - [j36]Maciej Kalkowski, Michal Karonski, Florian Pfender:
The 1-2-3-Conjecture for Hypergraphs. J. Graph Theory 85(3): 706-715 (2017) - [i3]Minki Kim, Bernard Lidický, Tomás Masarík, Florian Pfender:
Notes on complexity of packing coloring. CoRR abs/1712.08373 (2017) - 2016
- [j35]Axel Brandt, Brent Moran, Kapil Nepal, Florian Pfender, Devon Sigler:
Local gap colorings from edge labelings. Australas. J Comb. 65: 200-211 (2016) - [j34]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): 2 (2016) - [j33]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: 47-58 (2016) - [j32]Florian Pfender, Gordon F. Royle:
Quartic Graphs with Every Edge in a Triangle. J. Graph Theory 82(2): 154-164 (2016) - 2015
- [j31]Florian Pfender:
Combined Degree and Connectivity Conditions for H-Linked Graphs. SIAM J. Discret. Math. 29(2): 716-729 (2015) - [i2]Van Bang Le, Florian Pfender:
Color-line and Proper Color-line Graphs. CoRR abs/1511.01025 (2015) - 2014
- [j30]Andreas Brandstädt, Konrad Engel, Hans-Dietrich O. F. Gronau, Roger Labahn, Van Bang Le, Florian Pfender:
Preface. Discret. Appl. Math. 163: 101 (2014) - [j29]Van Bang Le, Florian Pfender:
Complexity results for rainbow matchings. Theor. Comput. Sci. 524: 27-33 (2014) - 2013
- [j28]Van Bang Le, Florian Pfender:
Extremal Graphs Having No Stable Cutset. Electron. J. Comb. 20(1): 35 (2013) - [j27]Michael Ferrara, Michael S. Jacobson, Florian Pfender:
Degree Conditions for H-Linked Digraphs. Comb. Probab. Comput. 22(5): 684-699 (2013) - [j26]James Cummings, Daniel Král', Florian Pfender, Konrad Sperfeld, Andrew Treglown, Michael Young:
Monochromatic triangles in three-coloured graphs. J. Comb. Theory B 103(4): 489-503 (2013) - [i1]Van Bang Le, Florian Pfender:
Complexity Results for Rainbow Matchings. CoRR abs/1312.7253 (2013) - 2012
- [j25]Florian Pfender:
Complete subgraphs in multipartite graphs. Comb. 32(4): 483-495 (2012) - [j24]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): 52 (2012) - [j23]Florian Pfender:
Total edge irregularity strength of large graphs. Discret. Math. 312(2): 229-237 (2012) - [j22]Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West:
Cycle spectra of Hamiltonian graphs. J. Comb. Theory B 102(4): 869-874 (2012) - [j21]Michael Ferrara, Ronald J. Gould, Michael S. Jacobson, Florian Pfender, Jeffrey S. Powell, Thor Whalen:
New Ore-Type Conditions for H-Linked Graphs. J. Graph Theory 71(1): 69-77 (2012) - 2011
- [j20]Maciej Kalkowski, Michal Karonski, Florian Pfender:
A New Upper Bound for the Irregularity Strength of Graphs. SIAM J. Discret. Math. 25(3): 1319-1321 (2011) - 2010
- [j19]Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender:
An iterative approach to graph irregularity strength. Discret. Appl. Math. 158(11): 1189-1194 (2010) - [j18]Maciej Kalkowski, Michal Karonski, Florian Pfender:
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. J. Comb. Theory B 100(3): 347-349 (2010) - [j17]Florian Pfender:
Rooted induced trees in triangle-free graphs. J. Graph Theory 64(3): 206-209 (2010)
2000 – 2009
- 2009
- [j16]Florian Pfender:
A note on cycle spectra of line graphs. Discret. Math. 309(9): 2922-2924 (2009) - [j15]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Critical graphs for subpancyclicity of 3-connected claw-free graphs. J. Graph Theory 62(3): 263-278 (2009) - 2008
- [j14]Florian Pfender:
Visibility Graphs of Point Sets in the Plane. Discret. Comput. Geom. 39(1-3): 455-459 (2008) - 2007
- [j13]Florian Pfender:
Improved Delsarte bounds for spherical codes in small dimensions. J. Comb. Theory A 114(6): 1133-1147 (2007) - 2006
- [j12]Florian Pfender:
Visibility graphs of point sets in the plane. Electron. Notes Discret. Math. 27: 81 (2006) - 2005
- [j11]Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei:
Graph minors and linkages. J. Graph Theory 49(1): 75-91 (2005) - [j10]Florian Pfender:
Hamiltonicity and forbidden subgraphs in 4-connected graphs. J. Graph Theory 49(4): 262-272 (2005) - 2004
- [j9]Guantao Chen, Ronald J. Gould, Florian Pfender:
New Conditions for k-ordered Hamiltonian Graphs. Ars Comb. 70 (2004) - [j8]Florian Pfender:
2-Factors in Hamiltonian Graphs. Ars Comb. 72 (2004) - [j7]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): 359-372 (2004) - [j6]Tomasz Luczak, Florian Pfender:
Claw-free 3-connected P11-free graphs are hamiltonian. J. Graph Theory 47(2): 111-121 (2004) - [j5]Ronald J. Gould, Tomasz Luczak, Florian Pfender:
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. J. Graph Theory 47(3): 183-202 (2004) - 2003
- [j4]Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf:
On k-Ordered Bipartite Graphs. Electron. J. Comb. 10 (2003) - [j3]Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei:
Extremal graphs for intersecting cliques. J. Comb. Theory B 89(2): 159-171 (2003) - 2002
- [j2]Ronald J. Gould, Florian Pfender:
Pancyclicity in claw-free graphs. Discret. Math. 256(1-2): 151-160 (2002) - [j1]Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender:
On graph irregularity strength. J. Graph Theory 41(2): 120-137 (2002)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-04 20:45 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
