Journal: Graphs and Combinatorics

Volume 30, Issue 6

1325 -- 1349Richard P. Anstee, Christina Koch, Miguel Raggi, Attila Sali. Forbidden Configurations and Product Constructions
1351 -- 1361Dan Archdeacon. Steiner Triple Systems, Pinched Surfaces, and Complete Multigraphs
1363 -- 1382Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy. Rainbow Connection Number of Graph Power and Graph Products
1383 -- 1397Jason Brown, Ortrud R. Oellermann. Graphs with a Minimal Number of Convex Sets
1399 -- 1416Yair Caro, Michael A. Henning. Simultaneous Domination in Graphs
1417 -- 1425Gérard D. Cohen, Emanuela Fachini, János Körner. Connector Families of Graphs
1427 -- 1452Maciej Dziemianczuk. Counting Lattice Paths With Four Types of Steps
1453 -- 1461Xiaofeng Gu, Hong-Jian Lai, Ping Li, Senmei Yao. Characterizations of Strength Extremal Graphs
1463 -- 1467Martin Hall, Colton Magnant, Hua Wang. Note on Enomoto and Ota's Conjecture for Short Paths in Large Graphs
1469 -- 1477Rafal Kalinowski, Mariusz Wozniak. Edge-Distinguishing Index of a Graph
1479 -- 1497S. R. Kingan, Manoel Lemos. A Decomposition Theorem for Binary Matroids with no Prism Minor
1499 -- 1511Xiaoling Ma, Elkin Vumar. Neighborhood Union Conditions for Hamiltonicity of P 3-Dominated Graphs
1513 -- 1527John Vincent S. Morales, Arlene A. Pascasio. An Action of the Tetrahedron Algebra on the Standard Module for the Hamming Graphs and Doob Graphs
1529 -- 1549Oktay Olmez, Sung Y. Song. Some Families of Directed Strongly Regular Graphs Obtained from Certain Finite Incidence Structures
1551 -- 1563Eminjan Sabir, Elkin Vumar. Spanning Connectivity of the Power of a Graph and Hamilton-Connected Index of a Graph
1565 -- 1586Noah Streib, William T. Trotter. Hamiltonian Cycles and Symmetric Chains in Boolean Lattices
1587 -- 1591Tomás Vetrík. Abelian Cayley Graphs of Given Degree and Diameter 2 and 3
1593 -- 1605Stephan G. Wagner, Hua Wang. Indistinguishable Trees and Graphs
1607 -- 1614Yingqiu Yang, Liang Sun. Contractible Edges in k-Connected Graphs with Some Forbidden Subgraphs
1615 -- 1620Jianhua Yin, Rong Luo, Guodong Guo. Graphic Sequences with an A-Connected Realization

Volume 30, Issue 5

1065 -- 1072Eyal Ackerman, Noa Nitzan, Rom Pinchasi. The Maximum Number of Edges in Geometric Graphs with Pairwise Virtually Avoiding Edges
1073 -- 1086Deepak Bal, Patrick Bennett, Andrzej Dudek, Alan M. Frieze. The t-Tone Chromatic Number of Random Graphs
1087 -- 1098Tomasz Bartnicki, Bartlomiej Bosek, Sebastian Czerwinski, Jaroslaw Grytczuk, Grzegorz Matecki, Wiktor Zelazny. Additive Coloring of Planar Graphs
1099 -- 1122Qiuju Bian, Ronald J. Gould, Paul Horn, Susan Janiszewski, Steve La Fleur, Paul Wrayno. 3-Connected {K 1, 3, P 9}-Free Graphs are Hamiltonian-Connected
1123 -- 1133Changjiang Bu, Jiang Zhou, Hongbo Li, Wenzhe Wang. Spectral Characterizations of the Corona of a Cycle and Two Isolated Vertices
1135 -- 1147Lyes Dekar, Brice Effantin, Hamamache Kheddouci. [r, s, t]-Colorings of Graph Products
1149 -- 1162Yoshimi Egawa, Michitaka Furuya. Forbidden Triples Containing a Complete Graph and a Complete Bipartite Graph of Small Order
1163 -- 1173Qiaoping Guo, Shengjia Li, Hongwei Li, Huiling Zhao. The Number of Out-Pancyclic Vertices in a Strong Tournament
1175 -- 1181Johannes H. Hattingh, Ernst J. Joubert. Some Bistar Bipartite Ramsey Numbers
1183 -- 1192Chang-Xiang He, Min Zhou. A Sharp Upper Bound on the Least Signless Laplacian Eigenvalue Using Domination Number
1193 -- 1205Sho Kato, Ryuichi Mori, Atsuhiro Nakamoto. Quadrangulations on 3-Colored Point Sets with Steiner Points and Their Winding Numbers
1207 -- 1221Sergey Kitaev, Anna de Mier. Enumeration of Fixed Points of an Involution on β(1, 0)-Trees
1223 -- 1232M. A. Ollis, Devin Willmott. There are Infinitely Many Williams Squares with Circular Structure and Order a Multiple of 4
1233 -- 1248Kelly J. Pearson, Tan Zhang. On Spectral Hypergraph Theory of the Adjacency Tensor
1249 -- 1260Dmitry A. Shabanov. Coloring Non-uniform Hypergraphs Without Short Cycles
1261 -- 1269Runli Tian, Liming Xiong, Zhaohong Niu. On Hamiltonicity of 3-Connected Claw-Free Graphs
1271 -- 1282Yue-Li Wang, Jun-Lin Guo, Cheng-Huang Hung, Hung-Chang Chan. Circuits of Each Length in Tournaments
1283 -- 1299Guangjun Xu, Sanming Zhou. Hamiltonicity of 3-Arc Graphs
1301 -- 1318Landang Yuan, Yanli Zhang, Yingtao Hou, Qingde Kang. The Spectrum Meta(H > T, λ) for Some Subgraphs H and T of K 4
1319 -- 1324Hua Zhang. A Class of Bipartite 2-Path-Transitive Graphs

Volume 30, Issue 4

783 -- 800Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Bernardo Llano, Rita Zuazua. Infinite families of 2-hypohamiltonian/2-hypotraceable oriented graphs
801 -- 819Saeed Akbari, Maryam Ghanbari, Mohammad Javad Nikmehr. The Chromatic Index of a Graph Whose Core is a Cycle of Order at Most 13
821 -- 826Saieed Akbari, Mikio Kano. {k, r - k}-Factors of r-Regular Graphs
827 -- 846Boris Aronov, Muriel Dulieu, Ferran Hurtado. Witness Rectangle Graphs
847 -- 859Arthur H. Busch, Michael Ferrara, Stephen G. Hartke, Michael S. Jacobson. A Degree Sequence Variant of Graph Ramsey Numbers
861 -- 874Min Chen, André Raspaud, Weifan Wang. Plane Graphs with Maximum Degree 6 are Edge-face 8-colorable
875 -- 885Kefeng Diao, Ping Zhao, Kaishun Wang. The Smallest One-Realization of a Given Set III
887 -- 894Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto. Note on Locating Pairs of Vertices on Hamiltonian Cycles
895 -- 908Ramiro Feria-Purón, Guillermo Pineda-Villavicencio. Constructions of Large Graphs on Surfaces
909 -- 932Michael A. Henning, Anders Yeo. Distinguishing-Transversal in Hypergraphs and Identifying Open Codes in Cubic Graphs
933 -- 947Michael Hoffmann, Csaba D. Tóth. Vertex-Colored Encompassing Graphs
949 -- 955Hengzhe Li, Xueliang Li, Yuefang Sun, Yan Zhao. Note on Minimally d-Rainbow Connected Graphs
957 -- 962Ryota Matsubara, Masao Tsugaki, Tomoki Yamashita. Closure and Spanning k-Trees
963 -- 975Giuseppe Mazzuoccolo, Beatrice Ruini. Upper Bounds for the Automorphic Chromatic Index of a Graph
977 -- 1002Cam McLeman, Erin McNicholas. Graph Invertibility
1003 -- 1011Michael D. Plummer, Tao Wang, Qinglin Yu. A Note on Cyclic Connectivity and Matching Properties of Regular Graphs
1013 -- 1036Elzbieta Sidorowicz. On the Relaxed Colouring Game and the Unilateral Colouring Game
1037 -- 1044A. A. Talebi, N. Mehdipoor. Classifying Cubic Semisymmetric Graphs of Order 18 p n
1045 -- 1054Ngo Dac Tan. On d-arc-dominated Oriented Graphs
1055 -- 1063Xiaoxia Zhang, Xiangwen Li. Maximum Degree Condition and Group Connectivity

Volume 30, Issue 3

511 -- 520Rangaswami Balakrishnan, S. Francis Raj, T. Kavaskar. b-Chromatic Number of Cartesian Product of Some Families of Graphs
521 -- 526Miklós Bóna. On a Family of Conjectures of Joel Lewis on Alternating Permutations
527 -- 547Jason I. Brown, Julia Tufts. On the Roots of Domination Polynomials
549 -- 563H. Chuang, H. J. Lai, G. R. Omidi, K. Wang, N. Zakeri. On Group Choosability of Graphs, II
565 -- 571Sylwia Cichacz. Note on Group Distance Magic Graphs G[C 4]
573 -- 579Janusz Dybizbanski, Tomasz Dzido. On Some Ramsey Numbers for Quadrilaterals Versus Wheels
581 -- 589Pu Gao. Uniform Generation of d-Factors in Dense Host Graphs
591 -- 607Tanja Gologranc, Gasper Mekis, Iztok Peterin. Rainbow Connection and Graph Products
609 -- 617R. Haas, Karen Seyffarth. The k-Dominating Graph
619 -- 626Mirko Hornák, Rafal Kalinowski, Mariusz Meszka, Mariusz Wozniak. Minimum Number of Palettes in Edge Colorings
627 -- 632Shunchang Huang, Lingsheng Shi. Packing Triangles in K 4-Free Graphs
633 -- 646Nicholas Korpelainen, Vadim V. Lozin, Colin Mayhill. Split Permutation Graphs
647 -- 660Tomer Kotek, James Preen, Peter Tittmann. Subset-Sum Representations of Domination Polynomials
661 -- 669Tatjana Gerzen. An NP-Completeness Result of Edge Search in Graphs
671 -- 685Jaromy Kuhl, Hannah Hinojosa. Avoiding Pairs of Partial Latin Squares
687 -- 698Jinbo Li, Guizhen Liu, Guanghui Wang. Fractional f-Edge Cover Chromatic Index of Graphs
699 -- 705Fengxia Liu, Zhao Zhang, Jixiang Meng. The Size of Maximally Irregular Graphs and Maximally Irregular Triangle-Free Graphs
707 -- 716Zoran S. Pucanovic, Zoran Z. Petrovic. Toroidality of Intersection Graphs of Ideals of Commutative Rings
717 -- 728Nader Jafari Rad, Joanna Raczek. Some Progress on Total Bondage in Graphs
729 -- 742Hans Raj Tiwary, Khaled M. Elbassioni. Self-Duality of Polytopes and its Relations to Vertex Enumeration and Graph Isomorphism
743 -- 753Jichang Wu, Hajo Broersma, Haiyan Kang. Removable Edges and Chords of Longest Cycles in 3-Connected Graphs
755 -- 767Bing Xue, Liancui Zuo, Guanghui Wang, Guojun Li. The Linear t-Colorings of Sierpiński-Like Graphs
769 -- 781Xiaoxia Zhang, Xiangwen Li. The Chvátal-Erdös Condition for Group Connectivity in Graphs

Volume 30, Issue 2

255 -- 266Dan Archdeacon, Terry S. Griggs, Costas Psomas. Representing Graphs in Steiner Triple Systems
267 -- 274Ben Barber. Maximum Hitting for n Sufficiently Large
275 -- 285Manu Basavaraju, L. Sunil Chandran, Deepak Rajendraprasad, Arunselvan Ramaswamy. Rainbow Connection Number and Radius
287 -- 301Adam Bohn. Chromatic Polynomials of Complements of Bipartite Graphs
303 -- 314Flavia Bonomo, Mario Valencia-Pabon. On the Minimum Sum Coloring of P 4-Sparse Graphs
315 -- 342Elena A. Caffarelli, Denise M. Halverson, Ryan J. Jensen. The Steiner Problem on Surfaces of Revolution
343 -- 352Pablo De Caria, Marisa Gutierrez. Special Eccentric Vertices for the Class of Chordal Graphs and Related Classes
353 -- 364Ross Churchley, Jing Huang. Solving Partition Problems with Colour-Bipartitions
365 -- 375Louis Esperet, András Gyárfás, Frédéric Maffray. List-Coloring Claw-Free Graphs with Small Clique Number
377 -- 388Maxfield Leidner. A Larger Family of Planar Graphs that Satisfy the Total Coloring Conjecture
389 -- 393Allan Lo, Ta Sheng Tan. A Note on Large Rainbow Matchings in Edge-coloured Graphs
395 -- 410Vadim V. Lozin, Martin Milanic, Christopher Purcell. Graphs Without Large Apples and the Maximum Weight Independent Set Problem
411 -- 427Xiuwen Ma, Zihong Tian. The Existence of FrGBT D(4, g u )′ s
429 -- 437Haruhide Matsuda, Kenta Ozeki, Tomoki Yamashita. Spanning Trees with a Bounded Number of Branch Vertices in a Claw-Free Graph
439 -- 453Pascal Ochem, Alexandre Pinlou. Oriented Coloring of Triangle-Free Planar Graphs and 2-Outerplanar Graphs
455 -- 470Pawel Pralat. Graphs with Average Degree Smaller Than $${\frac {30}{11}}$$ Burn Slowly
471 -- 477Makoto Ueno, Shinsei Tazawa. Enumeration of Bipartite Self-Complementary Graphs
479 -- 493Ligong Wang, Guopeng Zhao, Ke Li. Seidel Integral Complete r-Partite Graphs
495 -- 499Rui Xu. Strong 5-Cycle Double Covers of Graphs
501 -- 510Weihua Yang, Hong-Jian Lai, Hao Li, Xiaofeng Guo. Collapsible Graphs and Hamiltonicity of Line Graphs

Volume 30, Issue 1

1 -- 46Ronald J. Gould. Recent Advances on the Hamiltonian Problem: Survey III
47 -- 69Oswin Aichholzer, Thomas Hackl, Michael Hoffmann, Alexander Pilz, Günter Rote, Bettina Speckmann, Birgit Vogtenhuber. Plane Graphs with Parity Constraints
71 -- 81Maria Axenovich, JiHyeok Choi, Michelle A. Lastrina, T. McKay, J. Smith, B. Stanton. On the Chromatic Number of Subsets of the Euclidean Plane
83 -- 100Isma Bouchemakh, Mohamed Zemir. On the Broadcast Independence Number of Grid Graph
101 -- 108Travis G. Buck, Anant P. Godbole. Size-Maximal Symmetric Difference-Free Families of Subsets of [n]
109 -- 118Shubo Chen, Weijun Liu. Extremal Zagreb Indices of Graphs with a Given Number of Cut Edges
119 -- 124Nancy E. Clarke, Samuel Fiorini, Gwenaël Joret, Dirk Oliver Theis. A Note on the Cops and Robber Game on Graphs Embedded in Non-Orientable Surfaces
125 -- 140Mirela Damian, Erik D. Demaine, Robin Y. Flatland. Unfolding Orthogonal Polyhedra with Quadratic Refinement: The Delta-Unfolding Algorithm
141 -- 157Fatih Demirkale, Emine Sule Yazici. On The Spectrum of Minimal Defining Sets of Full Designs
159 -- 170Roger B. Eggleton, Michal Morayne. A Note on Counting Homomorphisms of Paths
171 -- 181Richard Hammack, Heather Smith. Zero Divisors Among Digraphs
183 -- 195Arnfried Kemnitz, Massimiliano Marangio. d-strong Edge Colorings of Graphs
197 -- 202Mekkia Kouider. Stability Number and f-Factors in Graphs
203 -- 227Zengti Li, Eiichi Bannai, Etsuko Bannai. Tight Relative 2- and 4-Designs on Binary Hamming Association Schemes
229 -- 235Hongliang Lu, Wei Wang. On Perfect k-Matchings
237 -- 245P. Titus, K. Ganesamoorthy. The Connected Monophonic Number of a Graph
247 -- 251Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang. Some Graphs with Double Domination Subdivision Number Three
253 -- 0Haoli Wang, Xirong Xu, Yuansheng Yang, Baosheng Zhang. Erratum to: Some Graphs with Double Domination Subdivision Number Three