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

Volume 32, Issue 5

1641 -- 1650Anna Adamaszek, Michal Adamaszek, Matthias Mnich, Jens M. Schmidt. Lower Bounds for Locally Highly Connected Graphs
1651 -- 1665Méziane Aïder, Sylvain Gravier, Souad Slimani. Relaxed Locally Identifying Coloring of Graphs
1667 -- 1673Omer Angel, Igor Shinkar. A Tight Upper Bound on Acquaintance Time of Graphs
1675 -- 1688Esther Banaian, Steve Butler, Christopher Cox, Jeffrey Davis, Jacob Landgraf, Scarlitte Ponce. Counting Prime Juggling Patterns
1689 -- 1697Michael D. Barrus, Grant Molnar. Graphs with the Strong Havel-Hakimi Property
1699 -- 1705Douglas Bauer, A. Nevo, Edward F. Schmeichel. Vertex Arboricity and Vertex Degrees
1707 -- 1721Julien Bensmail, Gabriel Renault. Decomposing Oriented Graphs into Six Locally Irregular Oriented Graphs
1723 -- 1730Jason I. Brown, Aysel Erey. On the Real Roots of σ -Polynomials
1731 -- 1747Gerard J. Chang, Sheng-Hua Chen, Chun-Hung Liu. Edge Roman Domination on Graphs
1749 -- 1761Herman Z. Q. Chen, Sergey Kitaev, Brian Y. Sun. Word-Representability of Face Subdivisions of Triangular Grid Graphs
1763 -- 1771Huiwen Cheng, Mohsen Ghasemi, Sha Qiao. Tetravalent Vertex-Transitive Graphs of Order Twice A Prime Square
1773 -- 1788Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya. 5
1789 -- 1803Aleksandr Yu. Chirkov, Nikolai Yu. Zolotykh. On the Number of Irreducible Points in Polyhedra
1805 -- 1816Zachary Cohn, Anant Godbole, Elizabeth Wright Harkness, Yiguang Zhang. The Number of Seymour Vertices in Random Tournaments and Digraphs
1817 -- 1828Charles B. Crane. 5-Free Graphs
1829 -- 1841Jiuying Dong, Xueliang Li. Rainbow Connection Number and Independence Number of a Graph
1843 -- 1850Adrian W. Dudek. On the Spectrum of the Generalised Petersen Graphs
1851 -- 1871Thibault Espinasse, Paul Rochet. Relations Between Connected and Self-Avoiding Hikes in Labelled Complete Digraphs
1873 -- 1879Hortensia Galeana-Sánchez, Mika Olsen. A Characterization of Locally Semicomplete CKI-digraphs
1881 -- 1901Rim Ben Hamadou, Youssef Boudabbous, Nadia El Amri, Gérard Lopez. Description of the Tournaments Which are Reconstructible from Their k-cycle Partial Digraphs for k ∈ {3, 4}
1903 -- 1913Guoliang Hao, Jianguo Qian. On the Rainbow Domination Number of Digraphs
1915 -- 1930Takehiro Hasegawa, Seiken Saito. On graph theory Mertens' theorems
1931 -- 1944Volker Kaibel, Jon Lee, Matthias Walter, Stefan Weltge. Extended Formulations for Independence Polytopes of Regular Matroids
1945 -- 1963William L. Kocay. A Note on Non-reconstructible 3-Hypergraphs
1965 -- 1978Elena V. Konstantinova, Alexey Medvedev. Independent Even Cycles in the Pancake Graph and Greedy Prefix-Reversal Gray Codes
1979 -- 1999Tri Lai. A Generalization of Aztec Dragons
2001 -- 2008Ruonan Li, Bo Ning, Shenggui Zhang. Color Degree Sum Conditions for Rainbow Triangles in Edge-Colored Graphs
2009 -- 2018Hongliang Lu, Qinglin Yu. Generalization of Matching Extensions in Graphs (IV): Closures
2019 -- 2028Rong Luo, Zhengke Miao, Yue Zhao. Hamiltonian Cycles in Critical Graphs with Large Maximum Degree
2029 -- 2045T. H. Marshall. 11 P 11 -Coloring of Oriented Graphs
2047 -- 2051Jens Maßberg. The Union-Closed Sets Conjecture for Small Families
2053 -- 2077Ragnar Nevries, Christian Rosenke. Towards a Characterization of Leaf Powers by Clique Arrangements
2079 -- 2092Malgorzata Prazmowska, Krzysztof Prazmowski. Binomial partial Steiner triple systems containing complete graphs
2093 -- 2120Yunior Ramírez-Cruz, Alejandro Estrada-Moreno, Juan Alberto Rodríguez-Velázquez. The Simultaneous Metric Dimension of Families Composed by Lexicographic Product Graphs
2121 -- 2134M. A. Shalu, T. P. Sandhya. Star Coloring of Graphs with Girth at Least Five
2135 -- 2144Pablo Spiga. Constructing Half-Arc-Transitive Graphs of Valency Four with Prescribed Vertex Stabilizers
2145 -- 2158Martin Trinks. A Survey on Recurrence Relations for the Independence Polynomial of Hypergraphs
2159 -- 2170H. Yu, D. Wu, H. Zhang. The Existence of Irrational Diagonally Ordered Magic Squares
2171 -- 2181Shaohua Zhang, Jin Yan, Suyun Jiang. Vertex-Disjoint Cycles Containing Specified Vertices in a Bipartite Graph
2183 -- 2197Roberta R. Zhou, Wenchang Chu. Identities on Extended Catalan Numbers and Their q-Analogs

Volume 32, Issue 4

1249 -- 1262József Balogh, John Lenz. Hypergraphs with Zero Chromatic Threshold
1263 -- 1278Gabriel A. Barragán-Ramírez, Juan A. Rodríguez-Velázquez. The Local Metric Dimension of Strong Product Graphs
1279 -- 1291Adam Bland. Monochromatic Sinks in k-Arc Colored Tournaments
1293 -- 1311Simona Bonvicini, Giuseppe Mazzuoccolo. Edge-Colorings of 4-Regular Graphs with the Minimum Number of Palettes
1313 -- 1327Bostjan Bresar, Sandi Klavzar, Douglas F. Rall. Packing Chromatic Number of Base-3 Sierpiński Graphs
1329 -- 1337Junqing Cai, Hao Li. Hamilton Cycles in Implicit 2-Heavy Graphs
1339 -- 1352Konrad Kazimierz Dabrowski, Vadim V. Lozin, Dominique de Werra, Victor Zamaraev. Combinatorics and Algorithms for Augmenting Graphs
1353 -- 1374Fatih Demirkale, Diane Donovan, Joanne L. Hall, Abdollah Khodkar, Asha Rao. Difference Covering Arrays and Pseudo-Orthogonal Latin Squares
1375 -- 1388Aras Erzurumluoglu, Christopher A. Rodger. Fair 1-Factorizations and Fair Holey 1-Factorizations of Complete Multipartite Graphs
1389 -- 1395Manuel Fendler, Daniel Grieser. A New Simple Proof of the Aztec Diamond Theorem
1397 -- 1413Chin-Mei Fu, Kuo-Ching Huang, Miwako Mishima. Decomposition of Complete Bipartite Graphs into Cycles of Distinct Even Lengths
1415 -- 1421Yuping Gao, Guanghui Wang, Jian-Liang Wu. A Relaxed Case on 1-2-3 Conjecture
1423 -- 1446Xijuan Hu, Yanxun Chang, Tao Feng. Group Divisible Packings and Coverings with Any Minimum Leave and Minimum Excess
1447 -- 1460T. Karthick, Frédéric Maffray. Vizing Bound for the Chromatic Number on Some Graph Classes
1461 -- 1472Seog-Jin Kim, Boram Park. Coloring of the Square of Kneser Graph K(2k+r, k)
1473 -- 1488Zuosong Liang, Erfang Shan, Liying Kang. Clique-Coloring Claw-Free Graphs
1489 -- 1494Changhong Lu, Chao Wang, Kan Wang. Upper Bounds for the Paired-Domination Numbers of Graphs
1495 -- 1504Xuanlong Ma, Min Feng, Kaishun Wang. The Rainbow Connection Number of the Power Graph of a Finite Group
1505 -- 1519Reza Naserasr, Sagnik Sen, Qiang Sun. Walk-Powers and Homomorphism Bounds of Planar Signed Graphs
1521 -- 1544Christos Pelekis. Bernoulli Trials of Fixed Parity, Random and Randomly Oriented Graphs
1545 -- 1570Peter Rowley, David Ward. On π-Product Involution Graphs in Symmetric Groups
1571 -- 1583Iwao Sato. A New Proof of a Formula for the Bartholdi Zeta Function of a Digraph
1585 -- 1597Pranjali Sharma, Mukti Acharya. Balanced Signed Total Graphs of Commutative Rings
1599 -- 1610Haichao Wang, Erfang Shan, Yancai Zhao. 3-Factor-Criticality in Double Domination Edge Critical Graphs
1611 -- 1620Jingjing Yao, Xiaowei Yu, Guanghui Wang, Changqing Xu. Neighbor Sum (Set) Distinguishing Total Choosability of d-Degenerate Graphs
1621 -- 1633Jianghua Zhang, Laihao Ding, Guanghui Wang, Guiying Yan, Shan Zhou. 4-Minor Free Graphs
1635 -- 1640Huanhua Zhao, Xuding Zhu. (2+ϵ)-Nonrepetitive List Colouring of Paths

Volume 32, Issue 3

851 -- 859Yves Aubry, Jean-Christophe Godin, Olivier Togni. Free Choosability of Outerplanar Graphs
861 -- 880Csaba Biró, Peter Hamburger, Attila Pór, William T. Trotter. Forcing Posets with Large Dimension to Contain Large Standard Examples
881 -- 886Emily Chizmar, Colton Magnant, Pouria Salehi Nowbandegani. Note on Semi-Linkage with Almost Prescribed Lengths in Large Graphs
887 -- 901Peter Czimmermann. Generalisations of Hypomorphisms and Reconstruction of Hypergraphs
903 -- 912Fatih Demirkale, Diane M. Donovan, Selda Küçükçifçi, Emine Sule Yazici. Orthogonal Trades and the Intersection Problem for Orthogonal Arrays
913 -- 921Ted Dobson. On Isomorphisms of Marušič-Scapellato Graphs
923 -- 942Adrian Dumitrescu, Maarten Löffler, André Schulz 0001, Csaba D. Tóth. Counting Carambolas
943 -- 961Danny Dyer, Sadegheh Haghshenas, Nabil Shalaby. Constructing the Spectrum of Packings and Coverings for the Complete Graph with Stars with up to Five Edges
963 -- 986Ralph J. Faudree, Jenö Lehel, Kiyoshi Yoshimoto. Locating Pairs of Vertices on a Hamiltonian Cycle in Bigraphs
987 -- 996Johannes H. Hattingh, Osama A. Saleh, Lucas C. van der Merwe, Terry J. Walters. Nordhaus-Gaddum Results for the Induced Path Number of a Graph When Neither the Graph Nor Its Complement Contains Isolates
997 -- 1012Mirko Hornák, Stanislav Jendrol, Ingo Schiermeyer. On the Maximum Weight of a Sparse Connected Graph of Given Order and Size
1013 -- 1025Adam King, Amanda Laubmeier, Kai Orans, Anant Godbole. Universal and Overlap Cycles for Posets, Words, and Juggling Patterns
1027 -- 1038Daniel Kotlar. Distance Magic Labeling in Complete 4-partite Graphs
1039 -- 1054Tri Lai. Generating Function of the Tilings of an Aztec Rectangle with Holes
1055 -- 1064Richard Lang. A Note on Total and List Edge-Colouring of Graphs of Tree-Width 3
1065 -- 1075Yanting Liang, Hong-Jian Lai, Rong Luo, Rui Xu. Extendability of Contractible Configurations for Nowhere-Zero Flows and Modulo Orientations
1077 -- 1100Yuanyuan Liu. A Completion of the Spectrum for the Overlarge Sets of Pure Mendelsohn Triple Systems
1101 -- 1116T. H. Marshall. An Oriented 6-Coloring of Planar Graphs with Girth at Least 9
1117 -- 1124Diogo Kendy Matsumoto, Atsuhiko Mizusawa. A Construction of Smooth Travel Groupoids on Finite Graphs
1125 -- 1135Bo Ning, Shenggui Zhang, Binlong Li. Solution to a Problem on Hamiltonicity of Graphs Under Ore- and Fan-Type Heavy Subgraph Conditions
1137 -- 1153Jakub Przybylo, Jens Schreyer, Erika Skrabul'áková. On the Facial Thue Choice Number of Plane Graphs Via Entropy Compression Method
1155 -- 1166Nader Jafari Rad, Lutz Volkmann. Edge-Removal and Edge-Addition in α-Domination
1167 -- 1185Mustazee Rahman. Percolation with Small Clusters on Random Graphs
1187 -- 1202Rebecca J. Stones, Sheng Lin, Xiaoguang Liu, Gang Wang. On Computing the Number of Latin Rectangles
1203 -- 1216Yunfang Tang, Tsai-Lien Wong, Xuding Zhu. Total Weight Choosability of Cone Graphs
1217 -- 1227Lutz Volkmann. Signed Roman k-domination in Digraphs
1229 -- 1247Chenxiao Xue, Carl Yerger. Optimal Pebbling on Grids

Volume 32, Issue 2

431 -- 451Oswin Aichholzer, Gabriela Araujo-Pardo, Natalia García-Colín, Thomas Hackl, D. Lara, C. Rubio-Montiel, Jorge Urrutia. Geometric Achromatic and Pseudoachromatic Indices
453 -- 461Maria Axenovich, Enrica Cherubini, Torsten Ueckerdt. Spectrum of Mixed Bi-uniform Hypergraphs
463 -- 494Leah Wrenn Berman, Glenn G. Chappell, Jill R. Faudree, John G. Gimbel, Chris Hartman. Uniquely Tree-saturated Graphs
495 -- 510Benjamin Bond. EKR Sets for Large n and r
511 -- 519Csilla Bujtás, Sandi Klavzar. Improved Upper Bounds on the Domination Number of Graphs With Minimum Degree at Least Five
521 -- 531Marco Buratti, Peter Danziger. A Cyclic Solution for an Infinite Class of Hamilton-Waterloo Problems
533 -- 542Carl Johan Casselgren, Roland Häggkvist. Coloring Complete and Complete Bipartite Graphs from Random Lists
543 -- 552Nicholas J. Cavenagh, Vaipuna Raass. Critical Sets of Full n-Latin Squares
553 -- 558Zhi-Hong Chen. A Twelve Vertex Theorem for 3-Connected Claw-Free Graphs
559 -- 581Yassine Daadaa, Asif Jamshed, Mudassir Shabbir. Network Decontamination with a Single Agent
583 -- 627Guoli Ding, Stan Dziobiak. Excluded-Minor Characterization of Apex-Outerplanar Graphs
629 -- 638Hortensia Galeana-Sánchez, Rocío Sánchez-López. Richardson's Theorem in H-coloured Digraphs
639 -- 647David Galvin. Asymptotic Normality of Some Graph Sequences
649 -- 662Shoni Gilboa, Yehuda Roditty. Anti-Ramsey Numbers of Graphs with Small Connected Components
663 -- 684Marisa Gutierrez, Silvia B. Tondato. On Models of Directed Path Graphs Non Rooted Directed Path Graphs
685 -- 705Zhiquan Hu, Shunzhe Zhang. 1, 2, 3}-free graph is Hamilton-connected
707 -- 712Sogol Jahanbekam, Douglas B. West. Rainbow Spanning Subgraphs of Small Diameter in Edge-Colored Complete Graphs
713 -- 720Wei Jin, Weijun Liu, Chang Qun Wang. Finite 2-Geodesic Transitive Abelian Cayley Graphs
721 -- 732Philip Lafrance, Ortrud R. Oellermann, Timothy Pressey. Generating and Enumerating Digitally Convex Sets of Trees
733 -- 739Binlong Li, Ingo Schiermeyer. On Star-Wheel Ramsey Numbers
741 -- 744Hao Li, Weihua He, Weihua Yang, Yandong Bai. A Note on Edge-Disjoint Hamilton Cycles in Line Graphs
745 -- 772Jesper M. Møller, Gesche Nord. Chromatic Polynomials of Simplicial Complexes
773 -- 776Suil O, Douglas B. West. Cubic Graphs with Large Ratio of Independent Domination Number to Domination Number
777 -- 784Jiangmin Pan, Zhaohong Huang. Edge-Transitive Regular Metacyclic Covers of the Petersen Graph
785 -- 799Teruhisa Sugimoto. Convex Pentagons for Edge-to-Edge Tiling, III
801 -- 811Jan H. van Vuuren. Edge Criticality in Graph Domination
813 -- 822Brian C. Wagner. 6n+1
823 -- 833Jun Yin, Liming Xiong, Haixing Zhao. Hamiltonian Claw-Free Graphs and o-Heavy Graphs Involving Induced Cycles
835 -- 850Ping Zhao, Kefeng Diao, Fuliang Lu. More Result on the Smallest One-Realization of a Given Set

Volume 32, Issue 1

1 -- 15Ron Aharoni, János Barát, Ian M. Wanless. Multipartite Hypergraphs Achieving Equality in Ryser's Conjecture
17 -- 29Marzieh Amooshahi, Bijan Taeri. On Cayley Sum Graphs of Non-Abelian Groups
31 -- 47Amanda Cameron, Dillon Mayhew. Excluded Minors for Matroids Satisfying Kinser's Inequalities
49 -- 63Yair Caro, Raphael Yuster. On Zero-Sum and Almost Zero-Sum Subgraphs Over ℤ
65 -- 77Fugang Chao, Han Ren, Ni Cao. Finding Shorter Cycles in a Weighted Graph
79 -- 92Mustapha Chellali, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae. A Roman Domination Chain
93 -- 101Jonas Eckert, Felix Joos, Dieter Rautenbach. The Cycle Spectrum of Claw-free Hamiltonian Graphs
103 -- 110Yoshimi Egawa, Mikio Kano, Zheng Yan. (1, f)-Factors of Graphs with Odd Property
111 -- 121Mark N. Ellingham, Emily A. Marshall. Criticality of Counterexamples to Toroidal Edge-Hamiltonicity
123 -- 131Hortensia Galeana-Sánchez, Mika Olsen. CKI-Digraphs, Generalized Sums and Partitions of Digraphs
133 -- 146Gary Gordon, Jennifer McNulty, Nancy Ann Neudauer. Fixing Numbers for Matroids
147 -- 160Terry S. Griggs, Thomas A. McCourt. Biembeddings of Symmetric n-Cycle Systems
161 -- 174Annika Heckel, Oliver Riordan. On the threshold for rainbow connection number r in random graphs
175 -- 190Michael A. Henning, Lutz Volkmann. Signed Roman k-Domination in Graphs
191 -- 198Hsiang-Chun Hsu, Gerard Jennhwa Chang. Max-Coloring of Vertex-Weighted Graphs
199 -- 223Shanmugasundaram Jeevadoss, Appu Muthusamy. Decomposition of Product Graphs into Paths and Cycles of Length Four
225 -- 240Viktória E. Kaszanitzky, Csaba Király. On Minimally Highly Vertex-Redundantly Rigid Graphs
241 -- 256Jaromy Kuhl, Michael W. Schroeder. Completing Partial Latin Squares with Blocks of Non-empty Cells
257 -- 269Imre Leader, Ta Sheng Tan. Connected Colourings of Complete Graphs and Hypergraphs
271 -- 278Hongchuan Lei, Hung-Lin Fu. The Hamilton-Waterloo Problem for Triangle-Factors and Heptagon-Factors
279 -- 295Binlong Li, Bo Ning, Shenggui Zhang. Long Paths and Cycles Passing Through Specified Vertices Under the Average Degree Condition
297 -- 310Yuanyuan Liu. The Existence Spectrum for Overlarge Sets of Pure Hybrid Triple Systems
311 -- 321Zhengke Miao, Xiaofeng Wang, Cun-Quan Zhang. Hamilton Circuits and Essential Girth of Claw Free Graphs
323 -- 332Juan José Montellano-Ballesteros, Eduardo Rivera-Campo. On Heterochromatic Out-directed Spanning Trees in Tournaments
333 -- 350Anita Pasotti, Marco Antonio Pellegrini. A Generalization of the Problem of Mariusz Meszka
351 -- 361Yuqin Sun, Xingxing Yu. On a Coloring Conjecture of Hajós
363 -- 376Fan Wang, Heping Zhang. Small Matchings Extend to Hamiltonian Cycles in Hypercubes
377 -- 402Yan Wang, Chunxiang Wang. t-Critical Graphs
403 -- 417Jesse T. Williams, Xiangqian Zhou. A New Proof for a Result of Kingan and Lemos'
419 -- 429Fan Yang, Xiangwen Li, Liangchen Li. 3-Connectivity with Independent Number 2