Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 101
Volume 101, Number 1, September 2022
- Ran Gu, Xiaofeng Gu
, Yongtang Shi, Hua Wang:
ℓ $\ell $ -Connectivity and ℓ $\ell $ -edge-connectivity of random graphs. 5-28 - Mariusz Grech, Andrzej Kisielewicz:
Wreath product in automorphism groups of graphs. 29-51 - Florian Lehner, Monika Pilsniak, Marcin Stawiski:
Distinguishing infinite graphs with bounded degrees. 52-65 - Andrew Thomason, Matthew Wales:
On the extremal function for graph minors. 66-78 - Fengming Dong, Jun Ge:
Counting spanning trees in a complete bipartite graph which contain a given spanning forest. 79-94 - Carl Bürger, Jan Kurkofka:
End-faithful spanning trees in graphs without normal spanning trees. 95-105 - Guang Li, Zai Ping Lu:
Pentavalent semisymmetric graphs of square-free order. 106-123 - Xun Chen, Qizhong Lin, Chunlin You:
Ramsey numbers of large books. 124-133 - Yue Wang, Gexin Yu:
Enhancing the Erdős-Lovász Tihany Conjecture for line graphs of multigraphs. 134-141 - Ajit A. Diwan:
Subdivisions of maximal 3-degenerate graphs of order d + 1 $d+1$ in graphs of minimum degree d $d$. 142-160
Volume 101, Number 2, October 2022
- Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park, Tingting Shan, Xuding Zhu:
Decomposing planar graphs into graphs with degree restrictions. 165-181 - Drago Bokal, Gunnar Brinkmann, Carol T. Zamfirescu:
The connectivity of the dual. 182-209 - Frank Göring, Tobias Hofmann, Manuel Streicher:
Uniformly connected graphs. 210-225 - Mateja Sajna, Andrew Wagner:
Covering hypergraphs are Eulerian. 226-241 - Xihe Li, Hajo Broersma, Ligong Wang:
The Erdős-Gyárfás function with respect to Gallai-colorings. 242-264 - János Nagy, Péter Pál Pach:
A counterexample to the lights out problem. 265-273 - Jian Wang, Shipeng Wang, Weihua Yang, Xiaoli Yuan:
A stability theorem for maximal C 2 k + 1 ${C}_{2k+1}$ -free graphs. 274-287 - Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
Independence number of edge-chromatic critical graphs. 288-310 - Vincent Tandya:
An induced subgraph of the Hamming graph with maximum degree 1. 311-317 - Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number II: Excluding a star-forest. 318-322 - Alex D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number. III. Excluding a double star. 323-340
Volume 101, Number 3, November 2022
- Uriel Feige, Ella Fuchs:
On the path partition number of 6-regular graphs. 345-378 - Yanmei Hong, Qinghai Liu:
Mader's conjecture for graphs with small connectivity. 379-388 - Jacob Fox, Xiaoyu He, Sammy Luo, Max Wenqiang Xu:
Multicolor list Ramsey numbers grow exponentially. 389-396 - Weisheng Zhao, Ruizhi Lin, Junqing Cai:
On construction for trees making the equality hold in Vizing's conjecture. 397-427 - Katarína Cekanová, Mária Maceková, Roman Soták:
Structure of edges of embedded graphs with minimum degree two. 428-454 - Colton Magnant, Ingo Schiermeyer:
Gallai-Ramsey number for K 5 ${K}_{5}$. 455-492 - Andrzej Grzesik, Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of paths of length three in a planar graph. 493-510 - Jean Paul Zerafa:
Ban-Linial's Conjecture and treelike snarks. 511-520 - Christopher Cox, Ryan R. Martin:
Counting paths, cycles, and blow-ups in planar graphs. 521-558 - Joshua Erde, Florian Lehner:
Hamiltonian decompositions of 4-regular Cayley graphs of infinite abelian groups. 559-571 - Gregory Z. Gutin, Anders Yeo:
Perfect forests in graphs and their extensions. 572-592
Volume 101, Number 4, December 2022
- Alp Müyesser, Michael Tait:
Turán- and Ramsey-type results for unavoidable subgraphs. 597-622 - Tamás Mészáros, Raphael Steiner:
Complete directed minors and chromatic number. 623-632 - Daniel W. Cranston, Hudson Lafayette, Landon Rabern:
Coloring ( P 5 , gem ) $({P}_{5}, \text{gem})$ -free graphs with Δ - 1 ${\rm{\Delta }}-1$ colors. 633-642 - Michael A. Henning, Anders Yeo:
A complete description of convex sets associated with matchings and edge-connectivity in graphs. 643-667 - Yucong Tang, Tong Li, Guiying Yan:
Anti-Ramsey number of expansions of paths and cycles in uniform hypergraphs. 668-685 - Hervé Hocquard, Dimitri Lajou, Borut Luzar:
Between proper and strong edge-colorings of subcubic graphs. 686-716 - Peter Bradshaw, Tomás Masarík, Ladislav Stacho:
Flexible list colorings in graphs with special degeneracy conditions. 717-745 - Juan Liu, Yiqiao Wang, Weifan Wang:
Light edges in 1-planar graphs. 746-768 - Katsuhiro Ota, Masahiro Sanka:
Hamiltonian cycles in 2-tough 2 K 2 $2{K}_{2}$ -free graphs. 769-781 - Jie Han:
Covering 3-uniform hypergraphs by vertex-disjoint tight paths. 782-802
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-29 00:41 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:
