default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 106
Volume 106, Number 1, 2024
- Issue Information. 1-3
- Lucas Picasarri-Arrieta
:
Strengthening the directed Brooks' theorem for oriented graphs and consequences on digraph redicolouring. 5-22 - Dániel Gerbner:
On Turán problems with bounded matching number. 23-29 - Yang Wang, Yiqiao Wang, Ko-Wei Lih:
Partitioning kite-free planar graphs into two forests. 30-56 - Maria Axenovich, Felix Christian Clemen:
Rainbow subgraphs in edge-colored complete graphs: Answering two questions by Erdős and Tuza. 57-66 - Yan Cao, Guantao Chen, Guangming Jing, Songling Shan:
Overfullness of edge-critical graphs with small minimal core degree. 67-80 - Guangzhou Chen, Daniel Horsley, Adam Mammoliti:
Exact values for some unbalanced Zarankiewicz numbers. 81-109 - Lars Jaffke, O-joung Kwon, Jan Arne Telle:
Classes of intersection digraphs with good algorithmic properties. 110-148 - Michael A. Henning, Paul Horn:
Optimal linear-Vizing relationships for (total) domination in graphs. 149-166 - Krystal Guo, Sam Spiro:
New eigenvalue bound for the fractional chromatic number. 167-181 - Jørgen Bang-Jensen, Yun Wang:
Arc-disjoint out-branchings and in-branchings in semicomplete digraphs. 182-197 - Hongliang Lu, Xuechun Zhang:
A proof of Frankl-Kupavskii's conjecture on edge-union condition. 198-208
Volume 106, Number 2, 2024
- Issue Information. 209-211
- Ronald J. Gould, André Kündgen, Minjung Kang:
On the saturation spectrum of odd cycles. 213-224 - Jun Gao, Binlong Li, Jie Ma, Tianying Xie:
On two cycles of consecutive even lengths. 225-238 - Davide Mattiolo, Giuseppe Mazzuoccolo, Jozef Rajník, Gloria Tabarelli:
A lower bound for the complex flow number of a graph: A geometric approach. 239-256 - Liangchen Li, Chong Li, Rong Luo, Cun-Quan Zhang:
Integer flows on triangularly connected signed graphs. 257-272 - Tuan Anh Do, Joshua Erde, Mihyun Kang:
A note on the width of sparse random graphs. 273-295 - Pablo Blanco, Linda Cook, Meike Hatzel, Claire Hilaire, Freddie Illingworth, Rose McCarty:
On tree decompositions whose trees are minors. 296-306 - Xiaoli Yuan, Yuejian Peng:
Minimum degree stability of C2k+1 ${C}_{2k+1}$-free graphs. 307-321 - Songling Shan:
The overfull conjecture on graphs of odd order and large minimum degree. 322-351 - Penny Haxell, Ronen Wdowinski:
Degree criteria and stability for independent transversals. 352-371 - Jakub Kwasny, Jakub Przybylo:
Inclusion chromatic index of random graphs. 372-379 - Simon Spacapan:
Polyhedra without cubic vertices are prism-hamiltonian. 380-406
Volume 106, Number 3, 2024
- Issue Information. 407-409
- James Tuite:
The structure of digraphs with excess one. 411-434 - Christoforos Panagiotis:
Self-avoiding walks and polygons on hyperbolic graphs. 435-473 - Mohammadreza Bidgoli, Ali Mohammadian, Behruz Tayfeh-Rezaie, Maksim Zhukovskii:
Threshold for stability of weak saturation. 474-495 - Longfei Fang, Huiqiu Lin, Yongtang Shi:
Extremal spectral results of planar graphs without vertex-disjoint cycles. 496-524 - Alexandr V. Kostochka, Douglas B. West, Zimu Xiang:
Sharp lower bounds for the number of maximum matchings in bipartite multigraphs. 525-555 - Zhenzhen Li, Baoyindureng Wu:
Orientations of graphs with maximum Wiener index. 556-580 - David Hartvigsen:
Finding triangle-free 2-factors in general graphs. 581-662 - Yuval Wigderson:
Ramsey numbers upon vertex deletion. 663-675 - Zili Wang:
Flip distance and triangulations of a polyhedron. 676-685 - Jiaao Li, Reza Naserasr, Zhouningxin Wang, Xuding Zhu:
Circular flows in mono-directed signed graphs. 686-710 - Di Wu, Baogang Xu, Yian Xu:
The chromatic number of heptagraphs. 711-736
Volume 106, Number 4, 2024
- Issue Information. 737-739
- Steven Chaplick, Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt:
Edge-minimum saturated k-planar drawings. 741-762 - Bostjan Bresar, Michael A. Henning:
Best possible upper bounds on the restrained domination number of cubic graphs. 763-815 - Martin Milanic, Irena Penev, Nevena Pivac, Kristina Vuskovic:
Bisimplicial separators. 816-842 - Aurelio Sulser, Milos Trujic:
Ramsey numbers for multiple copies of sparse graphs. 843-870 - Yan Wang, Rong Wu:
Graphs with girth 9 and without longer odd holes are 3-colourable. 871-886 - Hemanshu Kaul, Rogers Mathew, Jeffrey A. Mudrock, Michael J. Pelsmajer:
Flexible list colorings: Maximizing the number of requests satisfied. 887-906 - Yan-Ting Xie, Yong-De Feng, Shou-Jun Xu:
A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs. 907-922 - Tara Abrishami, Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vuskovic:
Tree independence number I. (Even hole, diamond, pyramid)-free graphs. 923-943 - Matt DeVos, Jessica McDonald, Kathryn Nurse:
Another proof of Seymour's 6-flow theorem. 944-946 - Zhilan Wang, Jin Yan, Jie Zhang:
Cycle-factors in oriented graphs. 947-975 - Jan Petr, Julien Portier, Leo Versteegen:
On the number of minimum dominating sets and total dominating sets in forests. 976-993
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-12 21:24 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:
