Home
About
Advanced Search
Browse by Discipline
Scientific Societies
E-print Alerts
Add E-prints
FAQ
•
HELP
•
SITE MAP
•
CONTACT US
Search
Advanced Search
Pfender, Florian - Institut für Mathematik, Universität Rostock
ROOTED INDUCED TREES IN TRIANGLE-FREE GRAPHS FLORIAN PFENDER
VERTEX-COLORING EDGE-WEIGHTINGS: TOWARDS THE 1-2-3-CONJECTURE
HAMILTONICITY AND FORBIDDEN SUBGRAPHS IN 4-CONNECTED GRAPHS
Graph Minors and Linkages , R.J. Gould2
Linear Forests and Ordered Cycles Guantao Chen
On graph irregularity strength Alan Frieze
A NEW UPPER BOUND FOR THE IRREGULARITY STRENGTH OF GRAPHS
NEW ORE-TYPE CONDITIONS FOR H-LINKED GRAPHS MICHAEL FERRARA1
Combined degree and connectivity conditions for H-linked FLORIAN PFENDER
IMPROVED DELSARTE BOUNDS FOR SPHERICAL CODES IN SMALL DIMENSIONS
CLAW-FREE 3-CONNECTED P11-FREE GRAPHS ARE HAMILTONIAN
PANCYCLICITY OF 3-CONNECTED GRAPHS: PAIRS OF FORBIDDEN SUBGRAPHS
On Visibility Graphs of Point Sets in the Plane FLORIAN PFENDER
NEW CONDITIONS FOR K-ORDERED HAMILTONIAN GUANTAO CHEN
Complete subgraphs in multipartite graphs FLORIAN PFENDER
TOTAL EDGE IRREGULARITY STRENGTH OF LARGE GRAPHS
A Note on Cycle Spectra of Line Graphs FLORIAN PFENDER
Pancyclicity in Claw-free Graphs R.J. Gould, F. Pfender
VERTEX COLORING EDGE WEIGHTINGS WITH INTEGER WEIGHTS AT MOST 6
CRITICAL GRAPHS FOR SUBPANCYCLICITY OF 3-CONNECTED CLAW-FREE GRAPHS
Extremal Graphs for Intersecting Cliques Guantao Chen a,1
AN ITERATIVE APPROACH TO THE IRREGULARITY STRENGTH OF TREES
On k-Ordered Bipartite Graphs Jill R. Faudree
2-Factors in Hamiltonian Graphs Florian Pfender
EXTREMAL GRAPHS HAVING NO STABLE CUTSETS VAN BANG LE AND FLORIAN PFENDER
