Journal of Graph Theory: Vol 104, No 4

I consent to Wiley Online Library’s Terms of Use and processing of my personal data as disclosed in Wiley’s Privacy Policy.I consent to my personal information being transferred outside of the People’s Republic of China as laid out in Wiley’s Privacy Policy.*(Optional) I consent to special offers, newsletter & promotions from Wiley. See Privacy Policy for more details.

Tools

Journal Metrics

Subscribe to this journal

Related Titles

IssueVolume 66, Issue 4
July 2025
IssueVolume 33, Issue 9
Pages: 325-376
September 2025

posts by Wiley's @wiley_statsr

Journal of Graph Theory

Journal list menu

Tools

Follow journal

Journal of Graph Theory: Volume 104, Issue 4

ISSUE INFORMATION

Issue Information

ARTICLES

Universal graphs for the topological minor relation

Spectral radius and edge-disjoint spanning trees

Bad list assignments for non- $k$ -choosable $k$ -chromatic graphs with $2k+2$ -vertices

Petals and books: The largest Laplacian spectral gap from 1

Interval colorings of graphs—Coordinated and unstable no-wait schedules

Clique-width: Harnessing the power of atoms

Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection

On asymptotic packing of convex geometric and ordered graphs

Every subcubic multigraph is $(1,{2}^{7})$ -packing edge-colorable

Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree

Large cycles in generalized Johnson graphs

Tools

More from this journal

Related Titles

About Wiley Online Library

Help & Support

Opportunities

Connect with Wiley

Journal of Graph Theory

Journal list menu

Tools

Follow journal

Journal of Graph Theory: Volume 104, Issue 4

Download PDFs

ISSUE INFORMATION

Issue Information

ARTICLES

Universal graphs for the topological minor relation

Spectral radius and edge-disjoint spanning trees

Bad list assignments for non- k $k$ -choosable k $k$ -chromatic graphs with 2 k + 2 $2k+2$ -vertices

Petals and books: The largest Laplacian spectral gap from 1

Interval colorings of graphs—Coordinated and unstable no-wait schedules

Clique-width: Harnessing the power of atoms

Powers of Hamiltonian cycles in randomly augmented Dirac graphs—The complete collection

On asymptotic packing of convex geometric and ordered graphs

Every subcubic multigraph is ( 1 , 2 7 ) $(1,{2}^{7})$ -packing edge-colorable

Characterization of graphs of diameter 2 containing a homeomorphically irreducible spanning tree

Large cycles in generalized Johnson graphs

Sign up for email alerts

Tools

More from this journal

Related Titles

Bad list assignments for non- $k$ -choosable $k$ -chromatic graphs with $2k+2$ -vertices

Every subcubic multigraph is $(1,{2}^{7})$ -packing edge-colorable