The SCEAS System
Navigation Menu

Search the dblp DataBase

Title:
Author:

Florian Pfender: [Publications] [Author Rank by year] [Co-authors] [Prefers] [Cites] [Cited by]

Publications of Author

  1. Guantao Chen, Ronald J. Gould, Florian Pfender
    New Conditions for k-ordered Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:70, n:, pp:- [Journal]
  2. Florian Pfender
    2-Factors in Hamiltonian Graphs. [Citation Graph (0, 0)][DBLP]
    Ars Comb., 2004, v:72, n:, pp:- [Journal]
  3. Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf
    On k-Ordered Bipartite Graphs. [Citation Graph (0, 0)][DBLP]
    Electr. J. Comb., 2003, v:10, n:, pp:- [Journal]
  4. Ronald J. Gould, Florian Pfender
    Pancyclicity in claw-free graphs. [Citation Graph (0, 0)][DBLP]
    Discrete Mathematics, 2002, v:256, n:1-2, pp:151-160 [Journal]
  5. Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei
    Extremal graphs for intersecting cliques. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. B, 2003, v:89, n:2, pp:159-171 [Journal]
  6. Florian Pfender
    Hamiltonicity and forbidden subgraphs in 4-connected graphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:4, pp:262-272 [Journal]
  7. Guantao Chen, Ronald J. Gould, K. Kawarabayashi, Florian Pfender, Bing Wei
    Graph minors and linkages. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2005, v:49, n:1, pp:75-91 [Journal]
  8. Ronald J. Gould, Tomasz Luczak, Florian Pfender
    Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:3, pp:183-202 [Journal]
  9. Tomasz Luczak, Florian Pfender
    Claw-free 3-connected P11-free graphs are hamiltonian. [Citation Graph (0, 0)][DBLP]
    Journal of Graph Theory, 2004, v:47, n:2, pp:111-121 [Journal]
  10. Florian Pfender
    Improved Delsarte bounds for spherical codes in small dimensions. [Citation Graph (0, 0)][DBLP]
    J. Comb. Theory, Ser. A, 2007, v:114, n:6, pp:1133-1147 [Journal]

  11. An iterative approach to graph irregularity strength. [Citation Graph (, )][DBLP]


  12. Visibility Graphs of Point Sets in the Plane. [Citation Graph (, )][DBLP]


  13. A note on cycle spectra of line graphs. [Citation Graph (, )][DBLP]


Search in 0.003secs, Finished in 0.003secs
NOTICE1
System may not be available sometimes or not working properly, since it is still in development with continuous upgrades
NOTICE2
The rankings that are presented on this page should NOT be considered as formal since the citation info is incomplete in DBLP
 
System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002
for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002