Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 69
Volume 69, Number 1, January 2012
- Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of 2-degenerate graphs. 1-27 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson, Colton Magnant:
Distributing vertices on Hamiltonian cycles. 28-45 - Bostjan Bresar, Paul Dorbec
, Wayne Goddard, Bert L. Hartnell, Michael A. Henning, Sandi Klavzar, Douglas F. Rall:
Vizing's conjecture: a survey and recent results. 46-76 - Klavdija Kutnar, Dragan Marusic, Cui Zhang:
On cubic non-Cayley vertex-transitive graphs. 77-95
Volume 69, Number 2, February 2012
- Debra L. Boutin, Sally Cockburn:
Geometric graph homomorphisms. 97-113 - Konstantinos Panagiotou, Makrand Sinha:
Vertices of degree k in random unlabeled trees. 114-130 - Daniel Král', Petr Skoda, Jan Volec:
Domination number of cubic graphs with large girth. 131-142 - Atsuhiro Nakamoto, Kenta Ozeki:
Hamiltonian cycles in bipartite quadrangulations on the torus. 143-151 - R. Bruce Richter, Jozef Sirán, Yan Wang:
Self-dual and self-petrie-dual regular maps. 152-159 - Penny Haxell, Jessica McDonald:
On characterizing Vizing's edge colouring bound. 160-168 - Tomasz Luczak, Miklós Simonovits, Jozef Skokan:
On the multi-colored Ramsey numbers of cycles. 169-175 - Alice Devillers, Michael Giudici, Cai Heng Li, Cheryl E. Praeger:
Locally s-distance transitive graphs. 176-197 - Nathalie Paul, Claude Tardif:
The chromatic Ramsey number of odd wheels. 198-205 - Paul S. Bonsma, Arthur M. Farley, Andrzej Proskurowski:
Extremal graphs having no matching cuts. 206-222
Volume 69, Number 3, March 2012
- Fan R. K. Chung, Paul Horn, Linyuan Lu:
Diameter of random spanning trees in a given graph. 223-240 - Roman Kuzel, Zdenek Ryjácek, Petr Vrána:
Thomassen's conjecture implies polynomiality of 1-Hamilton-connectedness in line graphs. 241-250 - Ralph J. Faudree, Colton Magnant, Kenta Ozeki, Kiyoshi Yoshimoto:
Claw-free graphs and 2-factors that separate independent vertices. 251-263 - Julia Böttcher, Jan Hladký, Diana Piguet:
The tripartite Ramsey number for trees. 264-300 - Atsuhiro Nakamoto, Yusuke Suzuki:
Y-rotation in k-minimal quadrangulations on the projective plane. 301-313 - Jochen Harant, Arnfried Kemnitz, Akira Saito, Ingo Schiermeyer:
Closures, cycles, and paths. 314-323 - Wolfgang Mader:
Connectivity keeping trees in k-connected graphs. 324-329 - Andrew Treglown:
A note on some embedding problems for oriented graphs. 330-336 - Miklós Ruszinkó:
Large components in r-edge-colorings of Kn have diameter at most five. 337-340 - Jun Ma, Yeong-Nan Yeh:
Combinatorial interpretations for TG(1, -1). 341-348
Volume 69, Number 4, April 2012
- Hongliang Lu:
Regular Graphs, Eigenvalues and Regular Factors. 349-355 - Sandi Klavzar, Sergey V. Shpectorov:
Convex excess in partial cubes. 356-369 - Mike J. Grannell, Martin Knor:
On the number of triangular embeddings of complete graphs and complete tripartite graphs. 370-382 - Alan M. Frieze, Michael Krivelevich, Po-Shen Loh:
Variations on cops and robbers. 383-402 - Marek Cygan, Jianfeng Hou, Lukasz Kowalik, Borut Luzar, Jian-Liang Wu:
A Planar linear arboricity conjecture. 403-425 - Amit Daniely, Nathan Linial:
Tight products and graph expansion. 426-440 - István Kovács, Bostjan Kuzman, Aleksander Malnic, Steve Wilson:
Characterization of edge-transitive 4-valent bicirculants. 441-463 - Xinmin Hou, Hong-Jian Lai, Ping Li, Cun-Quan Zhang:
Group connectivity of complementary graphs. 464-470
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-15 21:41 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:
