![](https://dblp1.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp1.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp1.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp1.uni-trier.de/img/search.dark.16x16.png)
default search action
Journal of Graph Theory, Volume 64
Volume 64, Number 1, May 2010
- Hong-Jian Lai, Liming Xiong, Huiya Yan, Jin Yan:
Every 3-connected claw-free Z8-free graph is Hamiltonian. 1-11 - János Pach, József Solymosi, Gábor Tardos
:
Crossing numbers of imbalanced graphs. 12-21 - Jianfeng Hou, Jianliang Wu, Guizhen Liu, Bin Liu:
Acyclic edge chromatic number of outerplanar graphs. 22-36 - Colton Magnant, Daniel M. Martin:
An asymptotic version of a conjecture by Enomoto and Ota. 37-51 - Arthur H. Busch, Guantao Chen, Michael S. Jacobson:
Transitive partitions in realizations of tournament score sequences. 52-62 - Abdelfattah Abouelaoualim, Kinkar Chandra Das, Wenceslas Fernandez de la Vega, Marek Karpinski, Yannis Manoussakis, Carlos A. J. Martinhon, Rachid Saad:
Cycles and paths in edge-colored graphs with given degrees. 63-86
Volume 64, Number 2, June 2010
- Heather Macbeth
, Jana Siagiová, Jozef Sirán, Tomás Vetrík
:
Large Cayley graphs and vertex-transitive non-Cayley graphs of given degree and diameter. 87-98 - Rev. Michael A. van Opstall, Razvan Veliche:
Cubic graphs with most automorphisms. 99-115 - Suil O
, Douglas B. West:
Balloons, cut-edges, matchings, and total domination in regular graphs of odd degree. 116-131 - Csilla Bujtás
, Zsolt Tuza:
C-perfect hypergraphs. 132-149 - Tibor Szabó, Philipp Zumstein
, Stefanie Zürcher:
On the minimum degree of minimal Ramsey graphs. 150-164 - Manoel Lemos, Talmage James Reid, Haidong Wu:
Characterizing 3-connected planar graphs and graphic matroids. 165-174
Volume 64, Number 3, July 2010
- Neil Robertson, Zi-Xia Song:
Hadwiger number and chromatic number for near regular degree sequences. 175-183 - Daniel Král'
, Ladislav Stacho:
Coloring plane graphs with independent crossings. 184-205 - Florian Pfender
:
Rooted induced trees in triangle-free graphs. 206-209 - Christian Löwenstein, Dieter Rautenbach, Ingo Schiermeyer:
Cycle length parities and the chromatic number. 210-218 - Dan Hefetz
, Torsten Mütze, Justus Schwartz:
On antimagic directed graphs. 219-232 - András Gyárfás, Gábor N. Sárközy, András Sebö, Stanley M. Selkow:
Ramsey-type results for Gallai colorings. 233-243 - Noga Alon, Sonny Ben-Shimon, Michael Krivelevich:
A note on regular Ramsey graphs. 244-249 - Robert E. L. Aldred, Jun Fujisawa
, Akira Saito:
Forbidden subgraphs and the existence of a 2-factor. 250-266
Volume 64, Number 4, August 2010
- Wilfried Imrich
, Iztok Peterin
, Simon Spacapan, Cun-Quan Zhang:
NZ-flows in strong products of graphs. 267-276 - Uriel Feige, Shimon Kogan:
Balanced coloring of bipartite graphs. 277-291 - Louigi Addario-Berry, Ross J. Kang
, Tobias Müller:
Acyclic dominating partitions. 292-311 - Cristina Dalfó, Miguel Angel Fiol
, Ernest Garriga:
The geometry of t-spreads in k-walk-regular graphs. 312-322 - Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami
, Lutz Volkmann:
Proof of a conjecture on game domination. 323-329 - Zdenek Dvorák
:
On recognizing graphs by numbers of homomorphisms. 330-342 - Jaroslav Nesetril
, Tomás Valla
:
On Ramsey-type positional games. 343-354
![](https://dblp1.uni-trier.de/img/cog.dark.24x24.png)
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.