EUVIMED · CrossrefZeitschrift
Journal of Graph Theory
ISSN 0364-9024 · Wiley
Neueste Artikel
Toward Pancyclicity in 4‐Connected Planar Graphs
Edge‐Coloring a Graph G so That Every Copy of a Graph H Has an Odd Color Class
A Generalization of an Ear Decomposition and k‐Trees in Highly Connected Star‐Free Graphs
On Endomorphism Universality of Sparse Graph Classes
Independent Sets of Random Trees and Sparse Random Graphs
Polynomial Characterizations of Distance‐Biregular Graphs
Cycles in 3‐connected claw‐free planar graphs and 4‐connected planar graphs without 4‐cycles
A characterization of regular partial cubes whose all convex cycles have the same lengths
Highly connected triples and Mader's conjecture
Multicolor Turán numbers II: A generalization of the Ruzsa–Szemerédi theorem and new results on cliques and odd cycles
A relation between the cube polynomials of partial cubes and the clique polynomials of their crossing graphs
Turán number of the odd‐ballooning of complete bipartite graphs
On Turán problems with bounded matching number
Properly colored and rainbow C4 ${C}_{4}$'s in edge‐colored graphs
Connectivity preserving trees in k ‐connected or k ‐edge‐connected graphs
A strengthening of the spectral chromatic critical edge theorem: Books and theta graphs
On the hamiltonicity of a planar graph and its vertex‐deleted subgraphs
Hamiltonian cycles in 2‐tough 2K2 $2{K}_{2}$‐free graphs
Mader's conjecture for graphs with small connectivity
Counting spanning trees in a complete bipartite graph which contain a given spanning forest
Counting hypergraphs with large girth
Arc‐disjoint in‐ and out‐branchings in digraphs of independence number at most 2
Independent set and matching permutations
Find subtrees of specified weight and cycles of specified length in linear time
A survey of χ‐boundedness
Hamiltonian cycles in 3‐tough 2 K 2 ‐free graphs
Normal edge‐colorings of cubic graphs
On the number of linear hypergraphs of large girth
Induced subgraphs of graphs with large chromatic number. XII. Distant stars
A greedy algorithm for finding a large 2‐matching on a random cubic graph
Jahrgänge
2026 · 802025 · 1452024 · 1412023 · 1402022 · 1372021 · 1232020 · 1132019 · 952018 · 1272017 · 1292016 · 992015 · 672014 · 712013 · 892012 · 932011 · 782010 · 772009 · 672008 · 742007 · 772006 · 702005 · 762004 · 682003 · 752002 · 652001 · 672000 · 1021999 · 1751998 · 871997 · 1361996 · 2241995 · 1021994 · 821993 · 741992 · 601991 · 551990 · 781989 · 771988 · 651987 · 64
EUVIMED