default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 123
Volume 123, March 2017
- Francesco Grande, Raman Sanyal:
Theta rank, levelness, and matroid minors. 1-31 - Reinhard Diestel, Julian Pott:
Dual trees must share their ends. 32-53 - Zdenek Dvorák
, Bernard Lidický, Bojan Mohar:
5-choosability of graphs with crossings far apart. 54-96 - Daniel Irving Bernstein, Seth Sullivant:
Unimodular binary hierarchical models. 97-125 - Ilkyoo Choi, O-joung Kwon, Sang-il Oum:
Coloring graphs without fan vertex-minors and graphs without cycle pivot-minors. 126-147 - Oleg Pikhurko, Zelealem B. Yilma:
Supersaturation problem for color-critical graphs. 148-185 - Bruno Courcelle:
Several notions of rank-width for countable graphs. 186-214 - Jin-Xin Zhou:
Edge-transitive almost self-complementary graphs. 215-239
- Jie Ma:
On edges not in monochromatic copies of a fixed bipartite graph. 240-248
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-10-04 19:49 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:
