Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 70
Volume 70, Number 1, May 2012
- Italo J. Dejter
:
From the Coxeter Graph to the Klein Graph. 1-9 - Daniel W. Cranston, Nitish Korula, Timothy D. LeSaulnier, Kevin G. Milans, Christopher J. Stocker, Jennifer Vandenbussche, Douglas B. West:
Overlap number of graphs. 10-28 - Arthur H. Busch, Michael J. Ferrara, Stephen G. Hartke, Michael S. Jacobson, Hemanshu Kaul, Douglas B. West:
Packing of graphic n-tuples. 29-39 - Jun Fujisawa, Katsuhiro Ota:
Maximal K3's and Hamiltonicity of 4-connected claw-free graphs. 40-53 - Béla Bollobás, Mykhaylo Tyomkyn:
Walks and paths in trees. 54-66 - Ryo Hanaki:
On strongly almost trivial embeddings of graphs. 67-79 - Peter Dankelmann, David Erwin, Simon Mukwembi, Bernardo Gabriel Rodrigues, Eric C. Mwambene, Gert Sabidussi:
Automorphism group and diameter of a graph. 80-91 - Albert Bush, Yi Zhao:
Minimum degree thresholds for bipartite graph tiling. 92-120
Volume 70, Number 2, June 2012
- John Maharry, Daniel C. Slilaty:
Projective-Planar Graphs with No K3, 4-Minor. 121-134 - Min Chen, André Raspaud:
A sufficient condition for planar graphs to be acyclically 5-choosable. 135-151 - Noga Zewi:
Vector representation of graph domination. 152-170 - Dhruv Mubayi:
Books Versus triangles. 171-179 - Lydia Ostermeier, Marc Hellmuth, Peter F. Stadler:
The Cartesian product of hypergraphs. 180-196 - Xiuyun Wang, Yan-Quan Feng:
Tetravalent half-edge-transitive graphs and non-normal Cayley graphs. 197-213 - László Lovász, Balázs Szegedy:
Random graphons and a weak Positivstellensatz for graphs. 214-225 - Jessica McDonald, Bojan Mohar, Diego Scheide:
Kempe Equivalence of Edge-Colorings in Subcubic and Subquartic Graphs. 226-239
Volume 70, Number 3, July 2012
- Mark N. Ellingham, Michael D. Plummer, Gexin Yu:
Linkage for the diamond and the path with four vertices. 241-261 - Feng Ming Dong, Khee Meng Koh:
The 3-connectivity of a graph and the multiplicity of zero "2" of its chromatic polynomial. 262-283
- Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
Long cycles in subgraphs of (pseudo)random directed graphs. 284-296
- M. Amin Bahmanian, C. A. Rodger:
Multiply balanced edge colorings of multigraphs. 297-317 - Robert Berke, Penny E. Haxell, Tibor Szabó:
Bounded transversals in multipartite graphs. 318-331 - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Integral trees of odd diameters. 332-338 - Choongbum Lee, Joonkyung Lee, Sang-il Oum:
Rank-width of random graphs. 339-347 - Tsai-Lien Wong, Xuding Zhu:
Antimagic labelling of vertex weighted graphs. 348-350
Volume 70, Number 4, August 2012
- Sergey V. Savchenko:
Non-Critical Vertices and Long Circuits in Strong Tournaments of Order n and Diameter d. 361-383 - Stefko Miklavic, Primoz Sparl:
Hamilton cycle and Hamilton path extendability of Cayley graphs on abelian groups. 384-403 - Shinya Fujita, Colton Magnant:
Extensions of Gallai-Ramsey results. 404-426 - Terry S. Griggs, Jozef Sirán, R. Bruce Richter:
Graphs obtained from Moufang loops and regular maps. 427-434 - István Kovács, Mary Servatius:
On Cayley digraphs on nonisomorphic 2-groups. 435-448 - Maria Chudnovsky, Yori Zwols:
Large cliques or stable sets in graphs with no four-edge path and no five-edge path in the complement. 449-472 - Vahan V. Mkrtchyan, Eckhard Steffen:
Maximum Δ-edge-colorable subgraphs of class II graphs. 473-482
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-05-10 18:48 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:
