@article{Mellinger-Mubayi/05,
AUTHOR = {Mellinger, Keith E. and Mubayi, Dhruv},
TITLE = {Constructions of bipartite graphs from finite geometries},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {1-10},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {bipartite Tur{\'{a}}n problem, finite geometry, even cycles},
URL = {http://dx.doi.org/10.1002/jgt.20059},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Farrugia-Mihok-Richter-Semanivsin/05,
AUTHOR = {Farrugia, Alastair and Mih{\'{o}}k, Peter and Richter, R. Bruce and Semaniv{\v{s}}in, Gabriel},
TITLE = {Factorizations and characterizations of induced-hereditary and compositive properties},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {11-27},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {compositive, hereditary, reducible, graph properties, graph partitioning, unique factorization},
URL = {http://dx.doi.org/10.1002/jgt.20062},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {see Erratum in J. Graph Theory, Vol. 50, 2005, No. 3, 261},
}
@article{Komjath-Shelah/05,
AUTHOR = {Komj{\'{a}}th, P{\'{e}}ter and Shelah, Saharon},
TITLE = {Finite subgraphs of uncountably chromatic graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {28-38},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {infinite graphs, chromatic number, independence results, taylor conjecture},
URL = {http://dx.doi.org/10.1002/jgt.20060},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gyarfas-Hubenko/05,
AUTHOR = {Gy{\'{a}}rf{\'{a}}s, Andr{\'{a}}s and Hubenko, Alice},
TITLE = {Semistrong edge coloring of graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {39-47},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {induced matchings, kneser graphs, subset graphs, cubes},
URL = {http://dx.doi.org/10.1002/jgt.20061},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aldred-Holton-Sheehan/05,
AUTHOR = {Aldred, R.E.L. and Holton, D.A. and Sheehan, J.},
TITLE = {2-factors with prescribed and proscribed edges},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {48-58},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {2-factors, prescribed edges, proscribed edges},
URL = {http://dx.doi.org/10.1002/jgt.20065},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jirasek/05,
AUTHOR = {Jir{\'{a}}sek, Jozef},
TITLE = {Arc reversal in Nonhamiltonian circulant oriented graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {59-68},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamiltonian cycle, cayley digraphs, arc reversal},
URL = {http://dx.doi.org/10.1002/jgt.20063},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nesetril-Wormald/05,
AUTHOR = {Ne{\v{s}}et{\v{r}}il, Jaroslav and Wormald, Nicholas C.},
TITLE = {The acyclic edge chromatic number of a random $d$-regular graph is $d + 1$},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {69-74},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {coloring, acyclic coloring, edge coloring, regular graphs, random graphs},
URL = {http://dx.doi.org/10.1002/jgt.20064},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chen-Gould-Kawarabayashi-Pfender-Wei/05,
AUTHOR = {Chen, G. and Gould, R.J. and Kawarabayashi, K. and Pfender, F. and Wei, B.},
TITLE = {Graph minors and linkages},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {1},
PAGES = {75-91},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph minors, $k$-linked graphs, connectivities, degrees},
URL = {http://dx.doi.org/10.1002/jgt.20067},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Fujisawa-Yoshimoto-Zhang/05,
AUTHOR = {Fujisawa, Jun and Yoshimoto, Kiyoshi and Zhang, Shenggui},
TITLE = {Heavy cycles passing through some specified vertices in weighted graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {93-103},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {weighted graph, (heavy, hamiltonian) cycle, minimum (weighted) degree, (weighted) degree sum},
URL = {http://dx.doi.org/10.1002/jgt.20066},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Xiong-Ryjacek-Broersma/05,
AUTHOR = {Xiong, Liming and Ryj{\'{a}}{\v{c}}ek, Zden{\v{e}}k and Broersma, Hajo},
TITLE = {On stability of the Hamiltonian index under contractions and closures},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {104-115},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamiltonian index, stable property, closure of a graph, contractible graph, collapsible graph},
URL = {http://dx.doi.org/10.1002/jgt.20068},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Beineke-Dunbar-Frick/05,
AUTHOR = {Beineke, Lowell W. and Dunbar, J.E. and Frick, M.},
TITLE = {Detour-saturated graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {116-134},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {longest path, detour, detour-saturated, unicyclic},
URL = {http://dx.doi.org/10.1002/jgt.20069},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lu-Liu-Tian/05a,
AUTHOR = {Lu, Mei and Liu, Huiqing and Tian, Feng},
TITLE = {Two sufficient conditions for dominating cycles},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {135-150},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {dominating cycle, connectivity, insertible vertex},
URL = {http://dx.doi.org/10.1002/jgt.20070},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Verstraete/05,
AUTHOR = {Verstraete, Jacques},
TITLE = {Unavoidable cycle lengths in graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {151-167},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {unavoidable cycle lengths, longest cycle, k-connected, binomial distribution},
URL = {http://dx.doi.org/10.1002/jgt.20072},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Nikiforov-Rousseau/05,
AUTHOR = {Nikiforov, Vladimir and Rousseau, Cecil C.},
TITLE = {A note on Ramsey numbers for books},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {2},
PAGES = {168-176},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {books, strongly regular graphs, ramsey number},
URL = {http://dx.doi.org/10.1002/jgt.20071},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kral-Sgall/05,
AUTHOR = {Kr{\'a}l', Daniel and Sgall, Ji{\v{r}}{\'{i}}},
TITLE = {Coloring graphs from lists with bounded size of their union},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {3},
PAGES = {177-186},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sudakov-Szabo-Vu/05,
AUTHOR = {Sudakov, Benny and Szab{\'o}, Tibor and Vu, Van H.},
TITLE = {A generalization of Tur{\'a}n's theorem},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {3},
PAGES = {187-195},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lai-Li-Poon/05,
AUTHOR = {Lai, Hong-Jian and Li, Xiangwen and Poon, Hoifung},
TITLE = {Nowhere zero 4-flow in regular matroids},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {3},
PAGES = {196-204},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kuhn-Osthus/05b,
AUTHOR = {K{\"u}hn, Daniela and Osthus, Deryk},
TITLE = {Spanning triangulations in graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {3},
PAGES = {205-233},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Luo-Zhang/05,
AUTHOR = {Luo, Rong and Zhang, Cun-Quan},
TITLE = {Edge-face chromatic number and edge chromatic number of simple plane graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {3},
PAGES = {234-256},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Meunier/05,
AUTHOR = {Meunier, Fr{\'e}d{\'e}ric},
TITLE = {A topological lower bound for the circular chromatic number of Schrijver graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {257-261},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Pfender/05,
AUTHOR = {Pfender, Florian},
TITLE = {Hamiltonicity and forbidden subgraphs in 4-connected graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {262-272},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Felsner-Trotter/05,
AUTHOR = {Felsner, Stefan and Trotter, William T.},
TITLE = {Posets and planar graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {273-284},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Henning/05,
AUTHOR = {Henning, Michael A.},
TITLE = {A linear Vizing-like relation relating the size and total domination number of a graph},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {285-290},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
NOTE = {see Erratum in J. Graph Theory 54(3) (2007), pp.~350-353},
}
@article{McLennan/05,
AUTHOR = {McLennan, Andrew},
TITLE = {The Erd{\H{o}}s-S{\'o}s conjecture for trees of diameter four},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {291-301},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Klavzar-Peterin/05,
AUTHOR = {Klav{\v{z}}ar, Sandi and Peterin, Iztok},
TITLE = {Characterizing subgraphs of Hamming graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {302-312},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Marx/05,
AUTHOR = {Marx, D{\'a}niel},
TITLE = {$NP$-completeness of list coloring and precoloring extension on the edges of planar graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {313-324},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Afshani-Ghandehari-Ghandehari-Hatami-Tusserkani-Zhu/05,
AUTHOR = {Afshani, Peyman and Ghandehari, Mahsa and Ghandehari, Mahya and Hatami, Hamed and Tusserkani, Ruzbeh and Zhu, Xuding},
TITLE = {Circular chromatic index of graphs of maximum degree 3},
JOURNAL = {J. Graph Theory},
VOLUME = {49},
NUMBER = {4},
PAGES = {325-335},
YEAR = {2005},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}