Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 61
Volume 61, Number 1, May 2009
- Jim Geelen, Sang-il Oum:
Circle graph obstructions under pivoting. 1-11 - András Gyárfás, Gábor N. Sárközy, Richard H. Schelp:
Multipartite Ramsey numbers for odd cycles. 12-21 - Henry Liu, Robert Morris, Noah Prince:
Highly connected monochromatic subgraphs of multicolored graphs. 22-44 - Bostjan Bresar, Douglas F. Rall
:
Fair reception and Vizing's conjecture. 45-54 - Stasys Jukna:
On set intersection representations of graphs. 55-75
Volume 61, Number 2, June 2009
- Debra L. Boutin:
The determining number of a Cartesian product. 77-87 - Armen S. Asratian, Carl Johan Casselgren, Jennifer Vandenbussche, Douglas B. West:
Proper path-factors and interval edge-coloring of (3, 4)-biregular bigraphs. 88-97 - Petr Vojtechovský:
Periods in missing lengths of rainbow cycles. 98-110 - Ya-Chen Chen:
Minimum C5-saturated graphs. 111-126 - Michael J. Pelsmajer:
Equitable list coloring and treewidth. 127-139 - Jenö Lehel, Frédéric Maffray, Myriam Preissmann:
Maximum directed cuts in digraphs with degree restriction. 140-156
Volume 61, Number 3, July 2009
- Josep Díaz, Alexis C. Kaporis, G. D. Kemkes, Lefteris M. Kirousis, Xavier Pérez-Giménez, Nicholas C. Wormald:
On the chromatic number of a random 5-regular graph. 157-191 - Manu Basavaraju, L. Sunil Chandran:
Acyclic edge coloring of graphs with maximum degree 4. 192-209 - Tao Jiang, Oleg Pikhurko:
Anti-Ramsey numbers of doubly edge-critical graphs. 210-218 - Guoli Ding, Jinko Kanno, Jianning Su:
Generating 5-regular planar graphs. 219-240
Volume 61, Number 4, August 2009
- Frédéric Havet, Ross J. Kang, Tobias Müller, Jean-Sébastien Sereni:
Circular choosability. 241-270 - Charles Delorme, Leif K. Jørgensen, Mirka Miller, Guillermo Pineda-Villavicencio:
On bipartite graphs of diameter 3 and defect 2. 271-288 - Flavia Bonomo, Guillermo Durán, Luciano N. Grippo, Martín Darío Safe:
Partial characterizations of circular-arc graphs. 289-306 - Weifan Wang, Min Chen:
Planar graphs without 4-cycles are acyclically 6-choosable. 307-323 - Vladimir P. Korzhik:
Complete triangulations of a given order generated from a multitude of nonisomorphic cubic graphs by current assignments. 324-334
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-08 20:47 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:
