@article{Horsley/11,
AUTHOR = {Horsley, Daniel},
TITLE = {Maximum packings of the complete graph with uniform length cycles},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {1-7},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {maximum packings, cycles},
URL = {http://dx.doi.org/10.1002/jgt.20536},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{McDonald/11,
AUTHOR = {McDonald, J.M.},
TITLE = {On a theorem of Goldberg},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {8-21},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20537},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bryant-Danziger/11,
AUTHOR = {Bryant, Darryn and Danziger, Peter},
TITLE = {On bipartite 2-factorizations of $k_n-I$ and the Oberwolfach problem},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {22-37},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {oberwolfach problem, 2-factorizations, graph factorizations, graph decompositions},
URL = {http://dx.doi.org/10.1002/jgt.20538},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gardi/11,
AUTHOR = {Gardi, Fr{\'e}d{\'e}ric},
TITLE = {On partitioning interval graphs into proper interval subgraphs and related problems},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {38-54},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {interval graphs, circular-arc graphs, proper interval graphs, graph partitioning problems, efficient graph algorithms},
URL = {http://dx.doi.org/10.1002/jgt.20539},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chen-Hu-Wu/11,
AUTHOR = {Chen, Guantao and Hu, Zhiquan and Wu, Yaping},
TITLE = {Circumferences of $k$-connected graphs involving independence numbers},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {55-76},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {circumference, connectivity, independence number},
URL = {http://dx.doi.org/10.1002/jgt.20540},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aldred-Egawa-Fujisawa-Ota-Saito/11,
AUTHOR = {Aldred, R.E.L. and Egawa, Yoshimi and Fujisawa, Jun and Ota, Katsuhiro and Saito, Akira},
TITLE = {The existence of a 2-factor in $K_{1, n}$-free graphs with large connectivity and large edge-connectivity},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {1},
PAGES = {77-89},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {2-factor, k1, n-free graph, (edge-)connectivity, minimum degree},
URL = {http://dx.doi.org/10.1002/jgt.20541},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Alon-Hall-Knauer-Pinchasi-Yuster/11,
AUTHOR = {Alon, Noga and Hall, H. Tracy and Knauer, Christian and Pinchasi, Rom and Yuster, Raphael},
TITLE = {On graphs and algebraic graphs that do not contain cycles of length 4},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {91-102},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {algebraic graph, minimum rank, bipartite, square-free, square-avoiding, graph regularity, multiset regularity, adjacency rank, forbidden subgraph},
URL = {http://dx.doi.org/10.1002/jgt.20542},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cameron-Hoang-Leveque/11,
AUTHOR = {Cameron, Kathie and Ho{\`a}ng, Ch{\'{i}}nh T. and L{\'e}v{\^e}que, Benjamin},
TITLE = {Characterizing directed path graphs by forbidden asteroids},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {103-112},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {intersection graph, directed path graph, asteroidal triple},
URL = {http://dx.doi.org/10.1002/jgt.20543},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Fomin-Kratochvil-Lokshtanov-Mancini-Telle/11,
AUTHOR = {Fomin, Fedor V. and Kratochv{\'{i}}l, Jan and Lokshtanov, Daniel and Mancini, Federico and Telle, Jan Arne},
TITLE = {On the complexity of reconstructing $H$-free graphs from their Star Systems},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {113-124},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20544},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Mazzuoccolo/11,
AUTHOR = {Mazzuoccolo, G.},
TITLE = {The equivalence of two conjectures of Berge and Fulkerson},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {125-128},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {cubic graphs, berge-fulkerson conjecture, perfect matchings},
URL = {http://dx.doi.org/10.1002/jgt.20545},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Rackham/11,
AUTHOR = {Rackham, Tom},
TITLE = {The number of defective colorings of graphs on surfaces},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {129-136},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph coloring, planar graphs},
URL = {http://dx.doi.org/10.1002/jgt.20546},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{McKee/11,
AUTHOR = {McKee, Terry A.},
TITLE = {When every $k$-cycle has at least $f(k)$ chords},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {137-147},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {cycle, chord, choral graph, cograph},
URL = {http://dx.doi.org/10.1002/jgt.20547},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Luo-Zhao/11,
AUTHOR = {Luo, Rong and Zhao, Yue},
TITLE = {Finding $\Delta(\Sigma)$ for a surface $\sigma$ of characteristic $\chi(\Sigma) = -5$},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {148-168},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {edge colorings, class one, class two, critical graphs, surfaces},
URL = {http://dx.doi.org/10.1002/jgt.20548},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Borodin-Ivanova/11a,
AUTHOR = {Borodin, O.V. and Ivanova, A.O.},
TITLE = {Acyclic 5-choosability of planar graphs without adjacent short cycles},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {2},
PAGES = {169-176},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {planar graph, acyclic coloring, acyclic choosability},
URL = {http://dx.doi.org/10.1002/jgt.20549},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bueno-Horak/11,
AUTHOR = {Bueno, Let{\'{i}}cia R. and Hor{\'a}k, Peter},
TITLE = {On Hamiltonian cycles in the prism over the odd graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {177-188},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamiltonian cycle, prism over a graph, kneser graphs},
URL = {http://dx.doi.org/10.1002/jgt.20550},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lukotka-Skoviera/11,
AUTHOR = {Lukot'ka, Robert and {\v{S}}koviera, Martin},
TITLE = {Snarks with given real flow numbers},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {189-201},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {nowhere zero flow, flow number, snark},
URL = {http://dx.doi.org/10.1002/jgt.20551},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Luo-Zhao/11a,
AUTHOR = {Luo, Rong and Zhao, Yue},
TITLE = {A new upper bound for the independence number of edge chromatic critical graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {202-212},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {edge coloring, independence number, critical graphs},
URL = {http://dx.doi.org/10.1002/jgt.20552},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Suzuki/11,
AUTHOR = {Suzuki, Yusuke},
TITLE = {Re-embedding structures of 4-connected projective-planar graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {213-228},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20553},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kaminski-Medvedev-Milanic/11,
AUTHOR = {Kami{\'n}ski, Marcin and Medvedev, Paul and Milani{\v{c}}, Martin},
TITLE = {The plane-width of graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {229-245},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {plane-width, realization of a graph, packing non-overlapping unit discs, chromatic number, circular chromatic number},
URL = {http://dx.doi.org/10.1002/jgt.20554},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Seress-Swartz/11,
AUTHOR = {Seress, {\'A}kos and Swartz, Eric},
TITLE = {A note on the girth-doubling construction for polygonal graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {246-254},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {polygonal graphs, 2-arc transitive graphs, graph automorphisms},
URL = {http://dx.doi.org/10.1002/jgt.20555},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Dudek-Ramadurai/11,
AUTHOR = {Dudek, Andrzej and Ramadurai, Reshma},
TITLE = {Vertex colorings of graphs without short odd cycles},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {3},
PAGES = {255-264},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {ramsey-type problems, vertex colorings},
URL = {http://dx.doi.org/10.1002/jgt.20557},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Loz-Macaj-Miller-Siagiova-Siran-Tomanova/11,
AUTHOR = {Loz, Eyal and Ma{\v{c}}aj, Martin and Miller, Mirka and {\v{S}}iagiov{\'a}, Jana and {\v{S}}ir{\'a}{\v{n}}, Jozef and Tomanov{\'a}, Jana},
TITLE = {Small vertex-transitive and Cayley graphs of girth six and given degree: An algebraic approach},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {265-284},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph, girth, degree, cage},
URL = {http://dx.doi.org/10.1002/jgt.20556},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Li-Chen-Broersma/11,
AUTHOR = {Li, MingChu and Chen, Xiaodong and Broersma, Hajo},
TITLE = {Hamiltonian connectedness in 4-connected hourglass-free claw-free graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {285-298},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamiltonian connectedness, claw-free, hourglass-free},
URL = {http://dx.doi.org/10.1002/jgt.20558},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Muller-Perez-Gimenez-Wormald/11,
AUTHOR = {M{\"u}ller, Tobias and P{\'e}rez-Gim{\'e}nez, Xavier and Wormald, Nicholas},
TITLE = {Disjoint Hamilton cycles in the random geometric graph},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {299-322},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {random geometric graph, hamilton cycle, threshold function},
URL = {http://dx.doi.org/10.1002/jgt.20560},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chang/11a,
AUTHOR = {Chang, Gerard J.},
TITLE = {Near-automorphisms of paths},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {323-325},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {permutation, near-automorphism, path},
URL = {http://dx.doi.org/10.1002/jgt.20561},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Horev/11,
AUTHOR = {Horev, Elad},
TITLE = {Extremal graphs without a semi-topological wheel},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {326-339},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {subdivisions of the wheel graph, semi-topological minors},
URL = {http://dx.doi.org/10.1002/jgt.20562},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Macajova-Raspaud-Tarsi-Zhu/11,
AUTHOR = {M{\'a}{\v{c}}ajov{\'a}, Edita and Raspaud, Andr{\'e} and Tarsi, Michael and Zhu, Xuding},
TITLE = {Short cycle covers of graphs and nowhere-zero flows},
JOURNAL = {J. Graph Theory},
VOLUME = {68},
NUMBER = {4},
PAGES = {340-348},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20563},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Mohar-Vodopivec/11,
AUTHOR = {Mohar, Bojan and Vodopivec, Andrej},
TITLE = {The genus of Petersen powers},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {1-8},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {dot product, genus, snark},
URL = {http://dx.doi.org/10.1002/jgt.20507},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chen/11b,
AUTHOR = {Chen, Ya-Chen},
TITLE = {All minimum $C_5$-saturated graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {9-26},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {extremal graphs, forbidden subgraphs, c5-saturated graphs},
URL = {http://dx.doi.org/10.1002/jgt.20508},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Vijayakumar/11a,
AUTHOR = {Vijayakumar, G.R.},
TITLE = {Equivalence of four descriptions of generalized line graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {27-33},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {generalized line graph, representation of a graph, enhanced line graph},
URL = {http://dx.doi.org/10.1002/jgt.20509},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Gravin-Chen/11,
AUTHOR = {Gravin, Nick and Chen, Ning},
TITLE = {A note on $k$-shortest paths problem},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {34-37},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {nash equilibrium, shortest path, k-paths, edge-disjoint, flow},
URL = {http://dx.doi.org/10.1002/jgt.20510},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aldred-Plummer/11,
AUTHOR = {Aldred, R.E.L. and Plummer, Michael D.},
TITLE = {Proximity thresholds for matching extension in planar and projective planar triangulations},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {38-46},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {distance restricted matching extension, planar triangulation, projective planar triangulation},
URL = {http://dx.doi.org/10.1002/jgt.20511},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lin-Li/11,
AUTHOR = {Lin, Qizhong and Li, Yusheng},
TITLE = {Multicolor bipartite Ramsey number of $C_4$ and large $K_{n, n}$},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {47-54},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {bipartite ramsey number, cycle, asymptotic bound},
URL = {http://dx.doi.org/10.1002/jgt.20512},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wiener-Araya/11,
AUTHOR = {Wiener, G{\'a}bor and Araya, Makoto},
TITLE = {On planar Hypohamiltonian graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {55-68},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph, hamiltonian, hypohamiltonian, hypotraceable},
URL = {http://dx.doi.org/10.1002/jgt.20513},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cereceda-van_den_Heuvel-Johnson/11,
AUTHOR = {Cereceda, Luis and van den Heuvel, Jan and Johnson, Matthew},
TITLE = {Finding paths between 3-colorings},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {1},
PAGES = {69-82},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph coloring, algorithms, graph recoloring, reconfigurations},
URL = {http://dx.doi.org/10.1002/jgt.20514},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Borodin-Ivanova/11,
AUTHOR = {Borodin, Oleg V. and Ivanova, Anna O.},
TITLE = {List strong linear 2-arboricity of sparse graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {83-90},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {planar graph, vertex partitions, vertex arboricity, star forest, list coloring},
URL = {http://dx.doi.org/10.1002/jgt.20516},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lo/11,
AUTHOR = {Lo, Allan Siu Lun},
TITLE = {Constrained Ramsey numbers for rainbow matching},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {91-95},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {ramsey, constrained ramsey, rainbow matching},
URL = {http://dx.doi.org/10.1002/jgt.20517},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Lowenstein-Pedersen-Rautenbach-Regen/11,
AUTHOR = {L{\"o}wenstein, Christian and Pedersen, Anders Sune and Rautenbach, Dieter and Regen, Friedrich},
TITLE = {Independence, odd girth, and average degree},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {96-111},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {independence, stability, triangle-free graph, odd girth},
URL = {http://dx.doi.org/10.1002/jgt.20518},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Harant-Jendrol-Madaras/11,
AUTHOR = {Harant, Jochen and Jendrol, Stanislav and Madaras, Tom{\'a}{\v{s}}},
TITLE = {Upper bounds on the sum of powers of the degrees of a simple planar graph},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {112-123},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {degree sum, planar graph},
URL = {http://dx.doi.org/10.1002/jgt.20519},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Hamidoune-Llado-Lopez/11,
AUTHOR = {Hamidoune, Y.O. and Llad{\'o}, A. and L{\'o}pez, S.C.},
TITLE = {Vertex-transitive graphs that remain connected after failure of a vertex and its neighbors},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {124-138},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {isoperimetric connectivity, superconnectivity, vertex-transitive, cayley graph, atom},
URL = {http://dx.doi.org/10.1002/jgt.20521},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Jiang/11a,
AUTHOR = {Jiang, Tao},
TITLE = {Compact topological minors in graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {139-152},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {topological clique, turan number, subdivision, minor},
URL = {http://dx.doi.org/10.1002/jgt.20522},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Chakrabarti-Khot/11,
AUTHOR = {Chakrabarti, Amit and Khot, Subhash},
TITLE = {Combinatorial theorems about embedding trees on the real line},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {2},
PAGES = {153-168},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20608},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bahls/11,
AUTHOR = {Bahls, Patrick},
TITLE = {Channel assignment on Cayley graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {169-177},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {channel assignment, frequency assignment, l(2, 1)-labeling, cayley graph},
URL = {http://dx.doi.org/10.1002/jgt.20523},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Liu-Norine-Pan-Zhu/11,
AUTHOR = {Liu, , Daphne and Norine, Serguei and Pan, Zhishi and Zhu, Xuding},
TITLE = {Circular consecutive choosability of $k$-choosable graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {178-197},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {choosability, circular consecutive choosability},
URL = {http://dx.doi.org/10.1002/jgt.20524},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Moffatt/11,
AUTHOR = {Moffatt, Iain},
TITLE = {A characterization of partially dual graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {198-217},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {duality, ribbon graphs, graphs on surfaces, partial duality},
URL = {http://dx.doi.org/10.1002/jgt.20525},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Zhang/11b,
AUTHOR = {Zhang, Huajun},
TITLE = {Primitivity and independent sets in direct products of vertex-transitive graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {218-225},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {direct product, independent set, primitivity},
URL = {http://dx.doi.org/10.1002/jgt.20526},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Shabanov/11,
AUTHOR = {Shabanov, Dmitry A.},
TITLE = {On a generalization of Rubin's theorem},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {226-234},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {choice number, hypergraph panchromatic coloring},
URL = {http://dx.doi.org/10.1002/jgt.20527},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Korpelainen-Lozin/11,
AUTHOR = {Korpelainen, Nicholas and Lozin, Vadim V.},
TITLE = {Bipartite induced subgraphs and well-quasi-ordering},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {235-249},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {bipartite graph, induced subgraph, well-quasi-ordering},
URL = {http://dx.doi.org/10.1002/jgt.20528},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ota-Plummer-Saito/11,
AUTHOR = {Ota, Katsuhiro and Plummer, Michael D. and Saito, Akira},
TITLE = {Forbidden triples for perfect matchings},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {3},
PAGES = {250-259},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {forbidden subgraph, perfect matching},
URL = {http://dx.doi.org/10.1002/jgt.20529},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Cutler-Radcliffe/11,
AUTHOR = {Cutler, Jonathan and Radcliffe, A.J.},
TITLE = {Extremal graphs for homomorphisms},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {261-284},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {extremal problem, homomorphisms, threshold graphs},
URL = {http://dx.doi.org/10.1002/jgt.20530},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bowler-Brown-Fenner-Myrvold/11,
AUTHOR = {Bowler, Andrew and Brown, Paul and Fenner, Trevor and Myrvold, Wendy},
TITLE = {Recognizing connectedness from vertex-deleted subgraphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {285-299},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {reconstruction conjecture, reconstruction number, card, vertex-deleted subgraph},
URL = {http://dx.doi.org/10.1002/jgt.20531},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{King/11,
AUTHOR = {King, Andrew D.},
TITLE = {Hitting all maximum cliques with a stable set using lopsided independent transversals},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {300-305},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {maximum clique, stable set, graph coloring, independent transversal, independent system of representatives},
URL = {http://dx.doi.org/10.1002/jgt.20532},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Kawarabayashi-Ozeki/11a,
AUTHOR = {Kawarabayashi, Ken-Ichi and Ozeki, Kenta},
TITLE = {2- and 3-factors of graphs on surfaces},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {306-315},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamiltonian cycle, graphs on a surface, factors},
URL = {http://dx.doi.org/10.1002/jgt.20533},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Dellamonica-Koubek-Martin-Rodl/11,
AUTHOR = {Dellamonica, Domingos, Jr. and Koubek, V{\'a}clav and Martin, Daniel M. and R{\"o}dl, Vojt{\v{e}}ch},
TITLE = {On a conjecture of Thomassen concerning subgraphs of large girth},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {316-331},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
URL = {http://dx.doi.org/10.1002/jgt.20534},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bondy-Mercier/11,
AUTHOR = {Bondy, J.A. and Mercier, F.},
TITLE = {Switching reconstruction of digraphs},
JOURNAL = {J. Graph Theory},
VOLUME = {67},
NUMBER = {4},
PAGES = {332-348},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {switching, reconstruction, digraphs, coloured graphs, matrices},
URL = {http://dx.doi.org/10.1002/jgt.20535},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Borodin-Glebov/11,
AUTHOR = {Borodin, Oleg V. and Glebov, Aleksei N.},
TITLE = {Planar graphs with neither 5-cycles nor close 3-cycles are 3-colorable},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {1-31},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {planar graphs, coloring, 3-color problem},
URL = {http://dx.doi.org/10.1002/jgt.20486},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Rabern/11,
AUTHOR = {Rabern, Landon},
TITLE = {On hitting all maximum cliques with an independent set},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {32-37},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {coloring, Reed's conjecture, clique, line graph},
URL = {http://dx.doi.org/10.1002/jgt.20487},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Havet-Jendrol-Sotak-Skrabulakova/11,
AUTHOR = {Havet, Fr{\'e}d{\'e}ric and Jendrol', Stanislav and Sot{\'a}k, Roman and {\v{S}}krabul'{\'a}kov{\'a}, Erika},
TITLE = {Facial non-repetitive edge-coloring of plane graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {38-48},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {thue sequences, edge coloring, non-repetitive, plane graph, tree},
URL = {http://dx.doi.org/10.1002/jgt.20488},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Goncalves/11,
AUTHOR = {Gon{\c{c}}alves, D.},
TITLE = {On vertex partitions and some minor-monotone graph parameters},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {49-56},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {vertex partition, minor-monotone parameters},
URL = {http://dx.doi.org/10.1002/jgt.20490},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sarkozy/11,
AUTHOR = {S{\'a}rk{\"o}zy, G{\'a}bor N.},
TITLE = {Monochromatic cycle partitions of edge-colored graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {57-64},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {monochromatic cycle partitions, edge-colorings},
URL = {http://dx.doi.org/10.1002/jgt.20492},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Simonyi-Tardos/11,
AUTHOR = {Simonyi, G{\'a}bor and Tardos, G{\'a}bor},
TITLE = {On directed local chromatic number, shift graphs, and Borsuk-like graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {65-82},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {local chromatic number, shift graph, schrijver graph, topological method},
URL = {http://dx.doi.org/10.1002/jgt.20494},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Holt-Nigussie/11,
AUTHOR = {Holt, Tracy and Nigussie, Yared},
TITLE = {Short proofs for two theorems of Chien, Hell and Zhu},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {1},
PAGES = {83-88},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {series-parallel, graph homomorphism, circular chromatic number},
URL = {http://dx.doi.org/10.1002/jgt.20515},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Araujo-Pardo-Montellano-Ballesteros-Strausz/11,
AUTHOR = {Araujo-Pardo, M. Gabriela and Montellano-Ballesteros, Juan Jos{\'e} and Strausz, Ricardo},
TITLE = {On the pseudoachromatic index of the complete graph},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {89-97},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {pseudoachromatic number, colorings},
URL = {http://dx.doi.org/10.1002/jgt.20491},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Woodall/11,
AUTHOR = {Woodall, Douglas R.},
TITLE = {The independence number of an edge-chromatic critical graph},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {98-103},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {adjacency lemma, chromatic index, edge coloring, edge-critical graph},
URL = {http://dx.doi.org/10.1002/jgt.20493},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Zhang/11a,
AUTHOR = {Zhang, Xiao-Dong},
TITLE = {Vertex degrees and doubly stochastic graph matrices},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {104-114},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {tree, doubly stochastic matrix, distance},
URL = {http://dx.doi.org/10.1002/jgt.20495},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Benjamini-Hoppen-Ofek-Pralat-Wormald/11,
AUTHOR = {Benjamini, Itai and Hoppen, Carlos and Ofek, Eran and Pra{\l}at, Pawe{\l} and Wormald, Nick},
TITLE = {Geodesics and almost geodesic cycles in random regular graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {115-136},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {geodesics, random regular graphs},
URL = {http://dx.doi.org/10.1002/jgt.20496},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ryjacek-Vrana/11,
AUTHOR = {Ryj{\'a}{\v{c}}ek, Zden{\v{e}}k and Vr{\'a}na, Petr},
TITLE = {On stability of Hamilton-connectedness under the 2-closure in claw-free graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {137-151},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamilton-connected, closure, claw-free graph},
URL = {http://dx.doi.org/10.1002/jgt.20497},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Ryjacek-Vrana/11a,
AUTHOR = {Ryj{\'a}{\v{c}}ek, Zden{\v{e}}k and Vr{\'a}na, Petr},
TITLE = {Line graphs of multigraphs and Hamilton-connectedness of claw-free graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {2},
PAGES = {152-173},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {hamilton-connected, line graph of a multigraph, claw-free graph, closure},
URL = {http://dx.doi.org/10.1002/jgt.20498},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Zhang-Liu/11a,
AUTHOR = {Zhang, Xia and Liu, Guizhen},
TITLE = {Equitable edge-colorings of simple graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {3},
PAGES = {175-197},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {simple graphs, equitable edge-coloring, f-coloring, f-chromatic index},
URL = {http://dx.doi.org/10.1002/jgt.20499},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Wong-Zhu/11,
AUTHOR = {Wong, Tsai-Lien and Zhu, Xuding},
TITLE = {Total weight choosability of graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {3},
PAGES = {198-212},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {edge-weight-choosable, total weight choosable, list assignment},
URL = {http://dx.doi.org/10.1002/jgt.20500},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Aravind-Subramanian/11,
AUTHOR = {Aravind, N.R. and Subramanian, C.R.},
TITLE = {Bounds on vertex colorings with restrictions on the union of color classes},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {3},
PAGES = {213-234},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {proper colorings, restricted colorings, acyclic colorings, treewidth, forbidden subgraphs, forbidden minors, probabilistic arguments, random graphs},
URL = {http://dx.doi.org/10.1002/jgt.20501},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Fomin-Saurabh-Thilikos/11,
AUTHOR = {Fomin, Fedor V. and Saurabh, Saket and Thilikos, Dimitrios M.},
TITLE = {Strengthening  property for minor-closed graph classes},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {3},
PAGES = {235-240},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {Erd{\H{o}}s-P{\'o}sa property, graph minors},
URL = {http://dx.doi.org/10.1002/jgt.20503},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{DeVos-Samal/11,
AUTHOR = {DeVos, Matt and {\v{S}}{\'a}mal, Robert},
TITLE = {High-girth cubic graphs are homomorphic to the Clebsch graph},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {3},
PAGES = {241-259},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {max-cut, cut-continuous mappings, circular chromatic number},
URL = {http://dx.doi.org/10.1002/jgt.20580},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Bollobas-Scott/11,
AUTHOR = {Bollob{\'a}s, B{\'e}la and Scott, Alex},
TITLE = {Intersections of graphs},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {4},
PAGES = {261-282},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {discrepancy, subgraphs, graph intersections},
URL = {http://dx.doi.org/10.1002/jgt.20489},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Goring-Helmberg-Wappler/11,
AUTHOR = {G{\"o}ring, Frank and Helmberg, Christoph and Wappler, Markus},
TITLE = {The rotational dimension of a graph},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {4},
PAGES = {283-302},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {spectral graph theory, semidefinite programming, eigenvalue optimization, embedding, graph partitioning, tree-width},
URL = {http://dx.doi.org/10.1002/jgt.20502},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Grech/11,
AUTHOR = {Grech, Mariusz},
TITLE = {The graphical complexity of direct products of permutation groups},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {4},
PAGES = {303-318},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {colored graph, automorphism group, permutation group, direct product},
URL = {http://dx.doi.org/10.1002/jgt.20504},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Goddard-Lyle/11,
AUTHOR = {Goddard, Wayne and Lyle, Jeremy},
TITLE = {Dense graphs with small clique number},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {4},
PAGES = {319-331},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {dense graphs, clique, coloring, homomorphism, minimum degree},
URL = {http://dx.doi.org/10.1002/jgt.20505},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}
@article{Sereni-Stehlik/11,
AUTHOR = {Sereni, Jean-S{\'e}bastien and Stehl{\'{i}}k, Mat{\v{e}}j},
TITLE = {Edge-face coloring of plane graphs with maximum degree nine},
JOURNAL = {J. Graph Theory},
VOLUME = {66},
NUMBER = {4},
PAGES = {332-346},
YEAR = {2011},
EDITOR = {Seymour, Paul and Thomassen, Carsten},
KEYWORDS = {graph coloring, plane graph, edge-face coloring},
URL = {http://dx.doi.org/10.1002/jgt.20506},
PUBLISHER = {John Wiley \& Sons},
ADDRESS = {Hoboken},
}