Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 89
Volume 89, Number 1, September 2018
- Vigleik Angeltveit, Brendan D. McKay
:
R(5, 5) ≤ 48. 5-13 - Long-Tu Yuan:
Extremal graphs for the k-flower. 26-39 - Yezhou Wu, Dong Ye:
Circuit covers of cubic signed graphs. 40-54 - Lucia Draque Penso, Dieter Rautenbach, Uéverton dos Santos Souza:
Graphs in which some and every maximum matching is uniquely restricted. 55-63 - Xindong Zhang, Juan Liu, Lan Wang, Hong-Jian Lai:
Supereulerian bipartite digraphs. 64-75 - Louis Esperet, Matej Stehlík:
The width of quadrangulations of the projective plane. 76-88
Volume 89, Number 2, October 2018
- Arthur Hoffmann-Ostenhof, Kenta Noguchi, Kenta Ozeki:
On homeomorphically irreducible spanning trees in cubic graphs. 93-100 - Matthias Kriesell, Jens M. Schmidt:
More on foxes. 101-114 - Michael A. Henning, Anders Yeo:
Tight lower bounds on the matching number in a graph with given maximum degree. 115-149 - Thomas A. McCourt, Anthony Nixon:
A constructive characterisation of circuits in the simple (2, 1)-sparse matroid. 150-175 - Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo:
Extensions of a theorem of Erdős on nonhamiltonian graphs. 176-193 - Matthias Kriesell:
Nonseparating K4-subdivisions in graphs of minimum degree at least 4. 194-213 - Cristina G. Fernandes, Tina Janne Schmidt, Anusch Taraz:
On minimum bisection and related cut problems in trees and tree-like graphs. 214-245
Volume 89, Number 3, November 2018
- Jill R. Faudree, Ralph J. Faudree, Ronald J. Gould, Paul Horn, Michael S. Jacobson:
Degree sum and vertex dominating paths. 250-265 - Krzysztof Choromanski:
Excluding pairs of tournaments. 266-287 - T. Karthick, Frédéric Maffray:
Coloring (gem, co-gem)-free graphs. 288-303 - Pierre Aboulker, Jørgen Bang-Jensen, Nicolas Bousquet, Pierre Charbit, Frédéric Havet, Frédéric Maffray, José Zamora:
χ-bounded families of oriented graphs. 304-326 - Yoshimi Egawa, Michitaka Furuya, Kenta Ozeki:
Sufficient conditions for the existence of a path-factor which are related to odd components. 327-340 - Przemyslaw Gordinowicz:
The 2-surviving rate of planar graphs with average degree lower than. 341-349 - Taku Nagasawa, Kenta Noguchi, Yusuke Suzuki:
No optimal 1-planar graph triangulates any nonorientable closed surface. 350-360
Volume 89, Number 4, December 2018
- Paul Balister, Ali Dogan:
On the edge spectrum of saturated graphs for paths and stars. 364-385 - Cristina Dalfó, Miguel Angel Fiol, Nacho López:
On bipartite-mixed graphs. 386-394 - Chính T. Hoàng:
On the structure of (banner, odd hole)-free graphs. 395-412 - Alex Chin, Gary Gordon, Kellie J. MacPhee, Charles Vincent:
Subtrees of graphs. 413-438 - Nathann Cohen, Frédéric Havet, William Lochet, Nicolas Nisse:
Subdivisions of oriented cycles in digraphs with large chromatic number. 439-456 - Tom Kelly, Chun-Hung Liu:
Size of the largest induced forest in subcubic graphs of girth at least four and five. 457-478 - Jacob W. Cooper, Andrzej Grzesik, Daniel Král':
Optimal-size clique transversals in chordal graphs. 479-493
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-18 20:19 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:
