Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 93
Volume 93, Number 1, January 2020
- Robert E. L. Aldred
, Jun Fujisawa, Akira Saito:
Distance matching extension and local structure of graphs. 5-20 - Jim Geelen, Edward Lee:
Naji's characterization of circle graphs. 21-33 - Jan Goedgebeur:
On minimal triangle-free 6-chromatic graphs. 34-48 - Mustafa Demir, C. A. Rodger:
Embedding an edge-coloring of K(nr;λ1, λ2) into a Hamiltonian decomposition of K(nr+2;λ1, λ2). 49-63 - Victor Chepoi, Arnaud Labourel, Sébastien Ratel:
On density of subgraphs of Cartesian products. 64-87 - Noga Alon, Jørgen Bang-Jensen, Stéphane Bessy:
Out-colourings of digraphs. 88-112 - József Balogh, Lina Li:
On the number of linear hypergraphs of large girth. 113-141
Volume 93, Number 2, February 2020
- Pawel Pralat, Nick Wormald:
Almost all 5-regular graphs have a 3-flow. 147-156 - Jan-Christoph Schlage-Puchta, Peter Wagner:
Complete graphs with no rainbow tree. 157-167 - Roman Cada, Kenta Ozeki, Kiyoshi Yoshimoto:
A complete bipartite graph without properly colored cycles of length four. 168-180 - Bhalchandra D. Thatte:
The connected partition lattice of a graph and the reconstruction conjecture. 181-202 - Anton Bernshteyn, Alexandr V. Kostochka, Xuding Zhu:
Fractional DP-colorings of sparse graphs. 203-221 - Pu Qiao, Xingzhi Zhan:
The minimum number of Hamilton cycles in a Hamiltonian threshold graph of a prescribed order. 222-229 - Quentin Fortier, Csaba Király, Zoltán Szigeti, Shin-ichi Tanigawa:
On packing spanning arborescences with matroid constraint. 230-252 - Stefan Steinerberger:
Generalized designs on graphs: Sampling, spectra, symmetries. 253-267 - Martín D. Safe:
Characterization and linear-time detection of minimal obstructions to concave-round graphs and the circular-ones property. 268-298 - Jason I. Brown, David G. Wagner:
On the imaginary parts of chromatic roots. 299-311
Volume 93, Number 3, March 2020
- Radek Husek, Lucie Mohelníková, Robert Sámal:
Group connectivity: Z4 vs Z22. 317-327 - Fábio Botler, Maycon Sambinelli, Rafael S. Coelho, Orlando Lee:
Gallai's path decomposition conjecture for graphs with treewidth at most 3. 328-349 - Daniel Soltész:
Even cycle creating paths. 350-362 - Michael Anastos, Deepak Bal:
A Ramsey property of random regular and k -out graphs. 363-371 - Michitaka Furuya, Shoichi Tsuchiya:
Large homeomorphically irreducible trees in path-free graphs. 372-394 - Bobo Hua, Yanhui Su:
The first gap for total curvatures of planar graphs with nonnegative curvature. 395-439 - Yan Cao, Guantao Chen, Shushan He, Guangming Jing:
Ring graphs and Goldberg's bound on chromatic index. 440-449 - Hong Wang:
Disjoint cycles covering matchings in graphs with partial degrees. 450-457
Volume 93, Number 4, April 2020
- Monika Pilsniak, Marcin Stawiski:
The optimal general upper bound for the distinguishing index of infinite graphs. 463-469 - Paul Knappe, Max Pitz:
Circuits through prescribed edges. 470-482 - Saieed Akbari, Mina Dalirrooyfard, K. Ehsani, Kenta Ozeki, R. Sherkati:
Orientations of graphs avoiding given lists on out-degrees. 483-502 - Kathie Cameron, Shenwei Huang, Irena Penev, Vaidy Sivaraman:
The class of ( P 7 , C 4 , C 5 ) -free graphs: Decomposition, algorithms, and χ -boundedness. 503-552 - Nir Lazarovich, Arie Levit:
Edge Kempe equivalence of regular graph covers. 553-559 - Martin Rolek:
Graphs with no K 9 = minor are 10-colorable. 560-565
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-05-31 18:44 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:
