default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJournal of Graph Theory, Volume 108
Volume 108, Number 1, January 2025
Article
- Jørgen Bang-Jensen
, Yun Wang:
Strong arc decompositions of split digraphs. 5-26 - Ruilin Shi, Zach Walsh, Xingxing Yu:
Dense circuit graphs and the planar Turán number of a cycle. 27-38 - Siyan Liu, Rong-Xia Hao, Rong Luo, Cun-Quan Zhang:
Five-cycle double cover and shortest cycle cover. 39-49 - Brian G. Kronenthal, Joe Miller, Alex Nash, Jacob Roeder, Hani Samamah, Tony W. H. Wong:
Nonisomorphic two-dimensional algebraically defined graphs over R R. 50-64 - Babak Miraftab, Dave Witte Morris:
On vertex-transitive graphs with a unique hamiltonian cycle. 65-99 - Thilo Krill:
Universal graphs with forbidden wheel minors. 100-112 - Yipei Zhang, Fuliang Lu, Xiumei Wang, Jinjiang Yuan:
Removable edges in near-bipartite bricks. 113-135 - Manu Basavaraju, L. Sunil Chandran, Mathew C. Francis, Karthik Murali:
Variants of the Gyárfás-Sumner conjecture: Oriented trees and rainbow paths. 136-161 - Xing Feng:
On a Norine-Thomas conjecture concerning minimal bricks. 162-172 - Gui Xian Liu, Zai Ping Lu:
Edge-transitive cubic graphs of twice square-free order. 173-204 - Kevin Hendrey, Sergey Norin, Raphael Steiner, Jérémie Turcotte:
Finding dense minors using average degree. 205-223
Volume 108, Number 2, February 2025
Article
- Ervin Györi, Addisu Paulos, Nika Salia, Casey Tompkins, Oscar Zamora:
The maximum number of pentagons in a planar graph. 229-256 - Xiaohan Cheng, Jie Hu, Donglei Yang:
Compatible powers of Hamilton cycles in dense graphs. 257-273 - Isaak H. Wolf:
Fractional factors and component factors in graphs with isolated toughness smaller than 1. 274-287 - Jakub Kwasny, Marcin Stawiski:
Breaking small automorphisms by list colourings. 288-292 - Lyuben Lichev:
$d$ -connectivity of the random graph with restricted budget. 293-312 - Jie Ma, Rongxing Xu, Xuding Zhu:
On two problems of defective choosability of graphs. 313-324 - He Guo:
Short rainbow cycles for families of matchings and triangles. 325-336 - Paul Horn, Adam Purcilly, Alex Stevens:
Graph curvature and local discrepancy. 337-360 - Xuqian Fang, Daqing Yang:
An extension of Nash-Williams and Tutte's Theorem. 361-367 - Kenta Noguchi, Carol T. Zamfirescu:
Non-Hamiltonian Cartesian products of two even dicycles. 368-373 - Radek Husek, Robert Sámal:
Counting circuit double covers. 374-395
Volume 108, Number 3, March 2025
Article
- Ryoshun Oba, Shin-ichi Tanigawa:
Super stable tensegrities and the Colin de Verdière number ν \unicode{x003BD}. 401-431 - Valentin Bouquet, Christophe Picouleau:
The complexity of the perfect matching-cut problem. 432-462 - James M. Shook:
On a conjecture that strengthens Kundu's k k -factor theorem. 463-491 - József Balogh, Ce Chen, Sean English:
On the Constructor-Blocker game. 492-507 - Nanao Kita:
Basilica: New canonical decomposition in matching theory. 508-542 - Meng Liu, Yusheng Li:
On graphs for which large books are Ramsey good. 543-559 - Dániel Keliger, László Lovász, Tamás Ferenc Móri, Gergely Ódor:
Switchover phenomenon for general graphs. 560-581 - Kai Zhao, Xiao-Dong Zhang:
A localized approach for Turán number of long cycles. 582-607 - Amena Assem:
Towards Nash-Williams orientation conjecture for infinite graphs. 608-619 - Franklin Kenter, Erin Meger, Jérémie Turcotte:
Improved bounds on the cop number when forbidding a minor. 620-646 - Sarah Abusaif, Warren Singh, Timothy Sun:
Face-simple minimal quadrangulations of surfaces. 647-655
Volume 108, Number 4, April 2025
Article
- Rong Chen:
Graphs with girth 2 ℓ + 1 $2\ell +1$ and without longer odd holes are 3-colorable. 661-671 - Heidi Van den Camp:
The effect of symmetry-preserving operations on 3-connectivity. 672-704 - Jørgen Bang-Jensen, Yun Wang:
Edge-arc-disjoint paths in semicomplete mixed graphs. 705-721 - Rémy Belmonte, Ararat Harutyunyan, Noleen Köhler, Nikolaos Melissinos:
Odd chromatic number of graph classes. 722-744 - Emily Heath, Ryan R. Martin, Chris Wells:
The maximum number of odd cycles in a planar graph. 745-780 - Seog-Jin Kim, Xiaopan Lian:
Tight Upper Bound on the Clique Size in the Square of 2-Degenerate Graphs. 781-798 - Cheng-Chen Tsai:
Small Planar Hypohamiltonian Graphs. 799-807 - Xizhi Liu, Jialei Song:
Hypergraph Anti-Ramsey Theorems. 808-816 - Domagoj Bradac:
On a Question of Erdős and Nešetřil About Minimal Cuts in a Graph. 817-818 - Pu Gao, Hidde Koerts:
On the Pre- and Post-Positional Semi-Random Graph Processes. 819-831 - Hal A. Kierstead, Alexandr V. Kostochka, Zimu Xiang:
Equitable List Coloring of Planar Graphs With Given Maximum Degree. 832-838
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-11-04 00:45 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:
