Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Combinatorial Theory, Series B, Volume 139
Volume 139, November 2019
- Wenzhong Liu, Serge Lawrencenko
, Beifang Chen, Mark N. Ellingham, Nora Hartsfield, Hui Yang, Dong Ye, Xiaoya Zha:
Quadrangular embeddings of complete graphs and the Even Map Color Theorem. 1-26 - Meysam Alishahi, Hossein Hajiabolhassan:
On chromatic number and minimum cut. 27-46 - Stefan Glock, Daniela Kühn, Allan Lo, Richard Montgomery, Deryk Osthus:
On the decomposition threshold of a given graph. 47-127 - Guantao Chen, Guangming Jing:
Structural properties of edge-chromatic critical multigraphs. 128-162 - Donovan R. Hare:
Tools for counting odd cycles in graphs. 163-192 - Bill Jackson, Anthony Nixon:
Global rigidity of generic frameworks on the cylinder. 193-229 - Yuliang Ji, Jie Ma, Juan Yan, Xingxing Yu:
On problems about judicious bipartitions of graphs. 230-250 - António Girão, Richard Snyder:
Highly linked tournaments with large minimum out-degree. 251-266 - Marcin Wrochna:
On inverse powers of graphs and topological implications of Hedetniemi's conjecture. 267-295 - Dennis Hall:
Unavoidable minors for connected 2-polymatroids. 296-315 - Richard Montgomery:
Hamiltonicity in random graphs is born resilient. 316-341 - Daniel Weißauer:
In absence of long chordless cycles, large tree-width becomes a local phenomenon. 342-352
- Danila D. Cherkashin, Fedor Petrov:
On small n-uniform hypergraphs with positive discrepancy. 353-359
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-06-14 19:07 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:
