


default search action
Journal of Combinatorial Theory, Series B, Volume 140
Volume 140, January 2020
- João Paulo Costalonga

:
Contractible edges in 3-connected graphs that preserve a minor. 1-26 - Adel Alahmadi, Robert E. L. Aldred, Carsten Thomassen

:
Cycles in 5-connected triangulations. 27-44 - Maria Chudnovsky

, Jan Goedgebeur
, Oliver Schaudt, Mingxian Zhong
:
Obstructions for three-coloring graphs without induced paths on six vertices. 45-83 - Maria Chudnovsky

, Alex Scott, Paul D. Seymour
, Sophie Spirkl
:
Induced subgraphs of graphs with large chromatic number. VIII. Long odd holes. 84-97 - Lutz Warnke:

On the missing log in upper tail estimates. 98-146 - Hal A. Kierstead, Landon Rabern:

Improved lower bounds on the number of edges in list critical and online list critical graphs. 147-170 - Joshua Erde

, Florian Lehner
, Max Pitz:
Hamilton decompositions of one-ended Cayley graphs. 171-191 - Jordan Awan, Olivier Bernardi

:
Tutte polynomials for directed graphs. 192-247 - Matthias Kriesell:

Maximal ambiguously k-colorable graphs. 248-262 - Nick Brettell

, Ben Clark, James G. Oxley, Charles Semple
, Geoff Whittle:
Excluded minors are almost fragile. 263-322 - Markus Chimani, Petr Hlinený

, Gelasio Salazar:
Toroidal grid minors and stretch in embedded graphs. 323-371 - Ringi Kim

, O-joung Kwon, Sang-il Oum
, Vaidy Sivaraman:
Classes of graphs with no long cycle as a vertex-minor are polynomially χ-bounded. 372-386

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














