Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 94
Volume 94, Number 1, May 2020
- Peter Dankelmann, David J. Erwin
:
Distance domination and generalized eccentricity in graphs with given minimum degree. 5-19 - Toru Hasunuma, Kosuke Ono:
Connectivity keeping trees in 2-connected graphs. 20-29 - Fengming Dong:
New expressions for order polynomials and chromatic polynomials. 30-58 - M. Amin Bahmanian, Sadegheh Haghshenas:
Extending regular edge-colorings of complete hypergraphs. 59-74 - Giuseppe Mazzuoccolo, Vahan Mkrtchyan:
Normal edge-colorings of cubic graphs. 75-91 - Louis DeBiasio, Robert A. Krueger, Dan Pritikin, Eli Thompson:
Hamiltonian cycles in k -partite graphs. 92-112 - Attila Joó:
Uncountable dichromatic number without short directed cycles. 113-116 - Louis DeBiasio, Robert A. Krueger, Gábor N. Sárközy:
Large monochromatic components in multicolored bipartite graphs. 117-130 - Frédéric Havet, Bruce A. Reed, Maya Stein, David R. Wood:
A variant of the Erdős-Sós conjecture. 131-158 - Yaakov S. Kupitz, Hagit Last, Horst Martini, Micha A. Perles, Rom Pinchasi:
Crossing matchings and circuits have maximal length. 159-169
Volume 94, Number 2, June 2020
- Taras O. Banakh, Adam Idzik, Oleg Pikhurko, Igor Protasov, Krzysztof Pszczola:
Isometric copies of directed trees in orientations of graphs. 175-191 - Henry Liu, Colton Magnant, Akira Saito, Ingo Schiermeyer, Yongtang Shi:
Gallai-Ramsey number for K 4. 192-205 - Martin Rolek:
The extremal function for K 9 = minors. 206-223 - Elke Fuchs, Laura Gellert, Irene Heinrich:
Cycle decompositions of pathwidth-6 graphs. 224-251 - Michael Dairyko, Michael Ferrara, Bernard Lidický, Ryan R. Martin, Florian Pfender, Andrew J. Uzzell:
Ore and Chvátal-type degree conditions for bootstrap percolation from small sets. 252-266 - Eduard Eiben, Carl Feghali:
Toward Cereceda's conjecture for planar graphs. 267-277 - Jianzhang Hu, Xuding Zhu:
List coloring triangle-free planar graphs. 278-298 - M. H. Khalifeh, Emad Zahedi:
On a conjecture about the existence of isometric subgraphs. 299-302
Volume 94, Number 3, July 2020
- Hongliang Lu, Bo Ning:
An Ore-type condition for large k -factor and disjoint perfect matchings. 307-319 - Jürgen Kritschgau, Abhishek Methuku, Michael Tait, Craig Timmons:
Few H copies in F -saturated graphs. 320-348 - Songling Shan:
Hamiltonian cycles in 3-tough 2K 2-free graphs. 349-363 - Endre Boros, Vladimir Gurvich, Martin Milanic:
Characterizing and decomposing classes of threshold, split, and bipartite graphs via 1-Sperner hypergraphs. 364-397 - Richard C. Brewster, Jae-Baek Lee, Benjamin R. Moore, Jonathan A. Noel, Mark H. Siggers:
Graph homomorphism reconfiguration and frozen H-colorings. 398-420 - António Girão, David Lewis, Kamil Popielarz:
Rainbow saturation of graphs. 421-444 - Ron Aharoni, Shira Zerbib:
A generalization of Tuza's conjecture. 445-462 - Shuya Chiba, Suyun Jiang, Jin Yan:
Partitioning a graph into cycles with a specified number of chords. 463-475 - Ruonan Li, Hajo Broersma, Shenggui Zhang:
Vertex-disjoint properly edge-colored cycles in edge-colored complete graphs. 476-493
Volume 94, Number 4, August 2020
- Péter Komjáth:
Constructions of infinite graphs with Ramsey property. 499-508 - Luka Milicevic:
An improved upper bound for the grid Ramsey problem. 509-517 - Robert E. Jamison, Alan P. Sprague:
Multithreshold graphs. 518-530 - Liliana Alcón, Sylvain Gravier, Cláudia Linhares Sales, Fábio Protti, Gabriela Ravenna:
On clique-inverse graphs of graphs with bounded clique number. 531-538 - Matthew P. Yancey:
Positively curved graphs. 539-578 - Anthony Bonato, William B. Kinnersley:
Bounds on the localization number. 579-596 - Daniel Weißauer:
Isometric subgraphs for Steiner distance. 597-613
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-19 20: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:
