JournalTOCs

Journal of Graph Theory
Journal Prestige (SJR): 1.104

Citation Impact (citeScore): 1
Number of Followers: 5

Hybrid journal (It can contain Open Access articles)
ISSN (Print) 0364-9024 - ISSN (Online) 1097-0118
Published by John Wiley and Sons

[1764 journals]

Another proof of Seymour's 6‐flow theorem
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Matt DeVos; Jessica McDonald, Kathryn Nurse
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 944-946, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23091
  Issue No: Vol. 106, No. 4 (2024)
Best possible upper bounds on the restrained domination number of cubic
graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Boštjan Brešar; Michael A. Henning
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 763-815, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23095
  Issue No: Vol. 106, No. 4 (2024)
Edge‐minimum saturated k‐planar drawings
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Steven Chaplick; Fabian Klute, Irene Parada, Jonathan Rollin, Torsten Ueckerdt
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 741-762, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23097
  Issue No: Vol. 106, No. 4 (2024)
Bisimplicial separators
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Martin Milanič; Irena Penev, Nevena Pivač, Kristina Vušković
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 816-842, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23098
  Issue No: Vol. 106, No. 4 (2024)
A relation between the cube polynomials of partial cubes and the clique
polynomials of their crossing graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yan‐Ting Xie; Yong‐De Feng, Shou‐Jun Xu
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 907-922, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23099
  Issue No: Vol. 106, No. 4 (2024)
Ramsey numbers for multiple copies of sparse graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Aurelio Sulser; Miloš Trujić
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 843-870, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23100
  Issue No: Vol. 106, No. 4 (2024)
Graphs with girth 9 and without longer odd holes are 3‐colourable
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yan Wang; Rong Wu
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 871-886, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23101
  Issue No: Vol. 106, No. 4 (2024)
Flexible list colorings: Maximizing the number of requests satisfied
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Hemanshu Kaul; Rogers Mathew, Jeffrey A. Mudrock, Michael J. Pelsmajer
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 887-906, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23103
  Issue No: Vol. 106, No. 4 (2024)
Tree independence number I. (Even hole, diamond, pyramid)‐free
graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Tara Abrishami; Bogdan Alecu, Maria Chudnovsky, Sepehr Hajebi, Sophie Spirkl, Kristina Vušković
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 923-943, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23104
  Issue No: Vol. 106, No. 4 (2024)
Cycle‐factors in oriented graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Zhilan Wang; Jin Yan, Jie Zhang
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 947-975, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23105
  Issue No: Vol. 106, No. 4 (2024)
On the number of minimum dominating sets and total dominating sets in
forests
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Jan Petr; Julien Portier, Leo Versteegen
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 976-993, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.23107
  Issue No: Vol. 106, No. 4 (2024)
Issue Information
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Abstract: Journal of Graph Theory, Volume 106, Issue 4, Page 737-739, August 2024.
  PubDate: 2024-06-15T11:59:36-07:00
  DOI: 10.1002/jgt.22982
  Issue No: Vol. 106, No. 4 (2024)
Correction to “Sharp threshold for embedding balanced spanning trees in
random geometric graphs”
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-31T03:38:49-07:00
  DOI: 10.1002/jgt.23160
On the minimum number of arcs in 4‐dicritical oriented graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Frédéric Havet; Lucas Picasarri‐Arrieta, Clément Rambaud
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-29T10:23:54-07:00
  DOI: 10.1002/jgt.23159
Counting triangles in regular graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Jialin He; Xinmin Hou, Jie Ma, Tianying Xie
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-25T10:31:48-07:00
  DOI: 10.1002/jgt.23156
Counting rainbow triangles in edge‐colored graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Xueliang Li; Bo Ning, Yongtang Shi, Shenggui Zhang
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-23T07:46:42-07:00
  DOI: 10.1002/jgt.23158
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar
graphs without 4‐cycles
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: On‐Hei Solomon Lo
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-21T09:33:33-07:00
  DOI: 10.1002/jgt.23152
Defective acyclic colorings of planar graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: On‐Hei Solomon Lo; Ben Seamone, Xuding Zhu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-21T09:32:25-07:00
  DOI: 10.1002/jgt.23154
Local version of Vizing's theorem for multigraphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Clinton T. Conley; Jan Grebík, Oleg Pikhurko
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-16T05:44:53-07:00
  DOI: 10.1002/jgt.23155
Stability from graph symmetrization arguments in generalized Turán
problems
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Dániel Gerbner; Hilal Hama Karim
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-15T01:56:20-07:00
  DOI: 10.1002/jgt.23151
Multicolor Turán numbers II: A generalization of the Ruzsa–Szemerédi
theorem and new results on cliques and odd cycles
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Benedek Kovács; Zoltán Lóránt Nagy
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-14T09:40:23-07:00
  DOI: 10.1002/jgt.23147
Thin edges in cubic braces
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Xiaoling He; Fuliang Lu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-14T09:37:07-07:00
  DOI: 10.1002/jgt.23150
Growth rates of the bipartite Erdős–Gyárfás function
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Xihe Li; Hajo Broersma, Ligong Wang
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-11T08:51:05-07:00
  DOI: 10.1002/jgt.23149
Maximum odd induced subgraph of a graph concerning its chromatic number
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Tao Wang; Baoyindureng Wu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-09T05:12:51-07:00
  DOI: 10.1002/jgt.23148
Cliques in squares of graphs with maximum average degree less than 4
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Daniel W. Cranston; Gexin Yu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-07-02T02:11:21-07:00
  DOI: 10.1002/jgt.23125
A characterization of regular partial cubes whose all convex cycles have
the same lengths
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yan‐Ting Xie; Yong‐De Feng, Shou‐Jun Xu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-28T03:14:14-07:00
  DOI: 10.1002/jgt.23126
Polynomial bounds for chromatic number VIII. Excluding a path and a
complete multipartite graph
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Tung Nguyen; Alex Scott, Paul Seymour
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-24T05:35:05-07:00
  DOI: 10.1002/jgt.23129
Attainable bounds for algebraic connectivity and maximally connected
regular graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Geoffrey Exoo; Theodore Kolokolnikov, Jeanette Janssen, Timothy Salamon
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-24T05:30:45-07:00
  DOI: 10.1002/jgt.23146
On oriented m $m$‐semiregular representations of finite groups
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Jia‐Li Du; Yan‐Quan Feng, Sejeong Bang
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-21T10:38:20-07:00
  DOI: 10.1002/jgt.23145
A tight upper bound on the average order of dominating sets of a graph
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Iain Beaton; Ben Cameron
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-17T05:40:21-07:00
  DOI: 10.1002/jgt.23143
Highly connected triples and Mader's conjecture
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Qinghai Liu; Kai Ying, Yanmei Hong
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-17T05:39:55-07:00
  DOI: 10.1002/jgt.23144
Some results and problems on clique coverings of hypergraphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Vojtech Rödl; Marcelo Sales
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-11T06:15:00-07:00
  DOI: 10.1002/jgt.23111
Ramsey‐type problems on induced covers and induced partitions toward the
Gyárfás–Sumner conjecture
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Shuya Chiba; Michitaka Furuya
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-06T10:27:09-07:00
  DOI: 10.1002/jgt.23124
Kempe equivalent list colorings revisited
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Dibyayan Chakraborty; Carl Feghali, Reem Mahmoud
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-04T09:50:16-07:00
  DOI: 10.1002/jgt.23142
On the maximum local mean order of sub‐k $k$‐trees of a k
$k$‐tree
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Zhuo Li; Tianlong Ma, Fengming Dong, Xian'an Jin
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-02T10:24:56-07:00
  DOI: 10.1002/jgt.23128
Counting connected partitions of graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yair Caro; Balázs Patkós, Zsolt Tuza, Máté Vizer
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-06-02T10:20:45-07:00
  DOI: 10.1002/jgt.23127
The maximum number of maximum generalized 4‐independent sets in
trees
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Pingshan Li; Min Xu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-30T04:53:27-07:00
  DOI: 10.1002/jgt.23122
Planar graphs having no cycle of length 4, 7, or 9 are
DP‐3‐colorable
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Yingli Kang; Ligang Jin, Xuding Zhu
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-22T09:02:53-07:00
  DOI: 10.1002/jgt.23123
Bounding the number of odd paths in planar graphs via convex optimization
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Asaf Cohen Antonir; Asaf Shapira
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-15T09:06:34-07:00
  DOI: 10.1002/jgt.23120
Minimum‐degree conditions for rainbow triangles
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Victor Falgas‐Ravry; Klas Markström, Eero Räty
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-15T09:00:34-07:00
  DOI: 10.1002/jgt.23109
A more accurate view of the Flat Wall Theorem
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Ignasi Sau; Giannos Stamoulis, Dimitrios M. Thilikos
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-13T10:39:34-07:00
  DOI: 10.1002/jgt.23121
Concentration of hitting times in Erdős‐Rényi graphs
- Free pre-print version: Loading...
  Rate this result: What is this?
  
  Please help us test our new pre-print finding feature by giving the pre-print link a rating.
  A 5 star rating indicates the linked pre-print has the exact same content as the published article.
  
  Authors: Andrea Ottolini; Stefan Steinerberger
  Abstract: Journal of Graph Theory, EarlyView.
  PubDate: 2024-05-12T10:00:07-07:00
  DOI: 10.1002/jgt.23119

HOME > Browse the 73 Subjects covered by JournalTOCs
Subject	Total Journals