Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 58
Volume 58, Number 1, May 2008
- Nicolas Bougard, Gwenaël Joret:
Turán's theorem and k-connected graphs. 1-13 - Alexandr V. Kostochka, Gexin Yu:
Ore-type degree conditions for a graph to be H-linked. 14-26 - Wei-Fan Wang, Ko-Wei Lih:
Coupled choosability of plane graphs. 27-44 - Ehsan Chiniforooshan:
A better bound for the cop number of general graphs. 45-48 - Clemens Heuberger, Stephan G. Wagner:
Maximizing the number of independent subsets over trees with bounded degree. 49-68 - Endre Boros, Vladimir Gurvich, Igor E. Zverovich:
Neighborhood hypergraphs of bipartite graphs. 69-95
Volume 58, Number 2, June 2008
- Shinya Fujita, Ken-ichi Kawarabayashi:
Contractible elements in k-connected graphs not containing some specified graphs. 97-109 - Manouchehr Zaker:
New bounds for the chromatic number of graphs. 110-122 - Maria Axenovich, André E. Kézdy
, Ryan R. Martin:
On the editing distance of graphs. 123-138 - Dieter Rautenbach:
A conjecture of Borodin and a coloring of Grünbaum. 139-147 - Penny E. Haxell:
An improved bound for the strong chromatic number. 148-158 - Paul Wollan:
Extremal functions for rooted minors. 159-178 - Jun Fujisawa, Tomoki Yamashita:
Cycles passing through k + 1 vertices in k-connected graphs. 179-190
Volume 58, Number 3, July 2008
- Prosenjit Bose, Vida Dujmovic, Danny Krizanc, Stefan Langerman, Pat Morin, David R. Wood, Stefanie Wuhrer:
A Characterization of the degree sequences of 2-trees. 191-209 - Jian-Liang Wu, Yu-Wen Wu:
The linear arboricity of planar graphs of maximum degree seven is four. 210-220 - Zhongyuan Che, Karen L. Collins, Claude Tardif:
Odd-angulated graphs and cancelling factors in box products. 221-238 - David Cariolaro, Hung-Lin Fu:
On minimum sets of 1-factors covering a complete multipartite graph. 239-250 - Scott Heard, Jing Huang:
Disjoint quasi-kernels in digraphs. 251-260 - Serguei Norine:
On two questions about circular choosability. 261-269 - Jim Geelen, Anjie Guo, David McKinnon:
Straight line embeddings of cubic planar graphs with integer edge lengths. 270-274
Volume 58, Number 4, August 2008
- Thomas Andreae:
On self-immersions of infinite graphs. 275-285 - Carsten Thomassen:
Decompositions of highly connected graphs into paths of length 3. 286-292 - Etienne Birmelé:
Every longest circuit of a 3-connected, K3, 3-minor free graph has a chord. 293-298 - Bill Cuckler, Felix Lazebnik:
Irregularity strength of dense graphs. 299-313 - Daniel Král, Ladislav Stacho:
Hamiltonian threshold for strong products of graphs. 314-328 - Guantao Chen, Ralph J. Faudree, Xuechao Li, Ingo Schiermeyer:
Non-path spectrum sets. 329-350 - David Conlon:
A new upper bound for the bipartite Ramsey problem. 351-356
a service of 
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 2024-04-25 05:29 CEST 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:
