default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 96
Volume 96, Number 1, January 2021
In Memoriam
- In Memoriam. 5
- Thomas Schweser
, Michael Stiebitz:
Partitions of hypergraphs under variable degeneracy constraints. 7-33 - Dániel Gerbner, Dániel T. Nagy, Balázs Patkós, Máté Vizer:
On the maximum number of copies of H in graphs with given size and order. 34-43 - John Sylvester:
Random walk hitting times and effective resistance in sparsely connected Erdős-Rényi random graphs. 44-84 - András Gyárfás, Jeno Lehel:
Order plus size of 𝜏-critical graphs. 85-86 - Jie Han, Yoshiharu Kohayakawa, Patrick Morris, Yury Person:
Finding any given 2-factor in sparse pseudorandom graphs efficiently. 87-108 - Noga Alon, Matija Bucic, Tom Kalvari, Eden Kuperwasser, Tibor Szabó:
List Ramsey numbers. 109-128 - Longqin Wang, Yaojun Chen:
The Ramsey numbers of two sets of cycles. 129-136 - Jørgen Bang-Jensen, Thomas Bellitto, Anders Yeo:
Proper-walk connection number of graphs. 137-159 - Dingding Dong:
On induced subgraphs of the Hamming graph. 160-166
Volume 96, Number 2, February 2021
- Zan-Bo Zhang, Xiaoyan Zhang, Gregory Z. Gutin, Dingjun Lou:
Hamiltonicity, pancyclicity, and full cycle extendability in multipartite tournaments. 171-191 - Matt DeVos, Matthew Drescher, Daryl Funk, Sebastián González Hermosillo de la Maza, Krystal Guo, Tony Huynh, Bojan Mohar, Amanda Montejano:
Short rainbow cycles in graphs and matroids. 192-202 - Isabel Hubard, Alejandra Ramos Rivera, Primoz Sparl:
Arc-transitive maps with underlying Rose Window graphs. 203-230 - Flavia Bonomo, Gianpaolo Oriolo, Claudia Snels:
Minimum weighted clique cover on claw-free perfect graphs. 231-268 - Behrooz Bagheri Gh., Tomás Feder, Herbert Fleischner, Carlos S. Subi:
Hamiltonian cycles in planar cubic graphs with facial 2-factors, and a new partial solution of Barnette's Conjecture. 269-288 - Zhangdong Ouyang, Yuanqiu Huang, Fengming Dong, Eng Guan Tay:
Zip product of graphs and crossing numbers. 289-309 - Jesús Alva-Samos, César Hernández-Cruz:
k-quasi-transitive digraphs of large diameter. 310-325 - Carla Groenland, Hannah Guggiari, Alex D. Scott:
Size reconstructibility of graphs. 326-337
Volume 96, Number 3, March 2021
- Fengming Dong, Jun Ge, Helin Gong, Bo Ning, Zhangdong Ouyang, Eng Guan Tay:
Proving a conjecture on chromatic polynomials by counting the number of acyclic orientations. 343-360 - O-joung Kwon, Sang-il Oum:
Graphs of bounded depth-2 rank-brittleness. 361-378 - Mark N. Ellingham, Songling Shan, Dong Ye, Xiaoya Zha:
Toughness and spanning trees in K4-minor-free graphs. 379-402 - Ben Cameron, Lucas Mol:
On the mean subtree order of graphs under edge addition. 403-413 - C. Cedillo, Miguel A. Pizaña:
Clique-convergence is undecidable for automatic graphs. 414-437 - Miaomiao Han, Jiaao Li, Xueliang Li, Meiling Wang:
Group connectivity under 3-edge-connectivity. 438-450
Volume 96, Number 4, March 2021
- Michael A. Henning, Zekhaya B. Shozi:
A characterization of the subcubic graphs achieving equality in the Haxell-Scott lower bound for the matching number. 455-471 - Jianhua Tu, Zhipeng Zhang, Yongtang Shi:
The maximum number of maximum dissociation sets in trees. 472-489 - Phelipe A. Fabres, Nishad Kothari, Marcelo Henriques de Carvalho:
Minimal braces. 490-509 - Elena Mohr, Dieter Rautenbach:
On the maximum number of maximum independent sets in connected graphs. 510-521 - David Cushing, Supanat Kamtue, Riikka Kangaslampi, Shiping Liu, Norbert Peyerimhoff:
Curvatures, graph products and Ricci flatness. 522-553 - Guantao Chen, Yuan Chen, Qing Cui, Xing Feng, Qinghai Liu:
The chromatic number of { ISK4ISK4 ISK 4 , diamond, bowtie}-free graphs. 554-577 - Maximilian Fürst, Dieter Rautenbach:
Uniquely restricted matchings in subcubic graphs without short cycles. 578-593 - Jørgen Bang-Jensen, Stéphane Bessy, Jing Huang, Matthias Kriesell:
Good orientations of unions of edge-disjoint spanning trees. 594-618 - Zdenek Dvorák, Tomás Masarík, Jan Musílek, Ondrej Pangrác:
Flexibility of triangle-free planar graphs. 619-641 - Frédéric Maffray, Irena Penev, Kristina Vuskovic:
Coloring rings. 642-683
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-11-06 20:19 CET 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:
