Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 98
Volume 98, Number 1, September 2021
- Matt DeVos, Mahdieh Malekian:
The structure of graphs with no K 3 , 3 immersion. 5-23 - Matthias Kriesell:
A note on uniquely 10-colorable graphs. 24-26 - J. Pascal Gollin
, Karl Heuer:
On the infinite Lucchesi-Younger conjecture I. 27-48 - Attila Joó:
Greedoids from flames. 49-56 - Tomasz Luczak, Joanna Polcyn, Christian Reiher:
Andrásfai and Vega graphs in Ramsey-Turán theory. 57-80 - Marthe Bonamy, Konrad K. Dabrowski, Carl Feghali, Matthew Johnson, Daniël Paulusma:
Recognizing graphs close to bipartite graphs with an application to colouring reconfiguration. 81-109 - Ruonan Li, Hajo Broersma, Maho Yokota, Kiyoshi Yoshimoto:
Edge-colored complete graphs without properly colored even cycles: A full characterization. 110-124 - Ringi Kim, Luke Postle:
The list linear arboricity of graphs. 125-140 - Lucas de Oliveira Contiero, Carlos Hoppen, Hanno Lefmann, Knut Odermann:
Uniform hypergraphs with many edge-colorings avoiding a fixed rainbow expanded complete graph. 141-173
Volume 98, Number 2, September 2021
- Qiqin Xie, Shijie Xie, Xingxing Yu, Xiaofan Yuan:
Wheels in planar graphs and Hajós graphs. 179-194 - Stephan G. Wagner:
On the probability that a random subtree is spanning. 195-215 - Hamid Reza Daneshpajouh, Frédéric Meunier, Guilhem Mizrahi:
Colorings of complements of line graphs. 216-233 - Fugang Yin, Yan-Quan Feng, Jin-Xin Zhou, Yu-Hong Guo:
The symmetry property of ( n , k ) -arrangement graph. 234-254 - Sylwia Antoniuk, Andrzej Dudek, Christian Reiher, Andrzej Rucinski, Mathias Schacht:
High powers of Hamiltonian cycles in randomly augmented graphs. 255-284 - Zhen-Mu Hong, Hong-Jian Lai, Jianbing Liu:
Induced subgraphs of product graphs and a generalization of Huang's theorem. 285-308 - Alexander L. Gavrilyuk, Akihiro Munemasa, Yoshio Sano, Tetsuji Taniguchi:
Signed analogue of line graphs and their smallest eigenvalues. 309-325 - Eun-Kyung Cho, Ilkyoo Choi, Ringi Kim, Boram Park:
The strong clique index of a graph with forbidden cycles. 326-341 - Daniel Horsley, Adam Mammoliti:
The cyclic matching sequenceability of regular graphs. 342-366 - Hui Gao, Daqing Yang:
Packing of spanning mixed arborescences. 367-377
Volume 98, Number 3, November 2021
- Max Aires:
On the number of edges in maximally linkless graphs. 383-388 - Debra L. Boutin, Sally Cockburn:
Distinguishing orthogonality graphs. 389-404 - James Davies, Florian Pfender:
Edge-maximal graphs on orientable and some nonorientable surfaces. 405-425 - Xiaolin Wang, Yaojun Chen, Peter Dankelmann, Yubao Guo, Michel Surmacs, Lutz Volkmann:
Oriented diameter of maximal outerplanar graphs. 426-444 - Guantao Chen, Yanli Hao:
Multiplicity of the second-largest eigenvalue of a planar graph. 445-459 - Jie Han, Joanna Polcyn, Andrzej Rucinski:
Turán and Ramsey numbers for 3-uniform minimal paths of length 4. 460-498 - Long-Tu Yuan, Xiao-Dong Zhang:
Turán numbers for disjoint paths. 499-524 - Martin Knor, Riste Skrekovski, Aleksandra Tepeh:
Domination versus independent domination in regular graphs. 525-530 - On-Hei Solomon Lo:
Find subtrees of specified weight and cycles of specified length in linear time. 531-552
Volume 98, Number 4, December 2021
- Laurent Bulteau, Guillaume Fertin, Anthony Labarre, Romeo Rizzi, Irena Rusu:
Decomposing subcubic graphs into claws, paths or triangles. 557-588 - Juan Gutiérrez:
Transversals of longest cycles in partial k-trees and chordal graphs. 589-603 - Guanwu Liu, Xingxing Yu:
Partitioning digraphs with outdegree at least 4. 604-622 - Noga Alon, Michael Krivelevich:
Divisible subdivisions. 623-629 - Jianfeng Hou, Shufei Wu:
On bisections of graphs without complete bipartite graphs. 630-641 - Jialu Zhu, Xuding Zhu:
Chromatic λ-choosable and λ-paintable graphs. 642-652 - Alan M. Frieze, Wesley Pegden:
Maker Breaker on digraphs. 653-661 - Siyan Liu, Rong-Xia Hao, Cun-Quan Zhang, Zhang Zhang:
Berge-Fulkerson coloring for C ( 12 ) -linked permutation graphs. 662-675 - Songling Shan:
Antimagic orientation of graphs with minimum degree at least 33. 676-690 - Long-Tu Yuan:
Extremal graphs for odd wheels. 691-707
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-07-03 20:33 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:
