Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 102
Volume 102, Number 1, January 2023
ARTICLES
- Daniel Cizma, Nati Linial:
Irreducible nonmetrizable path systems in graphs. 5-14 - Peter Bradshaw
, Seyyed Aliasghar Hosseini, Bojan Mohar, Ladislav Stacho:
On the cop number of graphs of high girth. 15-34 - Hugo A. Akitaya, Matthew D. Jones, Matias Korman, Oliver Korten, Christopher Meierfrankenfeld, Michael J. Munje, Diane L. Souvaine, Michael Thramann, Csaba D. Tóth:
Reconfiguration of connected graph partitions. 35-66 - Stijn Cambie, Rémi de Joannis de Verclos, Ross J. Kang:
Regular Turán numbers and some Gan-Loh-Sudakov-type problems. 67-85 - Yuefang Sun, Anders Yeo:
Directed Steiner tree packing and directed tree connectivity. 86-106 - Bofeng Huo, Qingsong Du, Ping Li, Yang Wu, Jun Yin, Hong-Jian Lai:
Supereulerian regular matroids without small cocircuits. 107-127 - Zdenek Ryjácek, Petr Vrána:
Hamilton-connected {claw, bull}-free graphs. 128-153 - Xia Liu, Zdenek Ryjácek, Petr Vrána, Liming Xiong, Xiaojing Yang:
Hamilton-connected {claw, net}-free graphs, I. 154-179 - Carol T. Zamfirescu:
On the hamiltonicity of a planar graph and its vertex-deleted subgraphs. 180-193 - David Conlon, Mykhaylo Tyomkyn:
Ramsey numbers of trails and circuits. 194-196 - Fábio Botler, Lucas Colucci, Yoshiharu Kohayakawa:
The mod k $k$ chromatic index of graphs is O ( k ) $O(k)$. 197-200
Volume 102, Number 2, February 2023
- Maryam Abdi, Ebrahim Ghorbani:
Quartic graphs with minimum spectral gap. 205-233 - Jacob Fox, Zoe M. Himwich, Nitya Mani:
Making an H $H$ -free graph k $k$ -colorable. 234-261 - Éva Czabarka, Stephen J. Smith, László A. Székely:
Maximum diameter of 3- and 4-colorable graphs. 262-270 - Richard C. Brewster, Benjamin R. Moore:
Characterizing circular colouring mixing for p q 4 $\frac{p}{q}\lt 4$. 271-294 - Peter J. Cameron, Bojan Kuzma:
Between the enhanced power graph and the commuting graph. 295-303 - Robert E. L. Aldred, Jun Fujisawa:
Removal of subgraphs and perfect matchings in graphs on surfaces. 304-321 - Adam Logan, Michael Molloy, Pawel Pralat:
A variant of the Erdős-Rényi random graph process. 322-345 - Rongxing Xu, Xuding Zhu:
The strong fractional choice number of 3-choice-critical graphs. 346-373 - Carla Groenland, Tomás Kaiser, Oscar Treffers, Matthew Wales:
Graphs of low average degree without independent transversals. 374-387 - Soukaina Zayat, Salman Ghazal:
Erdös-Hajnal conjecture for new infinite families of tournaments. 388-417
Volume 102, Number 3, March 2023
- Toru Hasunuma:
Connectivity preserving trees in k-connected or k-edge-connected graphs. 423-435 - Peter Lambert-Cole, Danielle O'Donnol:
Planar Legendrian Θ ${\rm{\Theta }}$ -graphs. 436-457 - Alexander D. Scott, Paul D. Seymour, Sophie Spirkl:
Polynomial bounds for chromatic number. I. Excluding a biclique and an induced tree. 458-471 - Endre Csóka, Tamás Hubai, László Lovász:
Locally common graphs. 472-483 - Riccardo W. Maffucci:
Constructing certain families of 3-polytopal graphs. 484-501 - Mingqing Zhai, Huiqiu Lin:
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs. 502-520 - Hui Gao, Daqing Yang:
Digraph analogues for the Nine Dragon Tree Conjecture. 521-534 - Zuwen Luo, Kexiang Xu, Stephan G. Wagner, Hua Wang:
On the mean subtree order of trees under edge contraction. 535-551 - Max Pitz:
A note on minor antichains of uncountable graphs. 552-555 - Fan Chung, Ji Zeng:
Forest formulas of discrete Green's functions. 556-577 - Jørgen Bang-Jensen, Frédéric Havet, Anders Yeo:
Spanning eulerian subdigraphs in semicomplete digraphs. 578-606
Volume 102, Number 4, April 2023
ARTICLES
- Michael J. Plantholt, Songling Shan:
Edge coloring graphs with large minimum degree. 611-632 - Ronen Wdowinski:
Orientation-based edge-colorings and linear arboricity of multigraphs. 633-647 - Jacob Fox, Yuval Wigderson:
Minimum degree and the graph removal lemma. 648-665 - Zhilan Wang, Yuzhen Qi, Jin Yan:
Vertex-disjoint cycles of the same length in tournaments. 666-683 - Amine El Sahili, Zeina Ghazo Hanna:
About the number of oriented Hamiltonian paths and cycles in tournaments. 684-701 - Akanksha Agrawal, Daniel Lokshtanov, Pranabendu Misra, Saket Saurabh, Meirav Zehavi:
Erdős-Pósa property of obstructions to interval graphs. 702-727 - Michal Lason, Malgorzata Sulkowska:
Modularity of minor-free graphs. 728-736 - Bruce A. Reed, Maya Stein:
Spanning trees in graphs of high minimum degree with a universal vertex I: An asymptotic result. 737-783 - Matija Bucic, Amir Khamseh:
The ( t - 1 ) $(t-1)$ -chromatic Ramsey number for paths. 784-796 - Bruce A. Reed, Maya Stein:
Spanning trees in graphs of high minimum degree with a universal vertex II: A tight result. 797-821
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-04-22 21:05 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:
