Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 92
Volume 92, Number 1, September 2019
- Yuefang Sun
, Gregory Z. Gutin, Anders Yeo, Xiaoyan Zhang:
Strong subgraph k-connectivity. 5-18 - Mi-Mi Zhang, Jin-Xin Zhou:
Tetravalent half-arc-transitive bi-p-metacirculants. 19-38 - Tomás Kaiser, Robert Lukot'ka, Edita Mácajová, Edita Rollová:
Shorter signed circuit covers of graphs. 39-56 - Matthew Barnes, Bogdan Oporowski:
A note on immersion intertwines of infinite graphs. 57-62
Volume 92, Number 2, October 2019
- Maria Chudnovsky, Chun-Hung Liu, Oliver Schaudt, Sophie Spirkl, Nicolas Trotignon, Kristina Vuskovic:
Triangle-free graphs that do not contain an induced subdivision of K4 are 3-colorable. 67-95 - Sam Mattheus, Francesco Pavese, Leo Storme:
On the independence number of graphs related to a polarity. 96-110 - Lionel Pournin:
Eccentricities in the flip-graphs of convex polygons. 111-129 - Jørgen Bang-Jensen, Stéphane Bessy, Frédéric Havet, Anders Yeo:
Bipartite spanning sub(di)graphs induced by 2-partitions. 130-151 - Ho-Jin Choi, Ilkyoo Choi, Jisu Jeong, Sang-il Oum:
Online Ramsey theory for a triangle on -free graphs. 152-171 - Hannah Guggiari, Alex Scott:
Maximising -colourings of graphs. 172-185
Volume 92, Number 3, November 2019
- Zdenek Dvorák, Sergey Norin, Luke Postle:
List coloring with requests. 191-206 - Hongliang Lu, Yan Wang, Xingxing Yu:
Minimum codegree condition for perfect matchings in k-partite k-graphs. 207-229 - Anja Fischer, Frank Fischer:
Counting degree sequences of spanning trees in bipartite graphs: A graph-theoretic proof. 230-236 - Maria Chudnovsky, Alex Scott, Paul D. Seymour:
Induced subgraphs of graphs with large chromatic number. XII. Distant stars. 237-254 - António Girão, Ross J. Kang:
A precolouring extension of Vizing's theorem. 255-260 - Maxime Faron, Luke Postle:
On the clique number of the square of a line graph and its relation to maximum degree of the line graph. 261-274 - Meysam Miralaei, G. R. Omidi, Maryam Shahsiah:
Size Ramsey numbers of stars versus cliques. 275-286 - Bhalchandra D. Thatte:
The edge-subgraph poset of a graph and the edge reconstruction conjecture. 287-303 - Mirko Petrusevski, Riste Skrekovski:
Coverability of graph by three odd subgraphs. 304-321 - Serge Gaspers, Shenwei Huang:
Linearly χ-bounding (P6, C4)-free graphs. 322-342
Volume 92, Number 4, December 2019
- Ron Aharoni, Matt DeVos, Ron Holzman:
Rainbow triangles and the Caccetta-Häggkvist conjecture. 347-360 - Fengming Dong:
A survey on the study of real zeros of flow polynomials. 361-376 - Konrad K. Dabrowski, François Dross, Matthew Johnson, Daniël Paulusma:
Filling the complexity gaps for colouring planar and bounded degree graphs. 377-393 - Xiao Wang, You Lu, Cun-Quan Zhang, Shenggui Zhang:
Six-flows on almost balanced signed graphs. 394-404 - Michael Anastos, Alan M. Frieze:
How many randomly colored edges make a randomly colored dense graph rainbow Hamiltonian or rainbow connected? 405-414 - Marién Abreu, Jan Goedgebeur, Domenico Labbate, Giuseppe Mazzuoccolo:
Colourings of cubic graphs inducing isomorphic monochromatic subgraphs. 415-444 - Matija Bucic, Shoham Letzter, Benny Sudakov:
3-Color bipartite Ramsey number of cycles and paths. 445-459 - Daniel W. Cranston:
A characterization of (4, 2)-choosable graphs. 460-487
- Douglas R. Woodall:
Erratum: The average degree of an edge-chromatic critical graph II. 488-490
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-08-16 18:20 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:
