Journal: Graphs and Combinatorics

Volume 32, Issue 6

2199 -- 2209Jesús Alva-Samos, Juan José Montellano-Ballesteros. Rainbow Connection in Some Digraphs
2211 -- 2239Andrew Beveridge, Jeanmarie Youngblood. The Best Mixing Time for Random Walks on Trees
2241 -- 2252Gilberto Calvillo, David Romero. New Families of n-Clusters Verifying the Erdős-Faber-Lovász Conjecture
2253 -- 2266Zhi-Hong Chen. Chvátal-Erdös Type Conditions for Hamiltonicity of Claw-Free Graphs
2267 -- 2273Zhi-Hong Chen. Snarks, Hypohamiltonian Graphs and Non-Supereulerian Graphs
2275 -- 2293Lei Cheng, Jianfeng Hou, Yusheng Li, Qizhong Lin. Monochromatic Solutions for Multi-Term Unknowns
2295 -- 2313Megan Cream, Ralph J. Faudree, Ronald J. Gould, Kazuhide Hirohata. Chorded Cycles
2315 -- 2322Radoslaw Cymer, Mikio Kano. Generalizations of Marriage Theorem for Degree Factors
2323 -- 2337Michal Debski, Zbigniew Lonc. Universal Cycle Packings and Coverings for k-Subsets of an n-Set
2339 -- 2353Vincent Despré, Francis Lazarus. Some Triangulated Surfaces without Balanced Splitting
2355 -- 2366Suyun Ding, Bo Ling, Bengong Lou, Jiangmin Pan. Arc-Transitive Pentavalent Graphs of Square-Free Order
2367 -- 2392Alejandro Estrada-Moreno, Ismael González Yero, Juan A. Rodríguez-Velázquez. Relationships Between the 2-Metric Dimension and the 2-Adjacency Dimension in the Lexicographic Product of Graphs
2393 -- 2413Sylvain Gravier, Frédéric Maffray, Lucas Pastor. On the Choosability of Claw-Free Perfect Graphs
2415 -- 2423Zita Helle, Gábor Simonyi. Orientations Making k-Cycles Cyclic
2425 -- 2441Michael A. Henning, Felix Joos, Christian Löwenstein, Thomas Sasse. Induced Cycles in Graphs
2443 -- 2460Robert Hochberg, Paul Phillips. Discrepancy One among Homogeneous Arithmetic Progressions
2461 -- 2471Jonathan Hulgan, Jeno Lehel, Kenta Ozeki, Kiyoshi Yoshimoto. Vertex Coloring of Graphs by Total 2-Weightings
2473 -- 2495Andrea Jiménez, Mihyun Kang, Martin Loebl. Cubic Bridgeless Graphs and Braces
2497 -- 2514Chaya Keller, Micha A. Perles. On Convex Geometric Graphs with no k + 1 Pairwise Disjoint Edges
2515 -- 2524Ewa Kubicka, Grzegorz Kubicki, Maxfield Leidner. Total Colorings of Graphs with Minimum Sum of Colors
2525 -- 2539Oscar Levin, Taylor McMillan. Computing Planarity in Computable Planar Graphs
2541 -- 2549Binlong Li, Halina Bielak. On the Ramsey-Goodness of Paths
2551 -- 2562Zuosong Liang, Erfang Shan, Liying Kang. Clique-Perfectness of Claw-Free Planar Graphs
2563 -- 2574Zhaoping Meng. Doubly Resolvable H Designs
2575 -- 2589Seongmin Ok, R. Bruce Richter, Carsten Thomassen. Liftings in Finite Graphs and Linkages in Infinite Graphs with Prescribed Edge-Connectivity
2591 -- 2624David Pegrímek, Petr Gregor. Hamiltonian Laceability of Hypercubes Without Isometric Subgraphs
2625 -- 2641Alexey E. Rastegin. Notes on use of Generalized Entropies in Counting