Florian Pfender

From MaRDI portal
Person:247197

Available identifiers

zbMath Open pfender.florianMaRDI QIDQ247197

List of research outcomes

PublicationDate of PublicationType
C5 ${C}_{5}$ is almost a fractalizer2023-10-10Paper
Edge‐maximal graphs on orientable and some nonorientable surfaces2023-10-04Paper
Making Kr+1-free graphs r-partite2023-03-30Paper
Counterexamples to a Conjecture of Harris on Hall Ratio2022-07-28Paper
Semidefinite Programming and Ramsey Numbers2021-11-04Paper
Sharp bounds for decomposing graphs into edges and triangles2021-06-15Paper
Inducibility of 4-vertex tournaments2021-03-11Paper
Inducibility of directed paths2020-08-12Paper
Ore and Chvátal‐type degree conditions for bootstrap percolation from small sets2020-05-21Paper
Color-line and proper color-line graphs2020-04-21Paper
Making $K_{r+1}$-Free Graphs $r$-partite2019-09-30Paper
Pentagons in triangle-free graphs2018-09-07Paper
Notes on complexity of packing coloring2018-06-15Paper
Erd\H{o}s-Szekeres On-Line2018-04-16Paper
The 1-2-3-Conjecture for Hypergraphs2017-08-08Paper
https://portal.mardi4nfdi.de/entity/Q28202072016-09-14Paper
Quartic Graphs with Every Edge in a Triangle2016-06-10Paper
Increasing paths in edge-ordered graphs: the hypercube and random graph2016-05-11Paper
Graph saturation in multipartite graphs2016-02-19Paper
Maximum density of induced 5-cycle is achieved by an iterated blow-up of 5-cycle2015-12-11Paper
Combined Degree and Connectivity Conditions for $H$-Linked Graphs2015-11-27Paper
Degree Conditions for H-Linked Digraphs2014-02-24Paper
Complexity results for rainbow matchings2014-02-11Paper
Total weight choosability in Hypergraphs2013-12-21Paper
Complete subgraphs in multipartite graphs2013-08-06Paper
Extremal graphs having no stable cutset2013-06-07Paper
Rainbow matchings of size \(\delta(G)\) in properly edge-colored graphs2012-10-24Paper
New Ore-Type Conditions for H-Linked Graphs2012-09-12Paper
Cycle spectra of Hamiltonian graphs2012-08-14Paper
Large rainbow matchings in large graphs2012-04-14Paper
A New Upper Bound for the Irregularity Strength of Graphs2012-03-15Paper
Total edge irregularity strength of large graphs2012-01-11Paper
Total Vertex Irregularity Strength of Forests2011-03-10Paper
https://portal.mardi4nfdi.de/entity/Q30654622011-01-06Paper
Rooted induced trees in triangle-free graphs2010-11-10Paper
An iterative approach to graph irregularity strength2010-10-11Paper
Vertex-coloring edge-weightings: towards the 1-2-3-conjecture2010-04-21Paper
Critical graphs for subpancyclicity of 3-connected claw-free graphs2009-12-18Paper
A note on cycle spectra of line graphs2009-12-09Paper
https://portal.mardi4nfdi.de/entity/Q36199532009-04-14Paper
Visibility graphs of point sets in the plane2008-04-16Paper
Improved Delsarte bounds for spherical codes in small dimensions2007-08-20Paper
Visibility graphs of point sets in the plane2007-05-29Paper
https://portal.mardi4nfdi.de/entity/Q54755332006-06-26Paper
On Visibility Graphs of Point Sets in the Plane2005-10-21Paper
Hamiltonicity and forbidden subgraphs in 4‐connected graphs2005-08-29Paper
https://portal.mardi4nfdi.de/entity/Q54635022005-08-04Paper
Graph minors and linkages2005-06-01Paper
Linear forests and ordered cycles2005-04-19Paper
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs2005-02-16Paper
Claw-free 3-connectedP11-free graphs are hamiltonian2005-02-16Paper
https://portal.mardi4nfdi.de/entity/Q48267302004-11-11Paper
Extremal graphs for intersecting cliques2004-01-06Paper
On \(k\)-ordered bipartite graphs2003-05-07Paper
On graph irregularity strength2003-03-19Paper
Pancyclicity in claw-free graphs2002-12-02Paper
https://portal.mardi4nfdi.de/entity/Q49498272001-05-17Paper

Research outcomes over time


Doctoral students

No records found.


Known relations from the MaRDI Knowledge Graph

PropertyValue
MaRDI profile typeMaRDI person profile
instance ofhuman


This page was built for person: Florian Pfender