Journal of Graph Theory, Volume 73 (original) (raw)

default search action

• combined dblp search
• author search
• venue search
• publication search

Authors:

• no matches
• 

Venues:

• no matches
• 

Publications:

• no matches
• 

• > Home > Journals > Journal of Graph Theory

SPARQL queries

Refine list

refinements active!

zoomed in on ?? of ?? records

view refined list in

export refined list as

Volume 73, Number 1, May 2013

Original Articles

• 
  • 
  • 
  • 
  • 
    Hanno Lefmann, Yury Person:
    Exact Results on the Number of Restricted Edge Colorings for Some Families of Linear Hypergraphs. 1-31
• 
  • 
  • 
  • 
  • 
    Victor A. Campos, Vasek Chvátal, Luc Devroye, Perouz Taslakian:
    Transversals in Trees. 32-43
• 
  • 
  • 
  • 
  • 
    Micha A. Perles, Horst Martini, Yaakov S. Kupitz:
    Locally Symmetric Graphs of Girth 4. 44-65
• 
  • 
  • 
  • 
  • 
    David J. Galvin:
    Maximizing _H_-Colorings of a Regular Graph. 66-84
• 
  • 
  • 
  • 
  • 
    Louis Esperet, Mickaël Montassier, Pascal Ochem, Alexandre Pinlou:
    A Complexity Dichotomy for the Coloring of Sparse Graphs. 85-102
• 
  • 
  • 
  • 
  • 
    Joseph P. Previte, Michelle Previte, Mary Vanderschoot:
    The Growth of Limits of Vertex Replacement Rules. 103-117

Volume 73, Number 2, June 2013

Original Articles

• 
  • 
  • 
  • 
  • 
    Gerard Jennhwa Chang, N. Narayanan:
    Strong Chromatic Index of 2-Degenerate Graphs. 119-126
• 
  • 
  • 
  • 
  • 
    Gábor N. Sárközy, Stanley M. Selkow, Fei Song:
    An Improved Bound for Vertex Partitions by Connected Monochromatic K-Regular Graphs. 127-145
• 
  • 
  • 
  • 
  • 
    Jun Fujisawa:
    Forbidden Subgraphs for Hamiltonicity of 3-Connected Claw-Free Graphs. 146-160
• 
  • 
  • 
  • 
  • 
    Bostjan Bresar, Jérémie Chalopin, Victor Chepoi, Matjaz Kovse, Arnaud Labourel, Yann Vaxès:
    Retracts of Products of Chordal Graphs. 161-180
• 
  • 
  • 
  • 
  • 
    Marina Groshaus, Leandro Montero:
    On the Iterated Biclique Operator. 181-190
• 
  • 
  • 
  • 
  • 
    Katsuhiro Ota, Gabriel Sueiro:
    Forbidden Induced Subgraphs for Toughness. 191-202
• 
  • 
  • 
  • 
  • 
    Zoltán Füredi, Younjin Kim:
    Cycle-Saturated Graphs with Minimum Number of Edges. 203-215
• 
  • 
  • 
  • 
  • 
    M. Amin Bahmanian, Christopher A. Rodger:
    Embedding Factorizations for 3-Uniform Hypergraphs. 216-224
• 
  • 
  • 
  • 
  • 
    Cai Heng Li, Hua Zhang:
    On Finite 2-Path-Transitive Graphs. 225-237

Volume 73, Number 3, July 2013

Articles

• 
  • 
  • 
  • 
  • 
    Michael Plantholt:
    A Combined Logarithmic Bound on the Chromatic Index of Multigraphs. 239-259
• 
  • 
  • 
  • 
  • 
    Subrahmanyam Kalyanasundaram, Asaf Shapira:
    A Note on Even Cycles and Quasirandom Tournaments. 260-266
• 
  • 
  • 
  • 
  • 
    Louis Esperet, Jan van den Heuvel, Frédéric Maffray, Félix Sipma:
    Fire Containment in Planar Graphs. 267-279
• 
  • 
  • 
  • 
  • 
    Xiu-Mei Zhang, Xiao-Dong Zhang, Daniel Gray, Hua Wang:
    The Number of Subtrees of Trees with Given Degree Sequence. 280-295
• 
  • 
  • 
  • 
  • 
    Daniel Kotlar, Ran Ziv:
    On Serial Symmetric Exchanges of Matroid Bases. 296-304
• 
  • 
  • 
  • 
  • 
    Yingqian Wang, Xianghua Mao, Zhengke Miao:
    Plane Graphs with Maximum Degree Δ≥8 Are Entirely (Δ+3)-Colorable. 305-317
• 
  • 
  • 
  • 
  • 
    David R. Wood:
    Treewidth of Cartesian Products of Highly Connected Graphs. 318-321
• 
  • 
  • 
  • 
  • 
    Jason I. Brown, Karl Dilcher, Dante V. Manna:
    On the Roots of Expected Independence Polynomials. 322-326
• 
  • 
  • 
  • 
  • 
    Andrew D. King, Bruce A. Reed:
    Asymptotics of the Chromatic Number for Quasi-Line Graphs. 327-341
• 
  • 
  • 
  • 
  • 
    Ross J. Kang:
    Improper Choosability and Property B. 342-353
• 
  • 
  • 
  • 
  • 
    Demetres Christofides, Katherine Edwards, Andrew D. King:
    A Note on Hitting Maximum and Maximal Cliques With a Stable Set. 354-360

Volume 73, Number 4, August 2013

Original Articles

• 
  • 
  • 
  • 
  • 
    Asim Basu, Sandip Das, Shamik Ghosh, Malay K. Sen:
    Circular-Arc Bigraphs and Its Subclasses. 361-376
• 
  • 
  • 
  • 
  • 
    Giuseppe Mazzuoccolo:
    An Upper Bound for the Excessive Index of an _r_-Graph. 377-376
• 
  • 
  • 
  • 
  • 
    Qiaojun Shu, Weifan Wang, Yiqiao Wang:
    Acyclic Chromatic Indices of Planar Graphs with Girth At Least 4. 386-399
• 
  • 
  • 
  • 
  • 
    Martin Milanic:
    Hereditary Efficiently Dominatable Graphs. 400-424
• 
  • 
  • 
  • 
  • 
    Florent Foucaud, Sylvain Gravier, Reza Naserasr, Aline Parreau, Petru Valicov:
    Identifying Codes in Line Graphs. 425-448
• 
  • 
  • 
  • 
  • 
    Stephen G. Hartke, Derrick Stolee, Douglas B. West, Matthew P. Yancey:
    Extremal Graphs With a Given Number of Perfect Matchings. 449-468
• 
  • 
  • 
  • 
  • 
    Rong Luo, Yue Zhao:
    A Sufficient Condition for Edge Chromatic Critical Graphs to Be Hamiltonian - An Approach to Vizing's 2-Factor Conjecture. 469-482

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.

Unpaywalled article links

Add open access links from to the list of external document links (if available).

load links from unpaywall.org

Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.

Archived links via Wayback Machine

For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).

load content from archive.org

Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.

Reference lists

Add a list of references from , , and to record detail pages.

load references from crossref.org and opencitations.net

Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.

Citation data

Add a list of citing articles from and to record detail pages.

load citations from opencitations.net

Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.

OpenAlex data

Load additional information about publications from .

load data from openalex.org

Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.

dblp was originally created in 1993 at:

since 2018, dblp has been operated and maintained by: