default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 100
Volume 100, Number 1, January 2010
- Bill Jackson, Tibor Jordán:
Globally rigid circuits of the direction-length rigidity matroid. 1-22 - Jacob Fox, János Pach, Csaba D. Tóth:
A bipartite strengthening of the Crossing Lemma. 23-35 - Rudi Pendavingh, Stefan H. M. van Zwam:
Lifts of matroid representations over partial fields. 36-67 - Diego Scheide:
Graph edge colouring: Tashkinov trees and Goldberg's conjecture. 68-96
Volume 100, Number 2, March 2010
- Robert Gray, Dugald Macpherson
:
Countable connected-homogeneous graphs. 97-118 - Cheng Yeaw Ku, William Chen:
An analogue of the Gallai-Edmonds Structure Theorem for non-zero roots of the matching polynomial. 119-127 - Jim Geelen, Geoff Whittle:
The projective plane is a stabilizer. 128-131 - Andrzej Dudek, Vojtech Rödl:
An almost quadratic bound on vertex Folkman numbers. 132-140 - Paul Wollan:
Packing non-zero A-paths in an undirected model of group labeled graphs. 141-150 - Yoshiharu Kohayakawa, Brendan Nagle, Vojtech Rödl, Mathias Schacht:
Weak hypergraph regularity and linear hypergraphs. 151-160 - Andrew Vince, Hua Wang:
The average order of a subtree of a tree. 161-170 - Zdenek Dvorák, Serguei Norine:
Small graph classes and bounded expansion. 171-175 - Stéphane Bessy, Stéphan Thomassé:
Partitioning a graph into a cycle and an anticycle, a proof of Lehel's conjecture. 176-180 - Neil Robertson, Paul D. Seymour:
Graph minors XXIII. Nash-Williams' immersion conjecture. 181-205 - Darryn E. Bryant:
Packing paths in complete graphs. 206-215 - Mike J. Grannell, Martin Knor:
A lower bound for the number of orientable triangular embeddings of some complete graphs. 216-225 - Michael Molloy, Bruce A. Reed:
Asymptotically optimal frugal colouring. 226-246
- Michael Molloy, Bruce A. Reed:
Corrigendum to "Asymptotically optimal frugal colouring" [J. Combin. Theory Ser. B 100 (2) (2010) 226-246]. 247-249
Volume 100, Number 3, May 2010
- Luke Kelly, Daniela Kühn, Deryk Osthus:
Cycles of given length in oriented graphs. 251-264 - Peter K. Kwok, Qi Liu, Douglas B. West:
Oriented diameter of graphs with diameter 3. 265-274 - Michael Giudici, Cai Heng Li:
On finite edge-primitive and edge-quasiprimitive graphs. 275-298 - Tom Bohman, Alan M. Frieze, Oleg Pikhurko, Cliff Smyth:
Anti-Ramsey properties of random graphs. 299-312 - Maria Chudnovsky, Neil Robertson, Paul D. Seymour, Robin Thomas:
K4-free graphs with no odd holes. 313-331 - Hiêp Hàn, Mathias Schacht:
Dirac-type results for loose Hamilton cycles in uniform hypergraphs. 332-346
- Maciej Kalkowski, Michal Karonski, Florian Pfender:
Vertex-coloring edge-weightings: Towards the 1-2-3-conjecture. 347-349
Volume 100, Number 4, July 2010
- Daniel Král', Edita Mácajová, Ján Mazák, Jean-Sébastien Sereni:
Circular edge-colorings of cubic graphs with girth six. 351-358 - Cai Heng Li, Liang Niu, Ákos Seress, Ronald Solomon:
The vertex primitive and vertex bi-primitive s-arc regular graphs. 359-366 - Daniela Kühn, Deryk Osthus, Andrew Treglown:
Hamiltonian degree sequences in digraphs. 367-380 - Martin Kochol:
Smallest counterexample to the 5-flow conjecture has girth at least eleven. 381-389 - Amir Daneshgar, Hossein Hajiabolhassan, Ramin Javadi:
On the isoperimetric spectrum of graphs and its approximations. 390-412
- Zdenek Dvorák, Bojan Mohar:
Crossing-critical graphs with large maximum degree. 413-417
Volume 100, Number 5, September 2010
- Cun-Quan Zhang:
Cycle covers (I) - Minimal contra pairs and Hamilton weights. 419-438 - Alexandr V. Kostochka, Pavel Pudlák, Vojtech Rödl:
Some constructive bounds on Ramsey numbers. 439-445 - Gwenaël Joret, David R. Wood:
Irreducible triangulations are small. 446-455 - Peter Keevash, Benny Sudakov:
Pancyclicity of Hamiltonian and highly connected graphs. 456-467 - Olivier Bernardi, Marc Noy, Dominic Welsh:
Growth constants of minor-closed classes of graphs. 468-484 - Petter Brändén, Rafael S. González D'León:
On the half-plane property and the Tutte group of a matroid. 485-492
- Donald K. Wagner:
On Mighton's characterization of graphic matroids. 493-496
Volume 100, Number 6, November 2010
- Primoz Potocnik, Gabriel Verret:
On the vertex-stabiliser in arc-transitive digraphs. 497-509 - Rudi Pendavingh, Stefan H. M. van Zwam:
Confinement of matroid representations to subsets of partial fields. 510-545 - Matthias Kriesell:
Packing Steiner trees on four terminals. 546-553 - Alexandr V. Kostochka, Daniel Král', Jean-Sébastien Sereni, Michael Stiebitz:
Graphs with bounded tree-width and large odd-girth are almost bipartite. 554-559 - Maria Chudnovsky, Paul D. Seymour:
Claw-free graphs VI. Colouring. 560-572 - Jacobus H. Koolen, Sejeong Bang:
On distance-regular graphs with smallest eigenvalue at least -m. 573-584 - Joseph E. Bonin:
Lattice path matroids: The excluded minors. 585-599 - Jie Ma, Xingxing Yu:
Independent paths and K5-subdivisions. 600-616 - Joseph P. S. Kung:
Convolution-multiplication identities for Tutte polynomials of graphs and matroids. 617-624 - Jim Geelen, Peter Nelson:
The number of points in a matroid with no n-point line as a minor. 625-630 - Jie Ma, Pei-Lan Yen, Xingxing Yu:
On several partitioning problems of Bollobás and Scott. 631-649 - Naonori Kakimura:
Matching structure of symmetric bipartite graphs and a generalization of Pólya's problem. 650-670 - Afredo Alzaga, Rodrigo Iglesias, Ricardo Pignol:
Spectra of symmetric powers of graphs and the Weisfeiler-Lehman refinements. 671-682 - Aleksandar Jurisic, Paul M. Terwilliger, Arjana Zitnik:
The Q-polynomial idempotents of a distance-regular graph. 683-690 - Yi Su, David G. Wagner:
The lattice of integer flows of a regular matroid. 691-703 - Asaf Shapira, Raphael Yuster:
On the density of a graph and its blowup. 704-719 - Luis Martínez, Alexander Araluze:
New tools for the construction of directed strongly regular graphs: Difference digraphs and partial sum families. 720-728 - Zdenek Dvorák, Bojan Mohar:
Spectral radius of finite and infinite planar graphs and of graphs of bounded genus. 729-739 - Jim Geelen, Bert Gerards, Geoff Whittle:
On inequivalent representations of matroids over non-prime fields. 740-743
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-11-11 21:17 CET 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:
