Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 101
Volume 101, Number 1, January 2011
- Ron Aharoni, Eli Berger, Agelos Georgakopoulos, Amitai Perlstein, Philipp Sprüssel
:
The Max-Flow Min-Cut theorem for countable networks. 1-17 - Maria Chudnovsky, Bruce A. Reed, Paul D. Seymour:
The edge-density for K2, t minors. 18-46 - Maria Chudnovsky, Paul D. Seymour:
A well-quasi-order for tournaments. 47-53 - Ken-ichi Kawarabayashi, Kenta Ozeki:
Non-separating subgraphs after deleting many disjoint paths. 54-59 - Anthony Bonato, Henning Bruhn, Reinhard Diestel, Philipp Sprüssel:
Twins of rayless graphs. 60-65
Volume 101, Number 2, March 2011
- József Balogh, Béla Bollobás, Miklós Simonovits:
The fine structure of octahedron-free graphs. 67-84 - Noga Alon, József Balogh, Béla Bollobás, Robert Morris:
The structure of almost all graphs in a hereditary property. 85-110 - Guoli Ding, Bogdan Oporowski, Robin Thomas, Dirk Vertigan:
Large non-planar graphs and an application to crossing-critical graphs. 111-121
Volume 101, Number 3, May 2011
- Jeffrey Azzato:
Linked tree-decompositions of represented infinite matroids. 123-140 - Carolyn Chun, Dillon Mayhew, James G. Oxley:
A chain theorem for internally 4-connected binary matroids. 141-189
Volume 101, Number 4, July 2011
- Jin Ho Kwak, Young Soo Kwon:
Classification of nonorientable regular embeddings of complete bipartite graphs. 191-205 - Ken-ichi Kawarabayashi, Seiya Negami, Michael D. Plummer, Yusuke Suzuki:
The 2-extendability of 5-connected graphs on surfaces with large representativity. 206-213 - Mark Bilinski, Bill Jackson, Jie Ma, Xingxing Yu:
Circumference of 3-connected claw-free graphs and large Eulerian subgraphs of 3-edge-connected graphs. 214-236 - Torsten Mütze, Reto Spöhel, Henning Thomas:
Small subgraphs in random graphs and the power of multiple choices. 237-268
Volume 101, Number 5, September 2011
- László Lovász, Balázs Szegedy:
Finitely forcible graphons. 269-301 - Fedor V. Fomin, Petr A. Golovach, Dimitrios M. Thilikos:
Contraction obstructions for treewidth. 302-314 - Olivier Bernardi, Mireille Bousquet-Mélou:
Counting colored planar maps: Algebraicity results. 315-377
- Naonori Kakimura, Ken-ichi Kawarabayashi, Dániel Marx:
Packing cycles through prescribed vertices. 378-381
Volume 101, Number 6, November 2011
- Tomás Kaiser, Andrew D. King, Daniel Král':
Fractional total colourings of graphs of high girth. 383-402 - Dan Hefetz:
On two generalizations of the Alon-Tarsi polynomial method. 403-414 - Daniela Kühn, Richard Mycroft, Deryk Osthus:
An approximate version of Sumnerʼs universal tournament conjecture. 415-447 - Matt DeVos, Bojan Mohar, Robert Sámal:
Unexpected behaviour of crossing sequences. 448-463 - André Raspaud, Xuding Zhu:
Circular flow on signed graphs. 464-479 - Suil O, Douglas B. West, Hehui Wu:
Longest cycles in k-connected graphs with given independence number. 480-485 - Edwin R. van Dam, Willem H. Haemers:
An odd characterization of the generalized odd graphs. 486-489 - Weifan Wang, Xuding Zhu:
Entire colouring of plane graphs. 490-501
- Jan-Oliver Fröhlich, Theodor Müller:
Linear connectivity forces large complete bipartite minors: An alternative approach. 502-508 - Domingos Dellamonica Jr., Vojtech Rödl:
A note on Thomassenʼs conjecture. 509-515
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-04-22 21:05 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:
