default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 41
Volume 41, Number 1, September 2002
- Shmuel Friedland, Reinhard Nabben:
On Cheeger-type inequalities for weighted graphs. 1-17 - Dieter Rautenbach, Lutz Volkmann:
How local irregularity gets global in a graph. 18-23 - Hein van der Holst
:
On the "largeur d'arborescence". 24-52 - Andrew Vince:
Separation index of a graph. 53-61 - Ko-Wei Lih, Daphne Der-Fen Liu:
Circular chromatic numbers of some reduced Kneser graphs. 62-68
Volume 41, Number 2, October 2002
- Laura Sheppardson, Xingxing Yu:
Long cycles in 3-connected graphs in orientable surfaces. 69-84 - K. B. Reid:
Total relative displacement of vertex permutations of K. 85-100 - T. S. Michael:
Signed degree sequences and multigraphs. 101-105 - Tom Bohman, Ron Holzman:
On a list coloring conjecture of Reed. 106-109 - András Frank, László Szegö:
Note on the path-matching formula. 110-119 - Alan M. Frieze, Ronald J. Gould, Michal Karonski, Florian Pfender:
On graph irregularity strength. 120-137 - Bill Jackson, Xingxing Yu:
Hamilton cycles in plane triangulations. 138-150 - Saad I. El-Zanati, Shailesh K. Tipnis, Charles Vanden Eynden:
A generalization of the Oberwolfach problem. 151-161
Volume 41, Number 3, November 2002
- Michael J. Dinneen, Liu Xiong:
Minor-order obstructions for the graphs of vertex cover 6. 163-178 - Martin Charles Golumbic, Robert E. Jamison, Ann N. Trenk:
Archimedean ϕ -tolerance graphs. 179-194 - Xuding Zhu:
Circular chromatic number of distance graphs with distance sets of cardinality 3. 195-207 - Mathew Cropper, Anthony J. W. Hilton:
Hall parameters of complete and complete bipartite graphs. 208-237 - S. Marshall:
Regular representations of finite groups as automorphism groups of k-tournaments. 238-248
Volume 41, Number 4, December 2002
- Felix Lazebnik, Raymond Viglione:
An infinite series of regular edge- but not vertex-transitive graphs. 249-258 - Endre Boros, Vladimir Gurvich, Stefan Hougardy:
Recursive generation of partitionable graphs. 259-285 - Artem V. Pyatkin:
6-regular 4-critical graph. 286-291 - Lutz Volkmann, Vadim E. Zverovich:
Proof of a conjecture on irredundance perfect graphs. 292-306 - Wenjie He, Xiaoling Hou, Ko-Wei Lih, Jiating Shao, Weifan Wang, Xuding Zhu:
Edge-partitions of planar graphs and their game coloring numbers. 307-317 - Dan Archdeacon:
Two graphs without planar covers. 318-326 - Guantao Chen, Ralph J. Faudree, Michael S. Jacobson:
Fragile graphs with small independent cuts. 327-341
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.
last updated on 2025-01-14 21:16 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:
