default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 65
Volume 65, Number 1, September 2010
- Leizhen Cai, Weifan Wang, Xuding Zhu:
Choosability of toroidal graphs without short cycles. 1-15 - Mathew Cropper, Anthony J. W. Hilton, Peter D. Johnson Jr., Jenö Lehel:
List multicoloring problems involving the k-fold Hall numbers. 16-34 - John Baptist Gauci
, Anthony J. W. Hilton:
Continuous k-to-1 functions between complete graphs whose orders are of a different parity. 35-60 - Wolfgang Mader:
Connectivity keeping paths in k-connected graphs. 61-69 - Dan Hefetz, Annina Saluz, Huong T. T. Tran:
An application of the combinatorial Nullstellensatz to a graph labelling problem. 70-82
Volume 65, Number 2, October 2010
- Oleg V. Borodin, Anna O. Ivanova, Mickaël Montassier, Pascal Ochem, André Raspaud:
Vertex decompositions of sparse graphs into an edgeless subgraph and a subgraph of maximum degree at most k. 83-93 - Keith Edwards:
Achromatic number of fragmentable graphs. 94-114 - Diego Scheide, Michael Stiebitz:
Vizing's coloring algorithm and the fan number. 115-138 - Drago Bokal:
Infinite families of crossing-critical graphs with prescribed average degree and crossing number. 139-162 - Arnaud Pêcher, Xuding Zhu:
Claw-free circular-perfect graphs. 163-172
Volume 65, Number 3, November 2010
- Hikoe Enomoto, Kenta Ozeki:
The independence number condition for the existence of a spanning f-tree. 173-184 - Pu Gao:
Connectivity of random regular graphs generated by the pegging algorithm. 185-197 - Petr Hlinený, Gelasio Salazar:
Stars and bonds in crossing-critical graphs. 198-215 - István Kovács, Klavdija Kutnar, Dragan Marusic:
Classification of edge-transitive rose window graphs. 216-231 - Bin Jia, Zai Ping Lu, Gai Xia Wang:
A class of symmetric graphs with 2-arc transitive quotients. 232-245 - Ajit A. Diwan:
Cycles of even lengths modulo k. 246-252 - Momchil Rusinov, Pascal Schweitzer:
Homomorphism-homogeneous graphs. 253-262
Volume 65, Number 4, December 2010
- Dennis D. A. Epple, Jing Huang:
A note on the bichromatic numbers of graphs. 263-269 - Sean McGuinness:
Cycle and cocycle coverings of graphs. 270-284 - Jin-Xin Zhou, Yan-Quan Feng:
Cubic vertex-transitive graphs of order 2pq. 285-302 - Yori Zwols:
K4-free graphs with no odd hole: Even pairs and the circular chromatic number. 303-322 - Abhijin Adiga, L. Sunil Chandran:
Cubicity of interval graphs and the claw number. 323-333 - Anthony Bonato, Gena Hahn, Claude Tardif:
Large classes of infinite k-cop-win graphs. 334-342 - Alexandr V. Kostochka:
On Ks, t minors in (s+t)-chromatic graphs. 343-350
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-10-31 22:07 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:
