Journal: Graphs and Combinatorics

Volume 31, Issue 6

1819 -- 1820Atsuhiro Nakamoto, Katsuhiro Ota, Akira Saito. Preface
1821 -- 1831Susan A. van Aardt, Alewyn P. Burger, Marietjie Frick, Arnfried Kemnitz, Ingo Schiermeyer. Hypohamiltonian Oriented Graphs of All Possible Orders
1833 -- 1839Noga Alon. Size and Degree Anti-Ramsey Numbers
1841 -- 1853Sejeong Bang, Jack H. Koolen, Jongyook Park. Some Results on the Eigenvalues of Distance-Regular Graphs
1855 -- 1865Marco Buratti, Graham J. Lovegrove, Tommaso Traetta. On the Full Automorphism Group of a Hamiltonian Cycle System of Odd Order
1867 -- 1881Shoko Chisaki, Nobuko Miyamoto. Difference Systems of Sets with Size 2
1883 -- 1887Mikio Kano, Zheng Yan. Spanning Trees Whose Stems are Spiders
1889 -- 1904Yuki Kawasaki, Naoki Matsumoto, Atsuhiro Nakamoto. N-Flips in 4-Connected Even Triangulations on the Sphere
1905 -- 1913Arnfried Kemnitz, Massimiliano Marangio, Margit Voigt. Sum List Colorings of Wheels
1915 -- 1927Xiaonan Lu. On Affine-Invariant Two-Fold Quadruple Systems
1929 -- 1940Seiya Negami. 3-Regular Maps on Closed Surfaces are Nearly Distinguishing 3-Colorable with Few Exceptions
1941 -- 1963Jaroslav Nesetril, Patrice Ossona de Mendez. On Low Tree-Depth Decompositions
1965 -- 1972Kenta Noguchi, Yusuke Suzuki. Relationship Among Triangulations, Quadrangulations and Optimal 1-Planar Graphs
1973 -- 1984Hiroshi Nozaki. Linear Programming Bounds for Regular Graphs
1985 -- 1991Ingo Schiermeyer, Roman Soták. Rainbow Numbers for Graphs Containing Small Cycles
1993 -- 2002Barbara M. Anthony, Michael E. Picollelli. Complete r-partite Graphs Determined by their Domination Polynomial
2003 -- 2017Natacha Astromujoff, Mathieu Chapelle, Martín Matamala, Ioan Todinca, José Zamora. Injective Colorings with Arithmetic Constraints
2019 -- 2028Martin Baca, Yasir Bashir, Muhammad Faisal Nadeem, Ayesha Shabbir. On Super Edge-Antimagicness of Circulant Graphs
2029 -- 2036Sheng Bau, Naoki Matsumoto, Atsuhiro Nakamoto, Lijuan Zheng. Minor Relations for Quadrangulations on the Sphere
2037 -- 2042Sheng Bau, Benjamin van Niekerk, David White. An Intermediate Value Theorem for the Decycling Numbers of Toeplitz Graphs
2043 -- 2074Henning Bruhn, Oliver Schaudt. The Journey of the Union-Closed Sets Conjecture
2075 -- 2086Rong Chen, Matt DeVos, Daryl Funk, Irene Pivotto. Graphical Representations of Graphic Frame Matroids
2087 -- 2102Wei-Guo Chen, Zhi-Hong Chen. Fan-Type Conditions for Spanning Eulerian Subgraphs
2103 -- 2111Zhi-Hong Chen, Miaomiao Han, Hong-Jian Lai, Mingquan Zhan. Graphs with a 3-Cycle-2-Cover
2113 -- 2124Guantao Chen, Songling Shan. Characterizing Forbidden Pairs for Hamiltonian Squares
2125 -- 2136Xiaodong Chen, MingChu Li, Xin Ma. Vertex Pancyclicity of Quadrangularly Connected Claw-free Graphs
2137 -- 2147Charles J. Colbourn. Augmentation of Covering Arrays of Strength Two
2149 -- 2158Charles B. Crane. Generalized Pancyclic Properties in Claw-free Graphs
2159 -- 2173Aseem Dalal, C. A. Rodger. The Total Chromatic Number of Complete Multipartite Graphs with Low Deficiency
2175 -- 2180Peter Dankelmann. On the Number of Resolving Pairs in Graphs
2181 -- 2191Peter J. Dukes, Alan C. H. Ling. Graph Divisible Designs and Packing Constructions
2193 -- 2200Qiong Fan, Chunxiang Wang. 2
2201 -- 2205Michitaka Furuya, Shoichi Tsuchiya. Claw-Free and N(2, 1, 0)-Free Graphs are Almost Net-Free
2207 -- 2214Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros. Π-Kernels in Digraphs
2215 -- 2230Yusuke Higuchi, Iwao Sato. A Balanced Signed Digraph
2231 -- 2259Xueliang Li, Yaping Mao. On Extremal Graphs with at Most ℓ Internally Disjoint Steiner Trees Connecting Any n-1 Vertices
2261 -- 2274Shuchao Li, Yibing Song, HuiHui Zhang. On the Degree Distance of Unicyclic Graphs with Given Matching Number
2275 -- 2292Wei Liao, MingChu Li. [r, s, t]-Colorings of Friendship Graphs and Wheels
2293 -- 2297Changhong Lu, Kan Wang, Xingxing Yu. On Tight Components and Anti-Tight Components
2299 -- 2308Leila Maherani, G. R. Omidi, Ghaffar Raeisi, Maryam Shahsiah. On Three-Color Ramsey Number of Paths
2309 -- 2317Thomas Mahoney, Charles Tomlinson, Jennifer Wise. Families of Online Sum-Choice-Greedy Graphs
2319 -- 2334Snjezana Majstorovic, Gilles Caporossi. Bounds and Relations Involving Adjusted Centrality of the Vertices of a Tree
2335 -- 2345Dirk Meierling, Dieter Rautenbach. ℓ-free Graphs
2347 -- 2356Farokhlagha Moazami, Nasrin Soltankhah. On the Biclique Cover of the Complete Graph
2357 -- 2367R. Pandiyaraj, S. Francis Raj, H. P. Patil. On Indicated Coloring of Graphs
2369 -- 2376Zdenek Ryjácek, Liming Xiong, Jun Yin. Closure and Hamilton-Connected Claw-Free Hourglass-Free Graphs
2377 -- 2380Tadashi Sakuma. On the Balanced Decomposition Number
2381 -- 2400Elzbieta Sidorowicz. The Relaxed Game Chromatic Number of Graphs with Cut-Vertices
2401 -- 2412Martin Sonntag, Hanns-Martin Teichert. Some Results on Exclusive Sum Labelings of Hypergraphs
2413 -- 2423Andrea Vietri. A New Zero-divisor Graph Contradicting Beck's Conjecture, and the Classification for a Family of Polynomial Quotients
2425 -- 2435Andrea Vietri. An Analogy Between Edge Colourings and Differentiable Manifolds, with a New Perspective on 3-Critical Graphs
2437 -- 2446Yali Wu, Yongqi Sun, Rui Zhang, Stanislaw P. Radziszowski. 4 versus Wheels and Stars
2447 -- 2457Xiaoxia Zhang, Xiangwen Li. 3-Connectivity of Wreath Product of Graphs
2459 -- 2465Yanbo Zhang, Guofei Zhou, Yaojun Chen. All Complete Graph-Wheel Planar Ramsey Numbers
2467 -- 2479Yanbo Zhang, Hajo Broersma, Yaojun Chen. Three Results on Cycle-Wheel Ramsey Numbers
2481 -- 2491Hongtao Zhao, Qingde Kang. Large Sets of Almost Hamilton Cycle and Path Decompositions of Complete Bipartite Graphs

Volume 31, Issue 5

1107 -- 1116Ron Aharoni, Eli Berger, Philipp Sprüssel. Two Disjoint Independent Bases in Matroid-Graph Pairs
1117 -- 1124Marcin Anholcer, Sylwia Cichacz. 4
1125 -- 1136Marcin Anholcer, Sylwia Cichacz, Iztok Peterin, Aleksandra Tepeh. Distance Magic Labeling and Two Products of Graphs
1137 -- 1153Aubin Arroyo, Isabel Hubard, Klavdija Kutnar, Eugenia O'Reilly Regueiro, Primoz Sparl. Classification of Symmetric Tabačjn Graphs
1155 -- 1161Jernej Azarija. Tutte Polynomials and a Stronger Version of the Akiyama-Harary Problem
1163 -- 1176Camino Balbuena, Adriana Hansberg, Teresa W. Haynes, Michael A. Henning. Total Domination Edge Critical Graphs with Total Domination Number Three and Many Dominating Pairs
1177 -- 1187Tomás Bálint, Július Czap. Facial Parity 9-Edge-Coloring of Outerplane Graphs
1189 -- 1209Michael D. Barrus, Stephen G. Hartke, Mohit Kumbhat. Non-minimal Degree-Sequence-Forcing Triples
1211 -- 1221Matthias Beck, Mela Hardin. A Bivariate Chromatic Polynomial for Signed Graphs
1223 -- 1247Youssef Boudabbous, Pierre Ille, Bertrand Jouve, Abdeljelil Salhi. Critically Twin Primitive 2-Structures
1249 -- 1262Andreas Brandstädt, Raffaele Mosca. Maximum Weight Independent Sets in Odd-Hole-Free Graphs Without Dart or Without Bull
1263 -- 1270Bostjan Bresar, Douglas F. Rall. On Cartesian Products Having a Minimum Dominating Set that is a Box or a Stairway
1271 -- 1287Javier Cano, Alfredo García Olaverri, Ferran Hurtado, Toshinori Sakai, Javier Tejel, Jorge Urrutia. Blocking the k-Holes of Point Sets in the Plane
1289 -- 1310Nanyuan Cao, Kejun Chen, Yong Zhang. Existence of Yang Hui Type Magic Squares
1311 -- 1324Walter Carballosa, Ana Portilla, José M. Rodríguez, Jose Maria Sigarreta. Planarity and Hyperbolicity in Graphs
1325 -- 1334James M. Carraher, Thomas Mahoney, Gregory J. Puleo, Douglas B. West. Sum-Paintability of Generalized Theta-Graphs
1335 -- 1346László Csirmaz, Péter Ligeti, Gábor Tardos. Erdős-Pyber Theorem for Hypergraphs and Secret Sharing
1347 -- 1357Ratko Darda, Ademir Hujdurovic. On Bounds for the Product Irregularity Strength of Graphs
1359 -- 1365Ali Dehghan, Mohammad-Reza Sadeghi, Arash Ahadi. On the Complexity of Deciding Whether the Regular Number is at Most Two
1367 -- 1380Chaim Even-Zohar, Nati Linial. A Note on the Inducibility of 4-Vertex Graphs
1381 -- 1396Washiela Fish. Binary Codes and Partial Permutation Decoding Sets from the Johnson Graphs
1397 -- 1401Michitaka Furuya, Masaru Kamada, Kenta Ozeki. The Existence of Semi-colorings in a Graph
1403 -- 1422Natalia Garcia-Colin, David G. Larman. Projective Equivalences of k-neighbourly Polytopes
1423 -- 1436Xianya Geng, Shuna Hu, Shuchao Li. Permanental Bounds of the Laplacian Matrix of Trees with Given Domination Number
1437 -- 1452Sathish Govindarajan, Abhijeet Khopkar. On Locally Gabriel Geometric Graphs
1453 -- 1462Michael A. Henning, Sandi Klavzar, Douglas F. Rall. Total Version of the Domination Game
1463 -- 1471Anne Berry, Andreas Brandstädt, Konrad Engel. The Dilworth Number of Auto-Chordal Bipartite Graphs
1473 -- 1485Zhen-Mu Hong, Yi-Zheng Fan. The Signless Laplacian or Adjacency Spectral Radius of Bicyclic Graphs with Given Number of Cut Edges
1487 -- 1496Robert Janczewski, Krzysztof Turowski. The Backbone Coloring Problem for Bipartite Backbones
1497 -- 1505Ying-li Kang, Yingqian Wang. Distance Constraints on Short Cycles for 3-Colorability of Planar graphs
1507 -- 1516Gyula O. H. Katona, Dániel T. Nagy. Union-Intersecting Set Systems
1517 -- 1530Takefumi Kondo, Tetsu Toyoda. Uniform Estimates of Nonlinear Spectral Gaps
1531 -- 1538Xiangwen Li. Group Chromatic Number of Halin Graphs
1539 -- 1554Ruijuan Li, Xinhong Zhang, Qiaoping Guo. Generalizing Vertex Pancyclic and k-ordered Graphs
1555 -- 1566Jiaao Li, Xinmin Hou, Zhen-Mu Hong, Xiaofeng Ding. Parity Subgraphs with Few Common Edges and Nowhere-Zero 5-Flow
1567 -- 1588Jeremy Lyle. A Structural Approach for Independent Domination of Regular Graphs
1589 -- 1611Jeremy L. Martin, Jennifer D. Wagner. On the Spectra of Simplicial Rook Graphs
1613 -- 1628Dragan Masulovic. Towards the Characterization of Finite Homomorphism-Homogeneous Oriented Graphs with Loops
1629 -- 1636Lorenz Minder, Thomas Sauerwald, Sven-Ake Wegner. Asymptotic Bounds on the Equilateral Dimension of Hypercubes
1637 -- 1648Mustafa Mohamad, David Rappaport, Godfried Toussaint. Minimum Many-to-Many Matchings for Computing the Distance Between Two Sequences
1649 -- 1658Raffaele Mosca, Paolo Nobili. Polynomial Time Recognition of Essential Graphs Having Stability Number Equal to Matching Number
1659 -- 1677Kenta Ozeki, Takeshi Sugiyama. 1, k+1-Free Graphs
1679 -- 1688Kenta Ozeki. A Toughness Condition for a Spanning Tree With Bounded Total Excesses
1689 -- 1702Oliver Schaudt, Vera Weil. On Bounding the Difference of the Maximum Degree and the Clique Number
1703 -- 1714Nidhi Sehgal, C. A. Rodger. *)
1715 -- 1725Tay-Woei Shyu. Decomposition of Complete Bipartite Digraphs and Complete Digraphs into Directed Paths and Directed Cycles of Fixed Even Length
1727 -- 1737Yingzhi Tian, Jixiang Meng. Restricted Connectivity for Some Interconnection Networks
1739 -- 1754Runli Tian, Liming Xiong. The Chvátal-Erdős Condition for a Graph to Have a Spanning Trail
1755 -- 1764Huijuan Wang, Bin Liu 0009, Jianliang Wu. Total Coloring of Planar Graphs Without Chordal Short Cycles
1765 -- 1777Xiumei Wang, Weiping Shang, Jinjiang Yuan. On Graphs with a Unique Perfect Matching
1779 -- 1787Wei Wang 0052, Baoyindureng Wu, Zhidan Yan, Nini Xue. A Weaker Version of a Conjecture on List Vertex Arboricity of Graphs
1789 -- 1793Guanghui Wang, Guiying Yan. An Improved Upper Bound on Edge Weight Choosability of Graphs
1795 -- 1805Bing Xue, Liancui Zuo, Guojun Li. Coloring the Square of Sierpiński Graphs
1807 -- 1814Zhidan Yan, Wei Wang, Nini Xue. On Improperly Chromatic-Choosable Graphs
1815 -- 1818Gexin Yu. Strong edge-colorings for k-degenerate graphs

Volume 31, Issue 4

805 -- 811S. Akbari, M. Ghanbari, K. Ozeki. The Chromatic Index of a Claw-Free Graph Whose Core has Maximum Degree 2
813 -- 825M. Atapour, Seyed Mahmoud Sheikholeslami, Lutz Volkmann. Global Roman Domination in Trees
827 -- 832Jiansheng Cai. List Edge Coloring of Planar Graphs Without Non-Induced 6-Cycles
833 -- 869Nelson Castañeda, Ivan S. Gotchev. Path Coverings with Prescribed Ends in Faulty Hypercubes
871 -- 883Tsz Lung Chan. Contractible and Removable Edges in 3-Connected Infinite Graphs
885 -- 896Guantao Chen, Yinkui Li, Haicheng Ma, Tingzeng Wu, Liming Xiong. An Extension of the Chvátal-Erdős Theorem: Counting the Number of Maximum Independent Sets
897 -- 914Jessica Chen, Le Chen, Derrick Liu. Intersections of Cycles in k-Connected Graphs
915 -- 926Alfredo Donno. Generalized Wreath Products of Graphs and Groups
927 -- 939Stefan Felsner, William T. Trotter, Veit Wiechert. The Dimension of Posets with Planar Cover Graphs
941 -- 952Daniel Gray. Bounds on Superpatterns Containing all Layered Permutations
953 -- 974Michael A. Henning. Total Dominator Colorings and Total Domination in Graphs
975 -- 992Mirko Hornák, Davide Mazza, Norma Zagaglia Salvi. Edge Colorings of the Direct Product of Two Graphs
993 -- 1001Mingfang Huang, Xiangwen Li. Group Connectivity and Matchings
1003 -- 1018Robert Jajcay, Roman Nedela. Half-Regular Cayley Maps
1019 -- 1028Patric R. J. Östergård, Ville H. Pettersson. Exhaustive Search for Snake-in-the-Box Codes
1029 -- 1041Hortensia Galeana-Sánchez, Rocio Sanchez-Lopez. An Extension of Richardson's Theorem in m-Colored Digraphs
1043 -- 1052Ioan Tomescu, Sana Javed. Extremal Bicyclic 3-Chromatic Graphs
1053 -- 1063G. R. Vijayakumar. Uniquely Derived Generalized Line Graphs and Uniquely Represented Signed Graphs with Least Eigenvalues ≥ -2
1065 -- 1076Fan Yang, Xiangwen Li. 3 line graphs
1077 -- 1084Sherry H. F. Yan, Yaqiu Zhang. On Lattice Paths with Four Types of Steps
1085 -- 1106Mingchao Zhang, Song Luo, Maiko Shigeno. 6-Saturated Graph

Volume 31, Issue 3

497 -- 506Saieed Akbari, Dariush Kiani, Fatemeh Mohammadi, Somayeh Moradi, Farhad Rahmati. An Algebraic Criterion for the Choosability of Graphs
507 -- 522Richard A. Brualdi, Hwa Kyung Kim. Completions of Alternating Sign Matrices
523 -- 535Marco Buratti, Tommaso Traetta. The Structure of 2-Pyramidal 2-Factorizations
537 -- 545Fatih Demirkale, Diane Donovan, Charles Curtis Lindner. Intersection Problem for Simple 2-fold (3n, n, 3) Group Divisible Designs
547 -- 550Edward Dobson, Joy Morris. Quotients of CI-Groups are CI-Groups
551 -- 575Rosena R. X. Du, Fu Liu. Factorizations of Cycles and Multi-Noded Rooted Trees
577 -- 583Andrzej Dudek, Michael Ferrara. Extensions of Results on Rainbow Hamilton Cycles in Uniform Hypergraphs
585 -- 599Zsolt Fekete, Tibor Jordán, Viktória E. Kaszanitzky. Rigid Two-Dimensional Frameworks with Two Coincident Points
601 -- 613Shinya Fujita, Michitaka Furuya, Colton Magnant. General Bounds on Rainbow Domination Numbers
615 -- 628Hortensia Galeana-Sánchez, Ingrid Torres-Ramos. H-Paths and H-Cycles in H-Coloured Digraphs
629 -- 638David Galvin. Counting Colorings of a Regular Graph
639 -- 648Jessie D. Jamieson, Anant Godbole, William B. Jamieson, Lucia Petito. Sharp Concentration of Hitting Size for Random Set Systems
649 -- 667Binlong Li, Bo Ning, Hajo Broersma, Shenggui Zhang. Characterizing Heavy Subgraph Pairs for Pancyclicity
669 -- 677Huiqiu Lin, Yuan Hong, Jinlong Shu. Some Relations Between the Eigenvalues of Adjacency, Laplacian and Signless Laplacian Matrix of a Graph
679 -- 712Allan Lo, Klas Markström. F-Factors in Hypergraphs Via Absorption
713 -- 727Houcine Boumediene Merouane, Mohammed Haddad, Mustapha Chellali, Hamamache Kheddouci. Dominated Colorings of Graphs
729 -- 741Michel Mollard, Mark Ramras. Edge Decompositions of Hypercubes by Paths and by Cycles
743 -- 755Emlee W. Nicholson, Bing Wei. Degree Sum Condition for k-ordered Hamiltonian Connected Graphs
757 -- 770Lydia Ostermeier, Peter F. Stadler. The Grid Property and Product-Like Hypergraphs
771 -- 782Monika Pilsniak, Mariusz Wozniak. On the Total-Neighbor-Distinguishing Index by Sums
783 -- 793Hua Wang. Centroid, Leaf-centroid, and Internal-centroid
795 -- 804Junlei Zhu, Yuehua Bu, Xiao Min. Equitable List-Coloring for C 5-Free Plane Graphs Without Adjacent Triangles

Volume 31, Issue 2

319 -- 320Evangelos Kranakis. Introduction to the Special Issue: Combinatorics and Geometry
321 -- 333Oswin Aichholzer, Luis Evaristo Caraballo, José Miguel Díaz-Báñez, Ruy Fabila Monroy, C. Ochoa, P. Nigsch. Characterization of Extremal Antipodal Polygons
335 -- 345Oswin Aichholzer, Thomas Hackl, Alexander Pilz, Pedro Ramos 0001, Vera Sacristán, Birgit Vogtenhuber. Empty Triangles in Good Drawings of the Complete Graph
347 -- 360Jin Akiyama, Hyunwoo Seong. A Criterion for a Pair of Convex Polygons to be Reversible
361 -- 392Greg Aloupis, Luis Barba, Jean-Lou De Carufel, Stefan Langerman, Diane L. Souvaine. Isoperimetric Enclosures
393 -- 405Jurek Czyzowicz, Stefan Dobrev, Benson L. Joeris, Evangelos Kranakis, Danny Krizanc, Ján Manuch, Oscar Morales Ponce, Jaroslav Opatrny, Ladislav Stacho, Jorge Urrutia. Monitoring the Plane with Rotating Radars
407 -- 425Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth. Geometric Biplane Graphs I: Maximal Graphs
427 -- 452Alfredo García Olaverri, Ferran Hurtado, Matias Korman, Inês Matos, Maria Saumell, Rodrigo I. Silveira, Javier Tejel, Csaba D. Tóth. Geometric Biplane Graphs II: Graph Augmentation
453 -- 465Benson L. Joeris, Isabel Urrutia, Jorge Urrutia. Geometric Spanning Cycles in Bichromatic Point Sets
467 -- 476Luis Montejano, Tudor Zamfirescu. When is a Disk Trapped by Four Lines?
477 -- 495János Pach, Gábor Tardos. Cross-Intersecting Families of Vectors

Volume 31, Issue 1

1 -- 22Douglas Bauer, Hajo Broersma, Johan H. C. van den Heuvel, Nathan Kahl, A. Nevo, Edward F. Schmeichel, Douglas R. Woodall, M. Yatauro. Best Monotone Degree Conditions for Graph Properties: A Survey
23 -- 34Tatjana M. Aleksic, Miroslav Petrovic. Cacti Whose Spread is Maximal
35 -- 57Victor Alvarez. Parity-Constrained Triangulations with Steiner Points
59 -- 72Milica Andelic, Domingos M. Cardoso. Spectral Characterization of Families of Split Graphs
73 -- 90Cristina Bazgan, Cédric Bentz, Christophe Picouleau, Bernard Ries. Blockers for the Stability Number and the Chromatic Number
91 -- 98Matthias Beck, Daniel Blado, Joseph Crawford, Taïna Jean-Louis, Michael Young. On Weak Chromatic Polynomials of Mixed Graphs
99 -- 113Roman Cada, Shuya Chiba, Kiyoshi Yoshimoto. 2-Factors in Claw-Free Graphs with Lower Bounds Cycle Lengths
115 -- 125Hortensia Galeana, Ricardo Strausz. On Panchromatic Digraphs and the Panchromatic Number
127 -- 130Greg Gamble, Jamie Simpson. Symmetric Difference-Free and Symmetric Difference-Closed Collections of Sets
131 -- 140András Gyárfás, Gábor N. Sárközy, Stanley M. Selkow. Coverings by Few Monochromatic Pieces: A Transition Between Two Ramsey Problems
141 -- 147Xueliang Li, Sujuan Liu. Rainbow Connection Number and the Number of Blocks
149 -- 167Lan Lin, Yixun Lin. New Classes of Extremal Graphs with Given Bandwidth
169 -- 181Shengxiang Lv. The Largest Demigenus Over All Signatures on K 3, n
183 -- 200Martín Manrique, S. Arumugam. Vertex and Edge Dimension of Hypergraphs
201 -- 219Naoki Matsumoto. Transitions of Hexangulations on the Sphere
221 -- 233Zhaohong Niu, Liming Xiong. On Traceable Line Graphs
235 -- 242Lale Özkahya, Brendon Stanton. On a Covering Problem in the Hypercube
243 -- 254Chengfu Qin, Xiaofeng Guo, Kiyoshi Ando. The Removable Edges and the Contractible Subgraphs of 5-Connected Graphs
255 -- 264Andrew V. Sills, Hua Wang. The Minimal Number of Subtrees of a Tree
265 -- 280Michael Stiebitz, Zsolt Tuza, Margit Voigt. Orientations of Graphs with Prescribed Weighted Out-Degrees
281 -- 298Teruhisa Sugimoto. Convex Pentagons for Edge-to-Edge Tiling, II
299 -- 307Olivia X. M. Yao, Ernest X. W. Xia. Two Formulas of 2-Color Off-Diagonal Rado Numbers
309 -- 318Xiu-Mei Zhang, Xiao-Dong Zhang. The Minimal Number of Subtrees with a Given Degree Sequence