default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 99
Volume 99, Number 1, January 2022
- Xizhi Liu
, Jie Ma:
Sparse halves in K 4 -free graphs. 5-25 - Beka Ergemlidze, Abhishek Methuku:
Triangles in C 5 -free graphs and hypergraphs of girth six. 26-39 - Taylor Ball, David J. Galvin, Catherine Hyry, Kyle Weingartner:
Independent set and matching permutations. 40-57 - Christos A. Athanasiadis, Jesús A. De Loera, Zhenyang Zhang:
Enumerative problems for arborescences and monotone paths on polytope graphs. 58-81 - Jiangdong Ai, Stefanie Gerke, Gregory Z. Gutin:
Kings in multipartite hypertournaments. 82-89 - Martin Dolezal:
Graph limits: An alternative approach to s-graphons. 90-106 - Davide Mattiolo, Eckhard Steffen:
Highly edge-connected regular graphs without large factorizable subgraphs. 107-116 - Nick Brettell, Jake Horsfield, Andrea Munaro, Giacomo Paesani, Daniël Paulusma:
Bounding the mim-width of hereditary graph classes. 117-151 - Michael Savery:
Chromatic number is Ramsey distinguishing. 152-161 - Taisei Ito, Shoichi Tsuchiya:
Degree sum conditions for the existence of homeomorphically irreducible spanning trees. 162-170
Volume 99, Number 2, February 2022
- Anyao Wang, Xinmin Hou, Boyuan Liu, Yue Ma:
Maximizing the number of independent sets of fixed size in K n -covered graphs. 175-185 - Min Chen, André Raspaud, Weiqiang Yu:
An ( F 1 , F 4 ) -partition of graphs with low genus and girth at least 6. 186-206 - Ademir Hujdurovic, Primoz Potocnik, Gabriel Verret:
Three local actions in 6-valent arc-transitive graphs. 207-216 - Therese Biedl, John Wittnebel:
Matchings in 1-planar graphs with large minimum degree. 217-230 - Hakan Guler, Bill Jackson:
A necessary condition for generic rigidity of bar-and-joint frameworks in d-space. 231-239 - Andrzej Grzesik, Bartlomiej Kielak:
On the maximum number of odd cycles in graphs without smaller odd cycles. 240-246 - Erik Carlson, Ryan R. Martin, Bo Peng, Miklós Ruszinkó:
Large monochromatic components of small diameter. 247-250 - Yangyan Gu, Hal A. Kierstead, Sang-il Oum, Hao Qi, Xuding Zhu:
3-Degenerate induced subgraph of a planar graph. 251-277 - Rob Egrot, Robin Hirsch:
Seurat games on Stockmeyer graphs. 278-311 - Xiaolan Hu, Jiaao Li:
Circular coloring and fractional coloring in planar graphs. 312-343
Volume 99, Number 3, March 2022
- Michal Debski, Jakub Przybylo:
Conflict-free chromatic number versus conflict-free chromatic index. 349-358 - Bostjan Bresar, Kirsti Kuenzel, Douglas F. Rall:
Domination in digraphs and their direct and Cartesian products. 359-377 - Debarun Ghosh, Ervin Györi, Oliver Janzer, Addisu Paulos, Nika Salia, Oscar Zamora:
The maximum number of induced C 5 's in a planar graph. 378-398 - Davide Mattiolo, Eckhard Steffen:
Edge colorings and circular flows on regular graphs. 399-413 - Primoz Sparl:
Symmetries of the honeycomb toroidal graphs. 414-424 - Hou-Teng Cheong, Hsueh-I Lu:
Finding a shortest even hole in polynomial time. 425-434 - Irena Penev:
On the structure and clique-width of ( 4 K 1 , C 4 , C 6 , C 7 ) -free graphs. 435-460 - Yasemin Büyükçolak, Sibel Özkan, Didem Gözüpek:
Triangle-free equimatchable graphs. 461-484 - Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan:
4-Separations in Hajós graphs. 485-508 - Shun-ichi Maezawa, Kenta Ozeki:
A forbidden pair for connected graphs to have spanning k-trees. 509-519
Volume 99, Number 4, April 2022
- Carl Bürger, Jan Kurkofka:
Duality theorems for stars and combs I: Arbitrary stars and combs. 525-554 - Carl Bürger, Jan Kurkofka:
Duality theorems for stars and combs II: Dominating stars and dominated combs. 555-572 - Thomas Fleming, Joel Foisy:
Classifying intrinsically linked tournaments by score sequence. 573-593 - Guillaume Ducoffe:
The diameter of AT-free graphs. 594-614 - Jørgen Bang-Jensen, Frédéric Havet, Matthias Kriesell, Anders Yeo:
Low chromatic spanning sub(di)graphs with prescribed degree or connectivity properties. 615-636 - Ringi Kim, Seog-Jin Kim, Xuding Zhu:
Signed colouring and list colouring of k-chromatic graphs. 637-650 - Lyuben Lichev:
The giant component after percolation of product graphs. 651-670 - Peter Horák, Dongryul Kim:
Connected cubic graphs with the maximum number of perfect matchings. 671-690 - Tomasz Luczak, Zahra Rahimi:
Long monochromatic even cycles in 3-edge-coloured graphs of large minimum degree. 691-714 - Cédric Boutillier, David Cimasoni, Béatrice de Tilière:
Isoradial immersions. 715-757 - Alexandr V. Kostochka, Mikhail Lavrov, Ruth Luo, Dara Zirlin:
Longest cycles in 3-connected hypergraphs and bipartite graphs. 758-782
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 2025-05-22 00: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:
