Write in a clean editor, then format for Journal of Graph Theory in one click — DocuGuru applies the official Wiley template with author–year references and exports a submission-ready PDF plus the editable LaTeX source. Free to start.
Journal of Graph Theory is a peer-reviewed journal published by Wiley, covering Advanced Graph Theory Research, Limits and Structures in Graph Theory, Graph Labeling and Dimension Problems.
| Publisher | Wiley |
|---|---|
| Reference style | Author–year (Chicago) Author–year — (Smith, 2023) in the text Smith, Ada, Ben Jones, and Cara Lee. 2023. "A Representative Article Title." Journal of Graph Theory 12 (3): 45–58.
Formats any DOI in Journal of Graph Theory style. No sign-up. |
| Publishes research in | Advanced Graph Theory Research Limits and Structures in Graph Theory Graph Labeling and Dimension Problems Graph theory and applications graph theory and CDMA systems |
| ISSN | 0364-9024 |
| Citation impact (2-yr) | 0.7 |
| h-index | 99 |
| i10-index | 1,706 |
| Total citations | 66,645 |
| Article processing charge | $3,760 |
| Top institutions publishing here | University of Waterloo |
| Journal website | onlinelibrary.wiley.com |
| You get | A submission-ready PDF and the editable LaTeX source — ready to submit. |
Citations each year’s papers have accumulated so far — the most recent years are still building up.
Abstract The graph isomorphism problem—to devise a good algorithm for determining if two graphs are isomorphic—is of considerable practical importance, and is also of theoretical interest due to its relationship to the concept of NP‐completeness. No efficient (i.e., polynomial‐bound) algorithm for graph isomorphism is known, and it has been conjectured that no such algorithm can…
Abstract Given a graph G = (V, E) , a subgraph Gapos; = (V, Eapos;) is a t‐ spanner of G if for every u, v ∈ V , the distance from u to v in Gapos; is at most t times longer than that distance in G. This paper presents some results concerning the…
Abstract There is diverse literature on various properties of a class of graphs known as circulants. We present a new result which answers the previously unsolved question of characterizing the connection sequence of circulants having point connectivity equal to point degree. We also develop some theorems regarding a new generalization of connectivity known as super‐connectivity.…
Abstract The bandwidth problem for a graph G is to label its n vertices v i with distinct integers f ( v i ) so that the quantity max{| f ( v i ) − f ( v i )| : ( v i v j ) ∈ E ( G )} is minimized. The…
Abstract We call a graph ( m , k )‐colorable if its vertices can be colored with m colors in such a way that each vertex is adjacent to at most k vertices of the same color as itself. For the class of planar graphs, and the class of outerplanar graphs, we determine all pairs…
