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 - Laura Bader, Guglielmo Lunardon:
Some remarks on the Spin Module Representation of Sp6(2e). 1265-1273 - Victoria Horan, Brett Stevens:
Locating patterns in the de Bruijn torus. 1274-1282 - T. Reeves, R. S. Farr, J. Blundell, A. Gallagher, Thomas M. A. Fink:
Eigenvalues of neutral networks: Interpolating between hypercubes. 1283-1290 - Paola Bonacini, Mario Gionfriddo, Lucia Marino:
Nesting House-designs. 1291-1299 - Nabil H. Mustafa, Saurabh Ray:
An optimal generalization of the Colorful Carathéodory theorem. 1300-1305 - Augustine O. Munagi:
Combinatorial identities for restricted set partitions. 1306-1314 - Delia Garijo, Andrew J. Goodall, Jaroslav Nesetril:
Polynomial graph invariants from homomorphism numbers. 1315-1328 - Jakayla R. Robbins, Daniel C. Slilaty, Xiangqian Zhou:
Clones in 3-connected frame matroids. 1329-1334 - Bo Ling, Bengong Lou, Jing Jian Li:
On pentavalent 1-transitive Cayley graphs. 1335-1343 - Issa Ndungo, Dinesh G. Sarvate:
GDD(n, 2, 4; λ1, λ2) with equal number of even and odd blocks. 1344-1354 - Peter Dankelmann, Michael Dorfling:
Diameter and maximum degree in Eulerian digraphs. 1355-1361 - Shi-Mei Ma, Yeong-Nan Yeh:
Enumeration of permutations by number of alternating descents. 1362-1367 - Toufik Mansour, Mark Shattuck:
Counting permutations by the number of successions within cycles. 1368-1376 - Chai Wah Wu:
Graphs whose normalized Laplacian matrices are separable as density matrices in quantum mechanics. 1377-1381 - Ilkyoo Choi, Jaehoon Kim, Suil O:
The difference and ratio of the fractional matching number and the matching number of graphs. 1382-1386 - Roman Cada, Atsushi Kaneko, Zdenek Ryjácek, Kiyoshi Yoshimoto:
Rainbow cycles in edge-colored graphs. 1387-1392 - Xin Zhang:
The edge chromatic number of outer-1-planar graphs. 1393-1399 - Kazuya Haraguchi:
On a generalization of "Eight Blocks to Madness" puzzle. 1400-1409 - A. David Christopher:
A partition-theoretic proof of Fermat's Two Squares Theorem. 1410-1411 - T. Karthick:
Weighted independent sets in a subclass of P6-free graphs. 1412-1418 - Todd Tichenor:
Bounds on graph compositions and the connection to the Bell triangle. 1419-1423
Volume 339, Number 5, May 2016
- Luis A. Goddyn, Winfried Hochstättler, Nancy Ann Neudauer:
Bicircular matroids are 3-colorable. 1425-1429 - Takuro Abe, Michael Cuntz, Hiraku Kawanoue, Takeshi Nozawa:
Non-recursive freeness and non-rigidity. 1430-1449 - Akbar Davoodi, Ramin Javadi, Behnaz Omoomi:
Pairwise balanced designs and sigma clique partitions. 1450-1458 - Maciej Gawron, Maciej Ulas:
On formal inverse of the Prouhet-Thue-Morse sequence. 1459-1470 - Simone Dantas, Celina M. H. de Figueiredo, Giuseppe Mazzuoccolo, Myriam Preissmann, Vinícius Fernandes dos Santos, Diana Sasaki:
On the total coloring of generalized Petersen graphs. 1471-1475 - T. R. Whitt III, Christopher A. Rodger:
On the embedding of partial three path designs. 1476-1481 - Amanda Folsom, Youkow Homma, Jun Hwan Ryu, Benjamin Tong:
On a general class of non-squashing partitions. 1482-1506 - Oleg V. Borodin, Anna O. Ivanova:
Weight of edges in normal plane maps. 1507-1511 - Tri Lai:
Enumeration of antisymmetric monotone triangles and domino tilings of quartered Aztec rectangles. 1512-1518 - Shanhai Li, C. A. Rodger:
Equitable block-colorings of C4-decompositions of Kv-F. 1519-1524 - Dan Hefetz, Michael Krivelevich, Wei En Tan:
Waiter-Client and Client-Waiter planarity, colorability and minor games. 1525-1536 - Samuel Connolly, Zachary Gabor, Anant P. Godbole, Bill Kay, Thomas Kelly:
Bounds on the maximum number of minimum dominating sets. 1537-1542 - Takayasu Kuwata, Hiroshi Maehara:
Another exploration problem. 1543-1550 - Malgorzata Sleszynska-Nowak:
Clique number of the square of a line graph. 1551-1556 - Nicolás Sanhueza-Matamala:
Stability and Ramsey numbers for cycles and wheels. 1557-1565 - Xiuyun Wang, Yan-Quan Feng, Jin-Xin Zhou, Jihui Wang, Qiaoling Ma:
Tetravalent half-arc-transitive graphs of order a product of three primes. 1566-1573 - Long Wang:
Characterization of graphs with given order, given size and given matching number that minimize nullity. 1574-1582 - Mikio Kano, Zheng Yan:
Spanning trees with bounded degrees and leaves. 1583-1586 - Aseem Dalal, B. S. Panda, C. A. Rodger:
Total-colorings of complete multipartite graphs using amalgamations. 1587-1592 - Jonathan Cutler, A. J. Radcliffe:
Counting dominating sets and related structures in graphs. 1593-1599 - Lianying Miao, Hong-Jian Lai, Yan-Fang Guo, Zhengke Miao:
Element deletion changes in dynamic coloring of graphs. 1600-1604 - José Neto:
On the diameter of cut polytopes. 1605-1612 - Susan G. Barwick, Wen-Ai Jackson:
Exterior splashes and linear sets of rank 3. 1613-1623 - Adel Alahmadi, André Leroy, Patrick Solé:
Long module skew codes are good. 1624-1627
Volume 339, Number 6, June 2016
- Koko K. Kayibi, Shariefuddin Pirzada:
On the activities of p-basis of matroid perspectives. 1629-1639 - Zhi-Hong Chen:
Circumferences of 3-connected claw-free graphs. 1640-1650 - Joel H. Spencer, Maksim E. Zhukovskii:
Bounded quantifier depth spectra for random graphs. 1651-1664 - Bostjan Bresar, Michael A. Henning, Douglas F. Rall:
Total dominating sequences in graphs. 1665-1676 - Natasha Komarov, Peter Winkler:
Cop vs. Gambler. 1677-1681 - Murad-ul-Islam Khan, Yi-Zheng Fan, Ying-Ying Tan:
The H-spectra of a class of generalized power hypergraphs. 1682-1689 - János Barát, András Gyárfás, Jeno Lehel, Gábor N. Sárközy:
Ramsey number of paths and connected matchings in Ore-type host graphs. 1690-1698 - Tomoki Nakamigawa:
An extremal problem for vertex partition of complete multipartite graphs. 1699-1705 - Hai Q. Dinh, Sompong Dhompongsa, Songsak Sriboonchitta:
Repeated-root constacyclic codes of prime power length over and their duals. 1706-1715 - Kamal Lochan Patra, Binod Kumar Sahoo, Bikramaditya Sahu:
Minimum size blocking sets of certain line sets related to a conic in PG(2, q). 1716-1721 - Hai-Feng Zhang, Meng Zhou, Guang-Jun Zhang:
Correction to "A study of covering dimension for the class of finite lattices" [Discrete Mathematics 338 (2015) 1096-1110]. 1722-1723 - Xin Zhang:
Equitable vertex arboricity of subcubic graphs. 1724-1726 - Samuel Zbarsky:
The maximum number of subset divisors of a given size. 1727-1733 - Noah Golowich:
The m-degenerate chromatic number of a digraph. 1734-1743 - Leonardo Silva de Lima, Vladimir Nikiforov, Carla Silva Oliveira:
The clique number and the smallest Q-eigenvalue of graphs. 1744-1752 - Andrzej Dudek, Linda M. Lesniak:
The vertex size-Ramsey number. 1753-1762 - Narda Cordero-Michel, Hortensia Galeana-Sánchez, Ilan A. Goldfeder:
Some results on the existence of Hamiltonian cycles in the generalized sum of digraphs. 1763-1770 - Gautam Appa, Reinhardt Euler, Anastasia Kouvela, Dimitris Magos, Ioannis Mourtos:
On the completability of incomplete orthogonal Latin rectangles. 1771-1794 - Miodrag Sokic:
Ramsey degrees, labeled and unlabeled partitions. 1795-1808 - Aurélie Lagoutte, Théophile Trunck:
Clique-Stable Set separation in perfect graphs with no balanced skew-partitions. 1809-1825
Volume 339, Number 7, July 2016
- Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak:
Preface. 1827 - Robert Lewon, Anna Malafiejska, Michal Malafiejski:
Strategic balance in graphs. 1837-1847 - Petros A. Petrosyan, Sargis T. Mkhitaryan:
Interval cyclic edge-colorings of graphs. 1848-1860 - Robert Lewon, Anna Malafiejska, Michal Malafiejski:
Global defensive sets in graphs. 1861-1870 - László Ozsvárt:
Counting ordered graphs that avoid certain subgraphs. 1871-1877 - Piotr Borowiecki, Michael Gentner, Christian Löwenstein, Dieter Rautenbach:
Independence in uniform linear triangle-free hypergraphs. 1878-1883 - Gyula Y. Katona, Péter G. N. Szabó:
Bounds on the number of edges in hypertrees. 1884-1891 - Marta Borowiecka-Olszewska, Ewa Drgas-Burchardt:
The deficiency of all generalized Hertz graphs and minimal consecutively non-colourable graphs in this class. 1892-1908 - Nader Jafari Rad, Elahe Sharifi, Marcin Krzywkowski:
Domination stability in graphs. 1909-1914 - Marcin Anholcer, Sylwia Cichacz, Iztok Peterin:
Spectra of graphs and closed distance magic labelings. 1915-1923 - Alejandro Estrada-Moreno, Ismael González Yero, Juan A. Rodríguez-Velázquez:
The k-metric dimension of the lexicographic product of graphs. 1924-1934 - Christoph Brause, Ingo Schiermeyer:
Kernelization of the 3-path vertex cover problem. 1935-1939 - Ingo Schiermeyer:
Chromatic number of P5-free graphs: Reed's conjecture. 1940-1943 - Izolda Gorgol:
Anti-Ramsey numbers in complete split graphs. 1944-1949 - Gülnaz Boruzanli Ekinci, Alpay Kirlangiç:
Super connectivity of Kronecker product of complete bipartite graphs and complete graphs. 1950-1953 - Jochen Harant, Samuel Mohr:
Maximum weighted induced subgraphs. 1954-1959 - Endre Boros, Nina Chiarelli, Martin Milanic:
Equistarable bipartite graphs. 1960-1969 - András Gyárfás:
Vertex covers by monochromatic pieces - A survey of results and problems. 1970-1977 - Mirko Hornák, Stanislav Jendrol', Ingo Schiermeyer:
On the maximum weight of a dense connected graph of given order and size. 1978-1984 - Csilla Bujtás, Zsolt Tuza:
The Disjoint Domination Game. 1985-1992 - Éric Sopena:
Homomorphisms and colourings of oriented graphs: An updated survey. 1993-2005
Volume 339, Number 8, August 2016
- Yutaro Yamaguchi:
Realizing symmetric set functions as hypergraph cut capacity. 2007-2017 - Jian-Hua Yin:
An extremal problem on bigraphic pairs with an A-connected realization. 2018-2026 - Jean-Florent Raymond, Ignasi Sau, Dimitrios M. Thilikos:
An edge variant of the Erdős-Pósa property. 2027-2035 - Long Wang:
Automorphisms of the zero-divisor graph of the ring of all n×n matrices over a finite field. 2036-2041 - Yanmei Hong, Qinghai Liu, Hong-Jian Lai:
Ore-type degree condition of supereulerian digraphs. 2042-2050 - Binzhou Xia, Teng Fang:
Cubic graphical regular representations of. 2051-2055 - Fen Chen, Haitao Cao:
Uniformly resolvable decompositions of Kv into K2 and K1, 3 graphs. 2056-2062 - Yandong Bai, Binlong Li, Hao Li, Weihua He:
Universal arcs in tournaments. 2063-2065 - Dominique Buset, Mourad El Amiri, Grahame Erskine, Mirka Miller, Hebert Pérez-Rosés:
A revised Moore bound for mixed graphs. 2066-2069 - Guanghui Zhang:
On the weight distributions of some cyclic codes. 2070-2078 - Alice L. L. Gao, Sergey Kitaev, Philip B. Zhang:
Avoiding vincular patterns on alternating words. 2079-2093 - Ruixia Wang, Hui Zhang:
Hamiltonian paths in k-quasi-transitive digraphs. 2094-2099 - Julie Beier, Janet Fierson, Ruth Haas, Heather M. Russell, Kara Walcher Shavo:
Classifying coloring graphs. 2100-2112 - Dennis Clemens, Tuan Tran:
Creating cycles in Walker-Breaker games. 2113-2126 - Wei Li:
Graphs whose characteristic and permanental polynomials have coefficients of the same magnitude. 2127-2135 - Aner Ben-Efraim:
Secret-sharing matroids need not be algebraic. 2136-2145 - Michael D. Barrus:
On realization graphs of degree sequences. 2146-2152 - Udo Ott:
A generalization of a cyclotomic family of partial difference sets given by Fernández-Alcober, Kwashira and Martínez. 2153-2156 - Brice Effantin, Nicolas Gastineau, Olivier Togni:
A characterization of b-chromatic and partial Grundy numbers by induced subgraphs. 2157-2167 - Christophe Crespelle, Tien-Nam Le, Kévin Perrot, Thi Ha Duong Phan:
Linearity is strictly more powerful than contiguity for encoding graphs. 2168-2177 - Ervin Györi, Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
A list version of graph packing. 2178-2185 - Ngoc Chi Lê:
Augmenting approach for some Maximum Set problems. 2186-2197
Volume 339, Number 9, September 2016
- Peter Kritzer, Harald Niederreiter:
Mixed orthogonal arrays, -nets, and -sequences. 2199-2208 - Dong-Man Heo, Jon-Lark Kim:
On some double circulant codes of Crnković and disproof of his two conjectures. 2209-2214 - Clive Elphick, Miriam Farber, Felix Goldberg, Pawel Wocjan:
Conjectured bounds for the sum of squares of positive eigenvalues of a graph. 2215-2223 - James A. Davis, Luis Martínez, Maria José Sodupe:
Bi-Cayley normal uniform multiplicative designs. 2224-2230 - John Asplund, Jessica McDonald:
On a limit of the method of Tashkinov trees for edge-colouring. 2231-2238 - Deborah Chun, Tyler Moss, Daniel C. Slilaty, Xiangqian Zhou:
Bicircular matroids representable over GF(4) or GF(5). 2239-2248 - Hrant Khachatrian, Petros A. Petrosyan:
Interval edge-colorings of complete graphs. 2249-2262 - Richard Ehrenborg, N. Bradley Fox:
The signed descent set polynomial revisited. 2263-2266 - Francesca Merola, Tommaso Traetta:
Infinitely many cyclic solutions to the Hamilton-Waterloo problem with odd length cycles. 2267-2283 - Yanbo Zhang, Hajo Broersma, Yaojun Chen:
On fan-wheel and tree-wheel Ramsey numbers. 2284-2287 - Cunsheng Ding:
A construction of binary linear codes from Boolean functions. 2288-2303 - Jan Brousek, Premysl Holub, Zdenek Ryjácek, Petr Vrána:
Finite families of forbidden subgraphs for rainbow connection in graphs. 2304-2312 - Etsuko Bannai, Ryuzaburo Noda:
Some bounds for the number of blocks III. 2313-2328 - Emily Heath, Eric Sundberg:
Economical extremal hypergraphs for the Erdős-Selfridge theorem. 2329-2344 - Christine T. Cheng, Karen L. Collins, Ann N. Trenk:
Split graphs and Nordhaus-Gaddum graphs. 2345-2356 - Xiangwen Li, Yuanyuan Liu:
Nowhere-zero 3-flows and Z3-connectivity of graphs without two forbidden subgraphs. 2357-2370 - Rudolph Lorentz, Catherine H. Yan:
Bivariate affine Gončarov polynomials. 2371-2383 - Xiaoyan Cheng, Wenbing Chen, Yuansheng Tang:
On the conjecture for the girth of the bipartite graph D(k, q). 2384-2392
Volume 339, Number 10, October 2016
- Jian Cheng, Kate J. Lorenzen, Rong Luo, Joshua C. Thompson:
A note on the size of edge-chromatic 4-critical graphs. 2393-2398 - Kassie Archer:
Descents of λ-unimodal cycles in a character formula. 2399-2409 - Matthew J. Willis:
Relating the right key to the type A filling map and minimal defining chains. 2410-2416 - Kefeng Diao, Vitaly I. Voloshin, Bing Xue, Ping Zhao:
On perfection and imperfection of one-realizations of a given set. 2417-2422 - Nicholas A. Loehr, Andrew J. Wills:
Abacus-tournament models for Hall-Littlewood polynomials. 2423-2445 - Zhengke Miao, Rui Shi, Xiaolan Hu, Rong Luo:
Adjacent vertex distinguishing total colorings of 2-degenerate graphs. 2446-2449 - Akiyoshi Tsuchiya:
The δ-vectors of reflexive polytopes and of the dual polytopes. 2450-2456 - Guanghui Wang, Guiying Yan, Xiaowei Yu:
Existence of rainbow matchings in strongly edge-colored graphs. 2457-2460 - Nicolas Gastineau, Olivier Togni:
S-packing colorings of cubic graphs. 2461-2470 - Mariusz Meszka, Roman Nedela, Alexander Rosa, Martin Skoviera:
Decompositions of complete graphs into circulants. 2471-2480 - Meng Liu, Yusheng Li:
Ramsey numbers of a fixed odd-cycle and generalized books and fans. 2481-2489 - Neil J. Y. Fan, Liao He, Teresa X. S. Li, Alina F. Y. Zhao:
The sorting index and inversion number on order ideals of permutation groups. 2490-2499 - Xiaoxia Lin, Suohai Fan, Hong-Jian Lai, Murong Xu:
On the lower bound of k-maximal digraphs. 2500-2510 - Suho Oh:
Chambers of wiring diagrams. 2511-2514 - Arijit Bishnu, Kunal Dutta, Arijit Ghosh, Subhabrata Paul:
(1, j)-set problem in graphs. 2515-2525 - Min Chen, Li Huang, Weifan Wang:
List vertex-arboricity of toroidal graphs without 4-cycles adjacent to 3-cycles. 2526-2535 - Hortensia Galeana-Sánchez, Ricardo Strausz:
On panchromatic patterns. 2536-2542 - Anton Bernshteyn:
New bounds for the acyclic chromatic index. 2543-2552 - Oleg V. Borodin, Anna O. Ivanova:
An analogue of Franklin's Theorem. 2553-2556 - Kostas Manes, Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Equivalence classes of ballot paths modulo strings of length 2 and 3. 2557-2572 - Oleg V. Borodin, Anna O. Ivanova:
The weight of faces in normal plane maps. 2573-2580 - Tao Wang:
Light subgraphs in graphs with average degree at most four. 2581-2591
Volume 339, Number 11, November 2016
- Eric Swartz:
On the covering number of symmetric groups having degree divisible by six. 2593-2604 - Mikhail Tikhomirov:
On computational complexity of length embeddability of graphs. 2605-2612 - Nazli Besharati, Luis A. Goddyn, Ebadollah S. Mahmoodian, M. Mortezaeefar:
On the chromatic number of Latin square graphs. 2613-2619 - Michael A. Henning, Douglas F. Rall:
Progress towards the total domination game -conjecture. 2620-2627 - Carl Johan Casselgren, Bjarne Toft:
One-sided interval edge-colorings of bipartite graphs. 2628-2639 - Yan-Quan Feng, Jin-Xin Zhou, Yan-Tao Li:
Pentavalent symmetric graphs of order twice a prime power. 2640-2651 - Youngja Park, SeungKyung Park:
Enumeration of generalized lattice paths by string types, peaks, and ascents. 2652-2659 - Ying-li Kang, Eckhard Steffen:
The chromatic spectrum of signed graphs. 2660-2663 - Ivan Gutman, Luis Medina, Pamela Pizarro, María Robbiano:
Graphs with maximum Laplacian and signless Laplacian Estrada index. 2664-2671 - Atsuhiro Nakamoto, Takayuki Nozawa:
Book embedding of locally planar graphs on orientable surfaces. 2672-2679 - Anton Bernshteyn:
The asymptotic behavior of the correspondence chromatic number. 2680-2692 - Daniele D'Angeli, Alfredo Donno:
Metric compactification of infinite Sierpiński carpet graphs. 2693-2705 - Thomas Perrett:
A zero-free interval for chromatic polynomials of graphs with 3-leaf spanning trees. 2706-2714 - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Dominating sets inducing large components. 2715-2720 - Babak Farzad, Arnoosh Golestanian, Michael Molloy:
Backbone colourings of graphs. 2721-2722 - Jonathan Cutler, Nathan Kahl:
A note on the values of independence polynomials at -1. 2723-2726 - D. Zinoviev:
On the number of Steiner triple systems S(2m-1, 3, 2) of rank 2m-m+2 over F2. 2727-2736 - Dániel Gerbner, Máté Vizer:
A note on tilted Sperner families with patterns. 2737-2741 - Xiaoxue Hu, Weifan Wang, Wai Chee Shiu, Yiqiao Wang:
Plane graphs with maximum degree 9 are entirely 11-choosable. 2742-2753 - Mark Wildon:
Searching for knights and spies: A majority/minority game. 2754-2766 - Simon Schmidt:
The 3/5-conjecture for weakly S(K1, 3)-free forests. 2767-2774 - Emerson L. Monte Carmelo, Juliana Sanches:
Multicolored set multipartite Ramsey numbers. 2775-2784 - Alexandr V. Kostochka, Andrew McConvey, Derrek Yager:
On a packing problem of Alon and Yuster. 2785-2792 - Ana Paulina Figueroa, Juan José Montellano-Ballesteros, Mika Olsen:
Strong subtournaments and cycles of multipartite tournaments. 2793-2803 - John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
Subdivisions in the Robber Locating game. 2804-2811 - Jesús A. De Loera, Reuben N. La Haye, Amanda Montejano, Déborah Oliveros, Edgardo Roldán-Pensado:
A rainbow Ramsey analogue of Rado's theorem. 2812-2818 - Gabriela Araujo-Pardo, Juan Carlos Díaz-Patiño, Luis Montejano, Déborah Oliveros:
The (p, q)-extremal problem and the fractional chromatic number of Kneser hypergraphs. 2819-2825 - Igor Fabrici, Stanislav Jendrol', Margit Voigt:
Facial list colourings of plane graphs. 2826-2831 - Ziling Heng, Qin Yue, Chengju Li:
Three classes of linear codes with two or three weights. 2832-2847 - Natasha Dobrinen, Claude Laflamme, Norbert Sauer:
Rainbow Ramsey simple structures. 2848-2855
Volume 339, Number 12, December 2016
- Kathleen Johst, Yury Person:
On the multicolor Ramsey number of a graph with m edges. 2857-2860 - Klavdija Kutnar, Pawel Petecki:
On automorphisms and structural properties of double generalized Petersen graphs. 2861-2870 - Hüseyin Acan, Pawel Hitczenko:
On random trees obtained from permutation graphs. 2871-2883 - Vedran Krcadinac, Renata Vlahovic:
New quasi-symmetric designs by the Kramer-Mesner method. 2884-2890 - Maura B. Paterson, Douglas R. Stinson:
Combinatorial characterizations of algebraic manipulation detection codes involving generalized difference families. 2891-2906 - Cai Heng Li, Zai Ping Lu, Gai Xia Wang:
Arc-transitive graphs of square-free order and small valency. 2907-2918 - Andrei Asinowski, Balázs Keszegh, Tillmann Miltzow:
Counting houses of Pareto optimal matchings in the house allocation problem. 2919-2932 - Haimiao Chen:
Regular balanced Cayley maps on. 2933-2940 - Carlos Hoppen, Hanno Lefmann, Knut Odermann:
A coloring problem for intersecting vector spaces. 2941-2954 - Saeedeh Rashidi, Nasrin Soltankhah:
On the 3-way (v, k, 2) Steiner trades. 2955-2963 - Cemil Dibek, Tínaz Ekim, Didem Gözüpek, Mordechai Shalom:
Equimatchable graphs are C2k+1-free for k≥4. 2964-2969 - Stefan Gyürki:
Infinite families of directed strongly regular graphs using equitable partitions. 2970-2986 - Theo Grundhöfer, Markus J. Stroppel, Hendrik Van Maldeghem:
A non-classical unital of order four with many translations. 2987-2993 - Alexander E. Patkowski:
On a symmetric q-series identity. 2994-2997 - Gábor Hetyei:
Efron's coins and the Linial arrangement. 2998-3004 - R. S. Shewale, Vilas S. Kharat:
Forbidden configurations for distributive, modular and semidistributive posets. 3005-3016 - Daniel Kohen, Iván Sadofschi Costa:
On a generalization of the seating couples problem. 3017-3019 - Ilia Akolzin, Dmitry A. Shabanov:
Colorings of hypergraphs with large number of colors. 3020-3031 - Chuanni Zhang, Yingqian Wang, Min Chen:
Planar graphs without adjacent cycles of length at most five are (1, 1, 0) -colorable. 3032-3042 - Hongyu Chen, Jian-Liang Wu:
List injective coloring of planar graphs with girth g≥6. 3043-3051 - Panpan Cheng, Min Chen, Yingqian Wang:
Planar graphs without 4-cycles adjacent to triangles are 4-choosable. 3052-3057 - James M. Carraher, David J. Galvin, Stephen G. Hartke, A. J. Radcliffe, Derrick Stolee:
On the independence ratio of distance graphs. 3058-3072 - Sergio Bermudo, José M. Rodríguez, Omar Rosario, José María Sigarreta:
Small values of the hyperbolicity constant in graphs. 3073-3084 - Suyun Jiang, Jin Yan:
Vertex-disjoint copies of K1, 3 in K1, r-free graphs. 3085-3088 - Rudolf Berghammer, Nikita Danilenko, Peter Höfner, Insa Stucke:
Cardinality of relations with applications. 3089-3115
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
