Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 102
Volume 102, Number 1, January 2012
- Henning Bruhn, Akira Saito:
Clique or hole in claw-free graphs. 1-13 - Hao Huang, Choongbum Lee, Benny Sudakov:
Bandwidth theorem for random graphs. 14-37 - Mickaël Montassier, Patrice Ossona de Mendez
, André Raspaud, Xuding Zhu:
Decomposing a graph into forests. 38-52 - Béla Bollobás, Oliver Riordan:
Asymptotic normality of the size of the giant component via a random walk. 53-61 - Dion Gijswijt, Guus Regts:
Polyhedra with the Integer Carathéodory Property. 62-70 - Alexandra Ovetsky Fradkin:
Clique minors in claw-free graphs. 71-85 - César Hernández-Vélez, Gelasio Salazar, Robin Thomas:
Nested cycles in large triangulations and crossing-critical graphs. 86-92 - Maria Chudnovsky, Alexandra Ovetsky Fradkin, Paul D. Seymour:
Tournament immersion and cutwidth. 93-101 - Diana Piguet, Maya Jakobine Stein:
An approximate version of the Loebl-Komlós-Sós conjecture. 102-125 - Jaroslav Nesetril, Yared Nigussie:
Finite dualities and map-critical graphs on a fixed surface. 131-152 - Nicolas Trotignon, Kristina Vuskovic:
Combinatorial optimization with 2-joins. 153-185 - Douglas B. West, Hehui Wu:
Packing of Steiner trees and S-connectors in graphs. 186-205 - Andrei V. Kotlov, Joseph Cheriyan:
On the maximum size of a minimal k-edge connected augmentation. 206-211 - Jie Ma, Xingxing Yu:
Partitioning 3-uniform hypergraphs. 212-232 - Maria Chudnovsky:
The structure of bull-free graphs I - Three-edge-paths with centers and anticenters. 233-251 - Maria Chudnovsky:
The structure of bull-free graphs II and III - A summary. 252-282
Volume 102, Number 2, March 2012
- Vladimir P. Korzhik:
On the 1-chromatic number of nonorientable surfaces with large genus. 283-328 - Colin Cooper, Alan M. Frieze:
Stationary distribution and cover time of random walks on random digraphs. 329-362 - Maria Chudnovsky, Paul D. Seymour:
Three-colourable perfect graphs without even pairs. 363-394 - Béla Csaba, Marcelo Mydlarz:
Approximate multipartite version of the Hajnal-Szemerédi theorem. 395-410 - Bodo Lass:
Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs. 411-423 - Ken-ichi Kawarabayashi, Yusuke Kobayashi, Bruce A. Reed:
The disjoint paths problem in quadratic time. 424-435 - Arun P. Mani:
On some Tutte polynomial sequences in the square lattice. 436-453 - Reinhard Diestel, Ken-ichi Kawarabayashi, Paul Wollan:
The Erdős-Pósa property for clique minors in highly connected graphs. 454-469 - Jana Siagiová, Jozef Sirán:
Approaching the Moore bound for diameter two by Cayley graphs. 470-473 - Robert Gray, Dugald Macpherson, Cheryl E. Praeger, Gordon F. Royle:
Set-homogeneous directed graphs. 474-520 - Carsten Thomassen:
The weak 3-flow conjecture and the weak circular flow conjecture. 521-529 - Neil Robertson, Paul D. Seymour:
Graph Minors. XXII. Irrelevant vertices in linkage problems. 530-563
Volume 102, Number 3, May 2012
- Kristóf Bérczi, Yusuke Kobayashi:
An algorithm for (n-3)-connectivity augmentation problem: Jump system approach. 565-587 - Xujin Chen, Guoli Ding, Xingxing Yu, Wenan Zang:
Bonds with parity constraints. 588-609 - James G. Oxley, Charles Semple, Geoff Whittle:
An upgraded Wheels-and-Whirls Theorem for 3-connected matroids. 610-637 - Jan van den Heuvel, Stéphan Thomassé:
Cyclic orderings and cyclic arboricity of matroids. 638-646 - Rong Chen, Kai-Nan Xiang:
Decomposition of 3-connected representable matroids. 647-670 - Frédéric Mazoit:
Tree-width of hypergraphs and surface duality. 671-687 - Carolyn Chun, Dillon Mayhew, James G. Oxley:
Towards a splitter theorem for internally 4-connected binary matroids. 688-700 - Jørgen Bang-Jensen, Jing Huang:
Decomposing locally semicomplete digraphs into strong spanning subdigraphs. 701-714 - Lale Özkahya, Yury Person:
Minimum H-decompositions of graphs: Edge-critical case. 715-725 - John Engbers, David J. Galvin:
H-colouring bipartite graphs. 726-742 - Ido Ben-Eliezer, Michael Krivelevich, Benny Sudakov:
The size Ramsey number of a directed path. 743-755 - Christian Joseph Altomare:
A semigroup proof of the bounded degree case of S.B. Raoʼs Conjecture on degree sequences and a bipartite analogue. 756-759 - Dillon Mayhew, Geoff Whittle, Stefan H. M. van Zwam:
Stability, fragility, and Rotaʼs Conjecture. 760-783 - Noga Alon, Hao Huang, Benny Sudakov:
Nonnegative k-sums, fractional covers, and probability of small deviations. 784-796 - Cheryl E. Praeger, Pablo Spiga, Gabriel Verret:
Bounding the size of a vertex-stabiliser in a finite vertex-transitive graph. 797-819 - Primoz Potocnik, Pablo Spiga, Gabriel Verret:
On graph-restrictive permutation groups. 820-831 - Huajun Zhang:
Independent sets in direct products of vertex-transitive graphs. 832-838
Volume 102, Number 4, July 2012
- Jinlong Shu, Cun-Quan Zhang, Taoye Zhang:
Flows and parity subgraphs of graphs with large odd-edge-connectivity. 839-851 - Ken-ichi Kawarabayashi, Carsten Thomassen:
From the plane to higher surfaces. 852-868 - Kevin G. Milans, Florian Pfender, Dieter Rautenbach, Friedrich Regen, Douglas B. West:
Cycle spectra of Hamiltonian graphs. 869-874 - Hiroshi Hirai:
Bounded fractionality of the multiflow feasibility problem for demand graph K3+K3 and related maximization problems. 875-899 - Dietmar Berwanger, Anuj Dawar, Paul Hunter, Stephan Kreutzer, Jan Obdrzálek:
The dag-width of directed graphs. 900-923 - Benjamin Lévêque, Frédéric Maffray, Nicolas Trotignon:
On graphs with no induced subdivision of K4. 924-947 - Yusuke Kobayashi, Jácint Szabó, Kenjiro Takazawa:
A proof of Cunningham's conjecture on restricted subgraphs and jump systems. 948-966 - Marston D. E. Conder, Roman Nedela, Jozef Sirán:
Classification of regular maps of Euler characteristic -3p. 967-981 - Tao Feng, Qing Xiang:
Strongly regular graphs from unions of cyclotomic classes. 982-995 - Joseph P. S. Kung:
Congruence conditions, parcels, and Tutte polynomials of graphs and matroids. 996-1019 - Ken-ichi Kawarabayashi, Yusuke Kobayashi:
Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem. 1020-1034
Volume 102, Number 5, September 2012
- Demetres Christofides, Daniela Kühn, Deryk Osthus:
Edge-disjoint Hamilton cycles in graphs. 1035-1060 - Andrzej Grzesik:
On the maximum number of five-cycles in a triangle-free graph. 1061-1066 - Nathan Chenette, Luke Postle, Noah Streib, Robin Thomas, Carl Yerger:
Five-coloring graphs on the Klein bottle. 1067-1098 - Zdenek Dvorák, Bojan Mohar:
Spectrally degenerate graphs: Hereditary case. 1099-1109 - John Engbers, David J. Galvin:
H-coloring tori. 1110-1133 - Matteo Pontecorvi, Paul Wollan:
Disjoint cycles intersecting a set of vertices. 1134-1141 - David Conlon, Jacob Fox, Benny Sudakov:
Erdős-Hajnal-type theorems in hypergraphs. 1142-1154 - András Gyárfás, András Sebö, Nicolas Trotignon:
The chromatic gap and its extremes. 1155-1178 - Katsuhiro Ota, Kenta Ozeki:
Spanning trees in 3-connected K3, t-minor-free graphs. 1179-1188
Volume 102, Number 6, November 2012
- Reinhard Diestel, Ken-ichi Kawarabayashi, Theodor Müller, Paul Wollan:
On the excluded minor structure theorem for graphs of large tree-width. 1189-1210 - Guantao Chen, Xingxing Yu, Wenan Zang:
The circumference of a graph with no K3, t-minor, II. 1211-1240 - Marcelo Henriques de Carvalho, Claudio L. Lucchesi, Uppaluri S. R. Murty:
A generalization of Little's Theorem on Pfaffian orientations. 1241-1266 - Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs. VII. Quasi-line graphs. 1267-1294 - Oleg V. Borodin, Alexei N. Glebov, Tommy R. Jensen:
A step towards the strong version of Havel's three color conjecture. 1295-1320
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: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:
