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