default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 99
Volume 99, Number 1, January 2009
- Jim Geelen, Kasper Kabell:
Projective geometries in dense matroids. 1-8 - József Balogh, Béla Bollobás, Michael E. Saks, Vera T. Sós:
The unlabelled speed of a hereditary graph property. 9-19 - Jim Geelen, Bert Gerards, Bruce A. Reed, Paul D. Seymour
, Adrian Vetta:
On the odd-minor variant of Hadwiger's conjecture. 20-29 - Ken-ichi Kawarabayashi, Bruce A. Reed, Orlando Lee:
Removable cycles in non-bipartite graphs. 30-38 - Dan Hefetz, Michael Krivelevich, Milos Stojakovic, Tibor Szabó:
Fast winning strategies in Maker-Breaker games. 39-47 - Bryan Clair:
Zeta functions of graphs with I actions. 48-61 - Xuding Zhu:
Bipartite subgraphs of triangle-free subcubic graphs. 62-83 - Jamel Dammak, Gérard Lopez, Maurice Pouzet, Hamza Si Kaddour:
Hypomorphy of graphs up to complementation. 84-96 - Kiyoshi Ando, Yoshimi Egawa, Ken-ichi Kawarabayashi, Matthias Kriesell:
On the number of 4-contractible edges in 4-connected graphs. 97-109 - Qing Cui, Jian Wang, Xingxing Yu:
Hamilton circles in infinite planar graphs. 110-138 - Yusuke Kobayashi, Kenjiro Takazawa:
Even factors, jump systems, and discrete convexity. 139-161 - Klavdija Kutnar, Dragan Marusic:
A complete classification of cubic symmetric graphs of girth 6. 162-184 - Primoz Potocnik, Mateja Sajna:
Brick assignments and homogeneously almost self-complementary graphs. 185-201 - David J. Grynkiewicz, Vsevolod F. Lev, Oriol Serra:
Connectivity of addition Cayley graphs. 202-217 - Martin Grohe, Dániel Marx:
On tree width, bramble size, and expansion. 218-228 - Ken-ichi Kawarabayashi, Atsuhiro Nakamoto, Yusuke Suzuki:
N-flips in even triangulations on surfaces. 229-246 - Jim Geelen, Bert Gerards:
Excluding a group-labelled graph. 247-253 - Marston D. E. Conder, Young Soo Kwon, Jozef Sirán:
Reflexibility of regular Cayley maps for abelian groups. 254-260 - Wei Wang:
A uniqueness theorem on matrices and reconstruction. 261-265 - Yeh-jong Pan, Chih-Wen Weng:
A note on triangle-free distance-regular graphs with a2!=0. 266-270 - Marién Abreu, Robert E. L. Aldred, Martin Funk, Bill Jackson, Domenico Labbate, John Sheehan:
Corrigendum to "Graphs and digraphs with all 2-factors isomorphic" [J. Combin. Theory Ser. B 92 (2) (2004) 395-404]. 271-273
Volume 99, Number 2, March 2009
- Henning Bruhn, Reinhard Diestel:
MacLane's theorem for arbitrary surfaces. 275-286 - Sebastian M. Cioaba, David A. Gregory, Willem H. Haemers:
Matchings in regular graphs from eigenvalues. 287-297 - Hal A. Kierstead, Alexandr V. Kostochka:
Ore-type versions of Brooks' theorem. 298-305 - Bojan Mohar:
On the sum of k largest eigenvalues of graphs and symmetric matrices. 306-313 - Daniel Gonçalves:
Covering planar graphs with forests, one having bounded maximum degree. 314-322 - Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors: [J. Combin. Theory Ser. B Vol. 99(2)]. 323 - Baogang Xu, Xingxing Yu:
Judicious k-partitions of graphs. 324-337 - David G. Wagner:
Weighted enumeration of spanning subgraphs with degree constraints. 347-357 - Matt DeVos, Luis A. Goddyn, Bojan Mohar, Robert Sámal:
Cayley sum graphs and eigenvalues of (3, 6)-fullerenes. 358-369 - Maria Chudnovsky, Paul D. Seymour:
Even pairs in Berge graphs. 370-377 - Robert Gray:
k-CS-transitive infinite graphs. 378-398 - Hong-Jian Lai, Yehong Shao, Hehui Wu, Ju Zhou:
On mod (2p+1)-orientations of graphs. 399-406 - Jim Geelen, Kasper Kabell:
The Erdös-Pósa property for matroid circuits. 407-419 - Jim Geelen, Joseph P. S. Kung, Geoff Whittle:
Growth rates of minor-closed classes of matroids. 420-427 - Gregory B. Sorkin, Angelika Steger, Rico Zenklusen:
A tight bound on the collection of edges in MSTs of induced subgraphs. 428-435 - Jácint Szabó:
Good characterizations for some degree constrained subgraphs. 436-446 - Cai Heng Li:
Vertex transitive embeddings of complete graphs. 447-454 - Marston D. E. Conder:
Regular maps and hypermaps of Euler characteristic -1 to -200. 455-459 - Ryan Dotson, Brendan Nagle:
Hereditary properties of hypergraphs. 460-473 - Carsten Thomassen:
The chromatic polynomial and list colorings. 474-479 - Ju-Mok Oh:
Regular t-balanced Cayley maps on semi-dihedral groups. 480-493 - Jacob Fox, Po-Shen Loh, Benny Sudakov:
Large induced trees in Kr-free graphs. 494-501 - Alexander Schrijver:
Graph invariants in the spin model. 502-511 - Hein van der Holst:
A polynomial-time algorithm to find a linkless embedding of a graph. 512-530
Volume 99, Number 3, May 2009
- Gérard Cornuéjols, Bertrand Guenin, Levent Tunçel:
Lehman matrices. 531-556 - Thomas Böhme, Ken-ichi Kawarabayashi, John Maharry, Bojan Mohar:
Linear connectivity forces large complete bipartite minors. 557-582 - Neil Robertson, Paul D. Seymour:
Graph minors. XXI. Graphs with unique linkages. 583-616 - Sergei Chmutov:
Generalized duality for graphs on surfaces and the signed Bollobás-Riordan polynomial. 617-638 - Dhruv Mubayi, Reshma Ramadurai:
Set systems with union and intersection constraints. 639-642 - Dhruv Mubayi, Jacques Verstraëte:
Two-regular subgraphs of hypergraphs. 643-655
Volume 99, Number 4, July 2009
- Jim Geelen, Bert Gerards, Geoff Whittle:
Tangles, tree-decompositions and grids in matroids. 657-667 - Oleg V. Borodin, Alexei N. Glebov, Mickaël Montassier, André Raspaud:
Planar graphs without 5- and 7-cycles and without adjacent triangles are 3-colorable. 668-673 - Ken-ichi Kawarabayashi, Carsten Thomassen:
Decomposing a planar graph of girth 5 into an independent set and a forest. 674-684 - Dillon Mayhew, Mike Newman, Geoff Whittle:
On excluded minors for real-representability. 685-689 - Fabrício Siqueira Benevides, Jozef Skokan:
The 3-colored Ramsey number of even cycles. 690-708 - Peter Keevash, Benny Sudakov:
Triangle packings and 1-factors in oriented graphs. 709-727
- Ken-ichi Kawarabayashi:
Note on coloring graphs without odd-Kk-minors. 728-731
Volume 99, Number 5, September 2009
- Ton Kloks, Haiko Müller, Kristina Vuskovic:
Even-hole-free graphs that do not contain diamonds: A structure theorem and its consequences. 733-800 - Tobias Müller, Robert J. Waters:
Circular choosability is rational. 801-813
- Armen S. Asratian:
A note on transformations of edge colorings of bipartite graphs. 814-818
Volume 99, Number 6, November 2009
- Vladimir Nikiforov:
More spectral bounds on the clique and independence numbers. 819-826 - Sean McGuinness:
Ore-type and Dirac-type theorems for matroids. 827-842 - Hiroshi Hirai:
Tight spans of distances and the dual fractionality of undirected multiflow problems. 843-868 - Bill Jackson, Alan D. Sokal:
Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids. 869-903 - Darryn E. Bryant, Victor Scharaschkin:
Complete solutions to the Oberwolfach problem for an infinite set of orders. 904-918
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-05-20 23:13 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:
