default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 339
Volume 339, Number 1, January 2016
- Samantha Dahlberg, Robert Dorward, Jonathan Gerhard, Thomas Grubb, Carlin Purcell, Lindsey Reppuhn, Bruce E. Sagan:
Set partition patterns and statistics. 1-16 - Qiaoping Guo, Linan Cui, Wei Meng:
Cycles through an arc in regular 3-partite tournaments. 17-20 - Wei Li, Huangsheng Yu, Dianhua Wu:
Bounds and constructions for optimal (n, {3, 5}, Λa, 1, Q)-OOCs. 21-32 - Peter Dankelmann
, Dirk Meierling:
Maximally edge-connected hypergraphs. 33-38 - Yiqiao Wang:
An improved upper bound on the linear 2-arboricity of planar graphs. 39-45 - Andrey Grinshpun, Gábor N. Sárközy:
Monochromatic bounded degree subgraph partitions. 46-53 - Stefan O. Tohaneanu:
Projective duality of arrangements with quadratic logarithmic vector fields. 54-61 - Xiaowei Yu, Cunquan Qu, Guanghui Wang, Yiqiao Wang:
Adjacent vertex distinguishing colorings by sum of sparse graphs. 62-71 - Ayineedi Venkateswarlu, Santanu Sarkar:
On acyclic edge-coloring of the complete bipartite graphs K2p-1, 2p-1 for odd prime p. 72-77 - Seyed Amin Seyed Fakhari:
Intersecting faces of a simplicial complex via algebraic shifting. 78-83 - Sylwia Cichacz, Dalibor Froncek:
Distance magic circulant graphs. 84-94 - Ewa Drgas-Burchardt, Kamila Kowalska, Jerzy Michael, Zsolt Tuza:
Some properties of vertex-oblique graphs. 95-102 - Martin Knor, Maryam Verdian-Rizi:
Hyperbolic analogues of fullerenes with face-types (6, 9) and (6, 10). 103-108 - John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
The Robber Locating game. 109-117 - Jason P. Smith:
Intervals of permutations with a fixed number of descents are shellable. 118-126 - Joe Sawada, Aaron Williams, Dennis Wong:
A surprisingly simple de Bruijn sequence construction. 127-131 - Jian-Hua Yin:
A note on packing of graphic n-tuples. 132-137 - Guangzhou Chen, Haiyan Chen, Kejun Chen, Wen Li:
Regular sparse anti-magic squares with small odd densities. 138-156 - Ebrahim Ghorbani, Ali Mohammadian, Behruz Tayfeh-Rezaie:
Integral trees with given nullity. 157-164 - Gasper Fijavz, Atsuhiro Nakamoto:
Odd complete minors in even embeddings on surfaces. 165-178 - Hengming Zhao, Rongcun Qin:
Combinatorial constructions for optimal multiple-weight optical orthogonal signature pattern codes. 179-193 - Jonathan Bloom, Oliver Pechenik, Dan Saracino:
Proofs and generalizations of a homomesy conjecture of Propp and Roby. 194-206 - Kiyoshi Ando:
Some degree and forbidden subgraph conditions for a graph to have a k-contractible edge. 207-216 - Aleksander Misiak, Zofia Stepien, Alicja Szymaszkiewicz, Lucjan Szymaszkiewicz, Maciej Zwierzchowski:
A note on the no-three-in-line problem on a torus. 217-221 - Frank Gurski, Stefan Neidig, Eda Yilmaz:
Neighbourhood-width of trees. 222-226 - Markus Kuba, Alois Panholzer:
Combinatorial families of multilabelled increasing trees and hook-length formulas. 227-254 - Antonio José Ferreira Gomes Jr., Manoel Lemos:
The number of elements belonging to triads in 3-connected binary matroids. 255-262 - Ugur Odabasi, Sibel Özkan:
The Hamilton-Waterloo Problem with C4 and Cm factors. 263-269 - Pietro Codara, Ottavio M. D'Antona:
Generalized Fibonacci and Lucas cubes arising from powers of paths and cycles. 270-282 - George E. Andrews, Aviezri S. Fraenkel, James A. Sellers:
m-ary partitions with no gaps: A characterization modulo m. 283-287 - Liping Yuan, Carol T. Zamfirescu, Tudor I. Zamfirescu:
Dissecting the square into five congruent parts. 288-298 - Ying-li Kang, Ligang Jin, Yingqian Wang:
The 3-colorability of planar graphs without cycles of length 4, 6 and 9. 299-307 - Huan Xiong:
On the largest size of (t, t+1, ..., t+p)-core partitions. 308-317 - David S. Herscovici:
Using error-correcting codes to construct solvable pebbling distributions. 318-326 - Stephen W. Drury, Huiqiu Lin:
Colorings and spectral radius of digraphs. 327-332 - István Tomon:
Improved bounds on the partitioning of the Boolean lattice into chains of equal size. 333-343 - Adel Alahmadi, Safa Alsulami, Rola Hijazi, Patrick Solé:
Isodual cyclic codes over finite fields of odd characteristic. 344-353 - Alessandro Maddaloni, Carol T. Zamfirescu:
A cut locus for finite graphs and the farthest point mapping. 354-364 - Cristina G. Fernandes, César Hernández-Vélez, Orlando Lee, José Coelho de Pina:
Spanning trees with nonseparating paths. 365-374 - Pu Gao:
On the geometric Ramsey numbers of trees. 375-381 - Rongquan Feng, Meng Zhao, Liwei Zeng:
Constructions of -designs from orthogonal geometry over finite fields. 382-390 - Julien Bensmail, Aurélie Lagoutte, Petru Valicov:
Strong edge-coloring of (3, Δ)-bipartite graphs. 391-398 - Xiaoyu He:
Zero-sum subsequences of length kq over finite abelian p-groups. 399-407
Volume 339, Number 2, February 2016
- Dean Crnkovic, Nina Mostarac, Sanja Rukavina:
Self-dual codes from quotient matrices of symmetric divisible designs with the dual property. 409-414 - Cunsheng Ding, Chunlei Li, Nian Li, Zhengchun Zhou:
Three-weight cyclic codes and their weight distributions. 415-427 - Noga Alon, Omri Ben-Eliezer:
Local and global colorability of graphs. 428-442 - L. Sunil Chandran, Rogers Mathew, Deepak Rajendraprasad:
Upper bound on cubicity in terms of boxicity for graphs of low chromatic number. 443-446 - A. G. Chegini, Morteza Hasanvand, Ebadollah S. Mahmoodian, Farokhlagha Moazami:
The square chromatic number of the torus. 447-456 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
On self-clique graphs with triangular cliques. 457-459 - Abidin Kaya, Bahattin Yildiz:
Various constructions for self-dual codes over rings and new binary self-dual codes. 460-469 - Maarten De Boeck, Leo Storme, Andrea Svob:
The Cameron-Liebler problem for sets. 470-474 - Seyed Saeed Changiz Rezaei, Chris D. Godsil:
Entropy of symmetric graphs. 475-483 - Huyile Liang, Lili Mu, Yi Wang:
Catalan-like numbers and Stieltjes moment sequences. 484-488 - Mitre Costa Dourado, Rodolfo Alves de Oliveira, Fábio Protti, Dieter Rautenbach:
On the geodetic iteration number of distance-hereditary graphs. 489-498 - Christopher Cox, Derrick Stolee:
Ordered Ramsey numbers of loose paths and matchings. 499-505 - Chuanqi Xiao, Haiyan Chen:
Kekulé structures of square-hexagonal chains and the Hosoya index of caterpillar trees. 506-510 - Vito Napolitano:
On quasi-Hermitian varieties in. 511-514 - Kazuki Kumegawa, Tatsuya Maruta:
Nonexistence of some Griesmer codes over Fq. 515-521 - Da-Wei Yang, Yan-Quan Feng, Jia-Li Du:
Pentavalent symmetric graphs of order 2pqr. 522-532 - Claudson F. Bornstein, José Wilson Coura Pinto, Dieter Rautenbach, Jayme Luiz Szwarcfiter:
Forbidden induced subgraphs for bounded p-intersection number. 533-538 - Xing Peng:
The Ramsey number of generalized loose paths in hypergraphs. 539-546 - Marcelo Henriques de Carvalho, C. H. C. Little:
A characterization of minimal non-Seymour graphs. 547-559 - Aaron Robertson, Caitlin Cremin, Will Daniel, Quer Xiang:
Intermingled ascending wave m-sets. 560-563 - Chaoping Pei, Yusheng Li:
Ramsey numbers involving a long path. 564-570 - G. Eric Moorhouse, Jason Williford:
Double covers of symplectic dual polar graphs. 571-588 - Nacho López, Josep M. Miret, Cèsar Fernández:
Non existence of some mixed Moore graphs of diameter 2 using SAT. 589-596 - Michel Surmacs:
Weakly quasi-Hamiltonian-connected multipartite tournaments. 597-605 - Michael D. Barrus, John Sinkovic:
Uniqueness and minimal obstructions for tree-depth. 606-613 - Anna Galluccio, Claudio Gentile:
The stable set polytope of icosahedral graphs. 614-625 - Igor Fabrici, Stanislav Jendrol', Michaela Vrbjarová:
Facial entire colouring of plane graphs. 626-631 - Trygve Johnsen, Jan Roksvold, Hugues Verdure:
A generalization of weight polynomials to matroids. 632-645 - Cheng Yeaw Ku, Kok Bin Wong:
A non-trivial intersection theorem for permutations with fixed number of cycles. 646-657 - Gabriela Araujo-Pardo, Geoffrey Exoo, Robert Jajcay:
Small bi-regular graphs of even girth. 658-667 - Károly Bezdek, Balázs Szalkai, István Szalkai:
On contact numbers of totally separable unit sphere packings. 668-676 - Akira Saito, Kazuki Sano:
Spanning trees homeomorphic to a small tree. 677-681 - Anton Bernshteyn, Alexandr V. Kostochka:
On the number of edges in a graph with no (k+1)-connected subgraphs. 682-688 - Richard A. Moy, David Rolnick:
Novel structures in Stanley sequences. 689-698 - Andrii Arman, David S. Gunderson, Sergei Tsaturian:
Triangle-free graphs with the maximum number of cycles. 699-711 - Vladimir P. Korzhik:
Auxiliary embeddings and constructing triangular embeddings of joins of complete graphs with edgeless graphs. 712-720 - Luis A. Goddyn, Tony Huynh, Tanmay Deshpande:
On Hilbert bases of cuts. 721-728 - Mikio Kano, Kenta Ozeki, Masao Tsugaki, Guiying Yan:
m-dominating k-trees of graphs. 729-736 - Jack H. Koolen, Greg Markowsky:
A collection of results concerning electric resistance and simple random walk on distance-regular graphs. 737-744 - Kolja B. Knauer, Torsten Ueckerdt:
Three ways to cover a graph. 745-758 - Rajendra M. Pawale, Mohan S. Shrikhande, Shubhada M. Nyayate:
Non-derivable strongly regular graphs from quasi-symmetric designs. 759-769 - Hyeong-Seok Lim, Hee-Chul Kim, Jung-Heum Park:
Ore-type degree conditions for disjoint path covers in simple graphs. 770-779 - Stanislav Jendrol', Mária Maceková, Mickaël Montassier, Roman Soták:
Optimal unavoidable sets of types of 3-paths for planar graphs of given girth. 780-789 - Peter J. Dukes, Tao Feng, Alan C. H. Ling:
Matching divisible designs with block size four. 790-799 - Nicolas Lichiardopol:
Triangle-free oriented graphs and the traceability conjecture. 800-803 - Yuanyuan Liu, Mingwei Nie:
The existence spectrum for large sets of pure Hybrid triple systems. 804-812 - Manuel González Sarabia, Carlos Rentería-Márquez:
Generalized Hamming weights and some parameterized codes. 813-821 - Rong Pan, Yanxun Chang:
A note on difference matrices over non-cyclic finite abelian groups. 822-830 - Hiranmoy Pal, Bikash Bhattacharjya:
Perfect state transfer on NEPS of the path on three vertices. 831-838 - Ararat Harutyunyan, Reza Naserasr, Mirko Petrusevski, Riste Skrekovski, Qiang Sun:
Mapping planar graphs into the Coxeter graph. 839-849 - Aimei Yu, Jianping Liu, Miaomiao Han, Hong-Jian Lai:
On dense strongly Z2s-1-connected graphs. 850-856 - Cheyu Lin, Xuding Zhu:
Circular total chromatic numbers of graphs. 857-865 - Marie Albenque, Kolja Knauer:
Convexity in partial cubes: The hull number. 866-876 - Stefaan De Winter, M. Korb:
Weak isometries of the Boolean cube. 877-885 - Ming Chen, Yingqian Wang, Peipei Liu, Jinghan Xu:
Planar graphs without cycles of length 4 or 5 are (2, 0, 0)-colorable. 886-905 - Michael E. Hoffman:
Updown categories: Generating functions and universal covers. 906-922 - Oleg V. Borodin, Anna O. Ivanova:
Low stars in normal plane maps with minimum degree 4 and no adjacent 4-vertices. 923-930 - Iva Antoncic, Primoz Sparl:
Classification of quartic half-arc-transitive weak metacirculants of girth at most 4. 931-945 - Simone Costa:
On MPS construction of blocking sets in projective spaces: A generalization. 946-956 - Yan Zhu, Eiichi Bannai, Etsuko Bannai:
Tight relative 2-designs on two shells in Johnson association schemes. 957-973 - Fumihiko Nakano, Taizo Sadahiro:
A generalization of carries process and riffle shuffles. 974-991 - Runrun Liu, Xiangwen Li, Gexin Yu:
Planar graphs without 5-cycles and intersecting triangles are (1, 1, 0)-colorable. 992-1003 - Alex Eustis, Michael A. Henning, Anders Yeo:
Independence in 5-uniform hypergraphs. 1004-1027 - Ashok Kumar Das, Sandip Das, Malay K. Sen:
Forbidden substructure for interval digraphs/bigraphs. 1028-1051 - Ali Mohammadian:
A generalization of the odd-girth theorem. 1052-1057 - Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Characterizing forbidden pairs for rainbow connection in graphs with minimum degree 2. 1058-1068
Volume 339, Number 3, March 2016
- Hengjia Wei, Gennian Ge:
Uniformly resolvable designs with block sizes 3 and 4. 1069-1085 - Abidin Kaya, Bahattin Yildiz, Abdullah Pasa:
New extremal binary self-dual codes from a modified four circulant construction. 1086-1094 - Rebecca Patrias, Pavlo Pylyavskyy:
Combinatorics of K-theory via a K-theoretic Poirier-Reutenauer bialgebra. 1095-1115 - Maciej Dziemianczuk:
On directed lattice paths with vertical steps. 1116-1139 - Yanhong Zhu, Wenqin Xu, Shaofei Du, Xuesong Ma:
On the orientably-regular embeddings of graphs of order prime-cube. 1140-1146 - Vindya Bhat, Vojtech Rödl:
A short proof of the induced Ramsey Theorem for hypergraphs. 1147-1149 - Denis S. Krotov, Ivan Yu. Mogilnykh, Vladimir N. Potapov:
To the theory of q-ary Steiner and other-type trades. 1150-1157 - Georgios Tzanakis, Lucia Moura, Daniel Panario, Brett Stevens:
Constructing new covering arrays from LFSR sequences over finite fields. 1158-1171 - Tri Lai:
A generalization of Aztec diamond theorem, part II. 1172-1179 - Michael Dorfling, Johannes H. Hattingh, Elizabeth Jonck:
Total domination in maximal outerplanar graphs II. 1180-1188 - László Hegedüs, Benedek Nagy:
On periodic properties of circular words. 1189-1197
Volume 339, Number 4, April 2016
- Jean-Luc Baril, Richard Genestier, Alain Giorgetti, Armen Petrossian:
Rooted planar maps modulo some patterns. 1199-1205 - Simeon Ball, Valentina Pepe:
Forbidden subgraphs in the norm graph. 1206-1211 - Hua Wang, Shuai Yuan:
On the sum of squares of degrees and products of adjacent degrees. 1212-1220 - Florent Foucaud, Michael A. Henning:
Location-domination and matching in cubic graphs. 1221-1231 - Yair Caro, Josef Lauri, Christina Zarb:
Selective hypergraph colourings. 1232-1241 - Zepeng Li, Enqiang Zhu, Zehui Shao, Jin Xu:
Size of edge-critical uniquely 3-colorable planar graphs. 1242-1250 - Seog-Jin Kim, Boram Park:
Coloring the square of graphs whose maximum average degree is less than 4. 1251-1260 - Ali Mohammadian, Vilmar Trevisan:
Some spectral properties of cographs. 1261-1264