default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 67
Volume 67, Number 1, May 2011
- Bojan Mohar, Andrej Vodopivec:
The genus of Petersen powers. 1-8 - Ya-Chen Chen:
All minimum C5-saturated graphs. 9-26 - Gurusamy Rengasamy Vijayakumar:
Equivalence of four descriptions of generalized line graphs. 27-33 - Nick Gravin, Ning Chen:
A note on k-shortest paths problem. 34-37 - Robert E. L. Aldred, Michael D. Plummer:
Proximity thresholds for matching extension in planar and projective planar triangulations. 38-46 - Qizhong Lin, Yusheng Li:
Multicolor bipartite Ramsey number of C4 and large Kn, n. 47-54 - Gábor Wiener, Makoto Araya:
On planar hypohamiltonian graphs. 55-68 - Luis Cereceda, Jan van den Heuvel
, Matthew Johnson:
Finding paths between 3-colorings. 69-82
Volume 67, Number 2, June 2011
- Oleg V. Borodin, Anna O. Ivanova:
List strong linear 2-arboricity of sparse graphs. 83-90 - Allan Siu Lun Lo:
Constrained Ramsey numbers for rainbow matching. 91-95 - Christian Löwenstein, Anders Sune Pedersen, Dieter Rautenbach, Friedrich Regen:
Independence, odd girth, and average degree. 96-111 - Jochen Harant, Stanislav Jendrol', Tomás Madaras:
Upper bounds on the sum of powers of the degrees of a simple planar graph. 112-123 - Yahya Ould Hamidoune, Anna S. Lladó, Susana-Clara López:
Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors. 124-138 - Tao Jiang:
Compact topological minors in graphs. 139-152 - Amit Chakrabarti, Subhash Khot:
Combinatorial theorems about embedding trees on the real line. 153-168
Volume 67, Number 3, July 2011
- Patrick Bahls:
Channel assignment on Cayley graphs. 169-177 - Daphne Der-Fen Liu, Serguei Norine, Zhishi Pan, Xuding Zhu:
Circular consecutive choosability of k-choosable graphs. 178-197 - Iain Moffatt:
A characterization of partially dual graphs. 198-217 - Huajun Zhang:
Primitivity and independent sets in direct products of vertex-transitive graphs. 218-225 - Dmitry A. Shabanov:
On a generalization of Rubin's theorem. 226-234 - Nicholas Korpelainen, Vadim V. Lozin:
Bipartite induced subgraphs and well-quasi-ordering. 235-249 - Katsuhiro Ota, Michael D. Plummer, Akira Saito:
Forbidden triples for perfect matchings. 250-259
Volume 67, Number 4, August 2011
- Jonathan Cutler, A. J. Radcliffe:
Extremal graphs for homomorphisms. 261-284 - Andrew Bowler, Paul Brown, Trevor I. Fenner, Wendy J. Myrvold:
Recognizing connectedness from vertex-deleted subgraphs. 285-299 - Andrew D. King:
Hitting all maximum cliques with a stable set using lopsided independent transversals. 300-305 - Ken-ichi Kawarabayashi, Kenta Ozeki:
2- and 3-factors of graphs on surfaces. 306-315 - Domingos Dellamonica Jr., Václav Koubek, Daniel M. Martin, Vojtech Rödl:
On a conjecture of Thomassen concerning subgraphs of large girth. 316-331 - J. Adrian Bondy, F. Mercier:
Switching reconstruction of digraphs. 332-348
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 2026-08-11 23:03 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, funded, and maintained by:
Schloss Dagstuhl - Leibniz Center for Informatics is a member of the Leibniz Association and is funded by the federal government of Germany and the states of Germany, especially Saarland and Rhineland‑Palatinate.
