|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 19 publication records. Showing 19 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Florian Pfender |
Total edge irregularity strength of large graphs.  |
Discrete Mathematics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Kalkowski, Michal Karonski, Florian Pfender |
A New Upper Bound for the Irregularity Strength of Graphs. |
SIAM J. Discrete Math. |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Maciej Kalkowski, Michal Karonski, Florian Pfender |
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. |
J. Comb. Theory, Ser. B |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
Rooted induced trees in triangle-free graphs. |
Journal of Graph Theory |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Michael Ferrara, Ronald J. Gould, Michal Karonski, Florian Pfender |
An iterative approach to graph irregularity strength. |
Discrete Applied Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
A note on cycle spectra of line graphs. |
Discrete Mathematics |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald J. Gould, Tomasz Luczak, Florian Pfender |
Critical graphs for subpancyclicity of 3-connected claw-free graphs. |
Journal of Graph Theory |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
Visibility Graphs of Point Sets in the Plane. |
Discrete & Computational Geometry |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
Improved Delsarte bounds for spherical codes in small dimensions. |
J. Comb. Theory, Ser. A |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
Visibility graphs of point sets in the plane. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Guantao Chen, Ronald J. Gould, Ken-ichi Kawarabayashi, Florian Pfender, Bing Wei |
Graph minors and linkages. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
Hamiltonicity and forbidden subgraphs in 4-connected graphs. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Ronald J. Gould, Tomasz Luczak, Florian Pfender |
Pancyclicity of 3-connected graphs: Pairs of forbidden subgraphs. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Tomasz Luczak, Florian Pfender |
Claw-free 3-connected P11-free graphs are hamiltonian. |
Journal of Graph Theory |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Florian Pfender |
2-Factors in Hamiltonian Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Guantao Chen, Ronald J. Gould, Florian Pfender |
New Conditions for k-ordered Hamiltonian Graphs. |
Ars Comb. |
2004 |
DBLP BibTeX RDF |
|
| 1 | Guantao Chen, Ronald J. Gould, Florian Pfender, Bing Wei |
Extremal graphs for intersecting cliques. |
J. Comb. Theory, Ser. B |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Jill R. Faudree, Ronald J. Gould, Florian Pfender, Allison Wolf |
On k-Ordered Bipartite Graphs. |
Electr. J. Comb. |
2003 |
DBLP BibTeX RDF |
|
| 1 | Ronald J. Gould, Florian Pfender |
Pancyclicity in claw-free graphs. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #19 of 19 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")