default search action
Discrete Mathematics, Volume 340
Volume 340, Number 1, January 2017
- Sylwia Cichacz
, Dalibor Froncek
Vertex magic total labelings of 2-regular graphs. 3117-3124 - Annachiara Korchmaros
Automorphism groups of Cayley graphs generated by block transpositions and regular Cayley maps. 3125-3139 - Florent Foucaud, Michael A. Henning:
Location-domination in line graphs. 3140-3153 - Hiroaki Taniguchi
On some bilinear dual hyperovals. 3154-3166 - Minki Kim
A note on the colorful fractional Helly theorem. 3167-3170 - Giampiero Chiaselotti
Intersection properties of maximal directed cuts in digraphs. 3171-3175 - Bart De Bruyn:
A characterization of a class of hyperplanes of DW(2n-1, F). 3176-3182 - Diana Davis, Victor Dods
Geodesics on the regular tetrahedron and the cube. 3183-3196 - Fen Li, Xiwang Cao:
A class of minimal cyclic codes over finite fields. 3197-3206 - Michael A. Henning, Kirsti Wash:
Matchings, path covers and domination. 3207-3216 - Lorenzo Traldi
Notes on a theorem of Naji. 3217-3234 - Nair Abreu
Spectra and Laplacian spectra of arbitrary powers of lexicographic products of graphs. 3235-3244
Volume 340, Number 2, February 2017
- Gregory Z. Gutin, Mark Jones, Bin Sheng, Magnus Wahlström
Acyclicity in edge-colored graphs. 1-8 - Sofiya Ostrovska, Mikhail I. Ostrovskii:
Nonexistence of embeddings with uniformly bounded distortions of Laakso graphs into diamond graphs. 9-17 - Oleg V. Borodin, Anna O. Ivanova
Low 5-stars in normal plane maps with minimum degree 5. 18-22 - Honghai Xu
A note on bipartite subgraphs and triangle-independent sets. 23-30 - Mustapha Chellali, Teresa W. Haynes, Stephen T. Hedetniemi, Thomas M. Lewis:
On ve-degrees and ev-degrees in graphs. 31-38 - Sukumar Das Adhikari, Luis Boza, Shalom Eliahou
On the finiteness of some n-color Rado numbers. 39-45 - M. Amin Bahmanian
Factorizations of complete multipartite hypergraphs. 46-50 - Adam Woryna
On the set of uniquely decodable codes with a given sequence of code word lengths. 51-57 - Sarah Loeb, Jakub Przybylo
Asymptotically optimal neighbor sum distinguishing total colorings of graphs. 58-62 - Ludmila Yu. Tsiovkina:
Arc-transitive antipodal distance-regular covers of complete graphs related to SU3(q). 63-71 - Gábor N. Sárközy:
Monochromatic cycle power partitions. 72-80 - Jianxin Wei
A negative answer to a problem on generalized Fibonacci cubes. 81-86 - Ryota Matsubara, Hajime Matsumura, Masao Tsugaki, Tomoki Yamashita:
Degree sum conditions for path-factors with specified end vertices in bipartite graphs. 87-95 - G. Sethuraman, P. Ragukumar
Any Tree with m edges can be embedded in a Graceful Tree with less than 4m edges and in a graceful planar graph. 96-106 - Joanna Polcyn
Refined Turán numbers and Ramsey numbers for the loose 3-uniform path of length three. 107-118 - You Lu, Jiaao Li
Adjacent vertex distinguishing total coloring of graphs with maximum degree 4. 119-123 - Yair Caro, Raphael Yuster, Christina Zarb
Ramsey numbers for degree monotone paths. 124-131 - Long-Tu Yuan, Xiao-Dong Zhang:
The Turán number of disjoint copies of paths. 132-139 - Jun Wang, Huajun Zhang:
Intersecting k-uniform families containing a given family. 140-144 - John Lenz, Dhruv Mubayi:
Eigenvalues of non-regular linear quasirandom hypergraphs. 145-153 - Yezhou Wu, Cun-Quan Zhang
Vertex-coloring 3-edge-weighting of some graphs. 154-159 - Donatella Merlini
Arithmetic into geometric progressions through Riordan arrays. 160-174 - Hui Jiang, Xueliang Li, Yingying Zhang:
Total monochromatic connection of graphs. 175-180 - Xing Peng, Craig Timmons:
A path Turán problem for infinite graphs. 181-191 - Wei Jin, Weijun Liu, Shang Jin Xu:
Two-geodesic transitive graphs of valency six. 192-200 - Yiwei Zhang
Invertible binary matrices with maximum number of 2-by-2 invertible submatrices. 201-208 - Elad Cohen
Tolerance intersection graphs of degree bounded subtrees of a tree with constant tolerance 2. 209-222 - Richard C. Brewster, Florent Foucaud, Pavol Hell, Reza Naserasr:
The complexity of signed graph and edge-coloured graph homomorphisms. 223-235 - Guangzhou Chen
Super-simple pairwise balanced designs with block sizes 3 and 4. 236-242 - Zhi-Hong Chen, Hong-Jian Lai, Meng Zhang
Spanning trails with variations of Chvátal-Erdős conditions. 243-251 - Andrzej Zak
Packing large trees of consecutive orders. 252-263 - Sergey V. Savchenko:
On the number of 7-cycles in regular n-tournaments. 264-285
Volume 340, Number 3, March 2017
- Guantao Chen, Julia Ehrenmüller, Cristina G. Fernandes
Nonempty intersection of longest paths in series-parallel graphs. 287-304 - Hongliang Lu, Yuqing Lin
On the number of disjoint perfect matchings of regular graphs with given edge connectivity. 305-310 - Shuchao Li, Huihui Zhang:
Proofs of three conjectures on the quotients of the (revised) Szeged index and the Wiener index and beyond. 311-324 - Lorenz A. Gilch, Sebastian Müller:
Counting self-avoiding walks on free products of graphs. 325-332 - Shoham Letzter
Radon numbers for trees. 333-344 - Xiaoshan Kai, Lingrong Wang, Shixin Zhu
The depth spectrum of negacyclic codes over Z4. 345-350 - Yun Li, Lijun Ji:
Constructions of dihedral Steiner quadruple systems. 351-360 - Rachna Sachdeva, A. K. Agarwal:
Combinatorics of certain restricted n-color composition functions. 361-372 - András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett
Chromatic Ramsey number of acyclic hypergraphs. 373-378 - Elizabeth Maltais, Lucia Moura, Mike Newman:
Graph-intersecting set systems and LYM inequalities. 379-398 - Markus Grassl
New self-dual additive F4-codes constructed from circulant graphs. 399-403 - Premysl Jedlicka
Distributive and trimedial quasigroups of order 243. 404-415 - Saieed Akbari
Zero-sum flows for triple systems. 416-425 - Marko Thiel:
A new cyclic sieving phenomenon for Catalan objects. 426-429 - Saori Adachi, Rina Hayashi, Hiroshi Nozaki, Chika Yamamoto:
Maximal m-distance sets containing the representation of the Hamming graph H(n, m). 430-442 - André Bernardino
Coloring factors of substitutive infinite words. 443-451 - Safet Penjic
On the Terwilliger algebra of bipartite distance-regular graphs with Δ2=0 and c2=2. 452-466 - Qiuyan Wang, Fei Li, Kelan Ding, Dongdai Lin:
Complete weight enumerators of two classes of linear codes. 467-480 - Ayineedi Venkateswarlu
On acyclic edge-coloring of complete bipartite graphs. 481-493 - Stéphane Bessy, Pascal Ochem, Dieter Rautenbach:
Bounds on the exponential domination number. 494-503 - Zbigniew Lonc
Note on a construction of short k-radius sequences. 504-507 - Valentas Kurauskas:
On the genus of the complete tripartite graph Kn, n, 1. 508-515 - Ronan Egan
Automorphisms of generalized Sylvester Hadamard matrices. 516-523 - Joe Sawada, Aaron Williams, Dennis Wong
A simple shift rule for k-ary de Bruijn sequences. 524-531 - Marius Somodi, Katie Burke, Jesse Todd:
On a construction using commuting regular graphs. 532-540 - Liang Zhang
Finite maximal codes and triangle conjecture. 541-549 - Jongyook Park:
The distance-regular graphs with valency k≥2, diameter D≥3 and kD-1+kD≤2k. 550-561
Volume 340, Number 4, April 2017
- Daniel Birmajer, Juan B. Gil, Michael D. Weiner:
Colored partitions of a convex polygon by noncrossing diagonals. 563-571 - Lei Meng, Jian-Hua Yin:
An extension of a result of Alon, Ben-Shimon and Krivelevich on bipartite graph vertex sequences. 572-577 - Diego González-Moreno
Monochromatic connecting colorings in strongly connected oriented graphs. 578-584 - Noam Solomon, Ruixiang Zhang:
Highly incidental patterns on a quadratic hypersurface in R4. 585-590 - Guixin Deng
On the depth spectrum of binary linear codes and their dual. 591-595 - Christoph Brause, Dieter Rautenbach, Ingo Schiermeyer:
Local connectivity, local degree conditions, some forbidden induced subgraphs, and cycle extendability. 596-606 - Zhenzhen Lou, Qiongxiang Huang, Xueyi Huang
Construction of graphs with distinct eigenvalues. 607-616 - Miwako Mishima, Koji Momihara:
A new series of optimal tight conflict-avoiding codes of weight 3. 617-629 - Xiaoqin Zhan
A classification of flag-transitive 2-designs with λ≥(r, λ)2 and sporadic socle. 630-636 - Wei Jin
Two-geodesic-transitive graphs which are locally connected. 637-643 - Mircea Merca
On the number of partitions into parts of k different magnitudes. 644-648 - Suyun Jiang, Shuya Chiba, Shinya Fujita, Jin Yan:
Vertex-disjoint copies of K1, t in K1, r-free graphs. 649-654 - Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng
Polarity graphs and Ramsey numbers for C4 versus stars. 655-660 - Luke Nelson:
A recursion on maximal chains in the Tamari lattices. 661-677 - Shuya Chiba, Tomoki Yamashita:
Degree sum conditions for vertex-disjoint cycles passing through specified vertices. 678-690 - Csongor Gy. Csehi, András Recski
Partitioning the bases of the union of matroids. 691-694 - Song Guo, Victor J. W. Guo
A recursive algorithm for trees and forests. 695-703 - Shujuan Dang, Lu Qiu, Dianhua Wu:
New (q, K, λ)-ADFs via cyclotomy. 704-707 - Hui-Qin Cao, Hao Pan:
A Stern-type congruence for the Schröder numbers. 708-712 - Anu Kathuria, S. K. Arora, Sudhir Batra
On traceability property of equidistant codes. 713-721 - Jennifer D. Key, T. P. McDonough, Vassili C. Mavron:
Improved partial permutation decoding for Reed-Muller codes. 722-728 - Shudi Yang, Zheng-an Yao:
Complete weight enumerators of a class of linear codes. 729-739 - Avinash Patil, B. N. Waphare, Vinayak Joshi
Perfect zero-divisor graphs. 740-745 - Hiranmoy Pal
Pretty good state transfer on some NEPS. 746-752 - Anna A. Taranenko
On the numbers of 1-factors and 1-factorizations of hypergraphs. 753-762 - Jin Wang:
A note on unimodular lattices with trivial automorphism groups. 763-765 - Daniel W. Cranston
An introduction to the discharging method via graph coloring. 766-793 - Jorge Bruno
A family of ω1 topological types of locally finite trees. 794-795 - Michal Lason
The coloring game on matroids. 796-799 - Joshua Hallam:
Applications of quotient posets. 800-810 - Jiangmin Pan, Zhaohong Huang, Suyun Ding:
Arc-transitive cyclic covers of graphs with order twice a prime. 811-816 - Gregory Z. Gutin, Bin Sheng, Magnus Wahlström
Odd properly colored cycles in edge-colored graphs. 817-821 - M. M. Pyaderkin
On the stability of some Erdős-Ko-Rado type results. 822-831 - Hai Q. Dinh
On constacyclic codes of length 4ps over Fpm+uFpm. 832-849
Volume 340, Number 5, May 2017
- Maycon Sambinelli
On Linial's conjecture for spine digraphs. 851-854 - Sandip Das, Sasthi C. Ghosh, Soumen Nandi
A lower bound technique for radio k-coloring. 855-861 - Julien Leroy
Counting the number of non-zero coefficients in rows of generalized Pascal triangles. 862-881 - Thomas Schweser
Degree choosable signed graphs. 882-891 - Sung-Yell Song
Combinatorial extensions of Terwilliger algebras and wreath products of association schemes. 892-905 - Abdollah Khodkar, Christian Schulz, Nathan Wagner:
Existence of some signed magic arrays. 906-926 - Cemil Dibek
Maximum number of edges in claw-free graphs whose maximum degree and matching number are bounded. 927-934 - Danny Dyer, Eduardo Martínez-Pedroza
The coarse geometry of Hartnell's firefighter problem on infinite graphs. 935-950 - Anthony Bonato, Przemyslaw Gordinowicz
Cops and Robbers ordinals of cop-win trees. 951-956 - Carolin Hannusch
On monomial codes in modular group algebras. 957-962 - Jerzy Konarski, Andrzej Zak
Near packings of two graphs. 963-968 - Matthew Brennan:
Ramsey numbers of trees and unicyclic graphs versus fans. 969-983 - Hortensia Galeana-Sánchez, Juan José Montellano-Ballesteros
A Richardson's theorem version for ⊓-kernels. 984-987 - Ervin Györi, Tamás Róbert Mezei
Note on terminal-pairability in complete grid graphs. 988-990 - Takayuki Hibi, Nan Li, Yoshimi Sahara, Akihiro Shikama
The numbers of edges of the order polytope and the chain polytope of a finite partially ordered set. 991-994 - Pierre Aboulker, Guillaume Lagarde, David Malec, Abhishek Methuku, Casey Tompkins:
De Bruijn-Erdős-type theorems for graphs and posets. 995-999 - Stéphane Bessy, Nicolas Bousquet
Colorful paths for 3-chromatic graphs. 1000-1007 - Flavia Bonomo
Clique coloring B1-EPG graphs. 1008-1011 - Shengmei Lv, Liming Xiong
Forbidden pairs for spanning (closed) trails. 1012-1018 - Sylvia Vergara S.:
Complete graph immersions in dense graphs. 1019-1027 - Olav Geil
More results on the number of zeros of multiplicity at least r. 1028-1038 - Peter Frankl:
A structural result for 3-graphs. 1039-1041 - Chen Wang
Large sets of Kirkman triple systems with order qn+2. 1042-1045 - Peter Borg
Stars on trees. 1046-1049 - Haode Yan, Chunlei Liu
A note on the spectrum of linearized Wenger graphs. 1050-1053 - François Bergeron
Bounded height interlaced pairs of parking functions. 1054-1058 - Michael Richter
Embedding convex geometries and a bound on convex dimension. 1059-1063 - Alexandr Valyuzhenich
Minimum supports of eigenfunctions of Hamming graphs. 1064-1068 - Clément Charpentier:
The coloring game on planar graphs with large girth, by a result on sparse cactuses. 1069-1073 - Jiangxu Kong, Lianzhu Zhang:
A note on the surviving rate of 1-planar graphs. 1074-1079 - Yanxun Chang, Lijun Ji, Hao Zheng:
A completion of LS(2n41). 1080-1085 - Hai-Feng Zhang, Meng Zhou, Guang-Jun Zhang:
Answer to some open questions on covering dimension for finite lattices. 1086-1091 - Hao Li, Hong-Jian Lai, Yang Wu, Shuzhen Zhu:
Panconnected index of graphs. 1092-1097 - Peter Frankl, Norihide Tokushige
A note on Huang-Zhao theorem on intersecting families with large minimum degree. 1098-1103 - Joshua E. Ducey:
On the critical group of the missing Moore graph. 1104-1109 - Bostjan Bresar, Sandi Klavzar
Packing chromatic number under local changes in a graph. 1110-1115 - Alireza Abdollahi, Shahrooz Janbaz
A large family of cospectral Cayley graphs over dihedral groups. 1116-1121 - Sithembele Nkonkobe
A study of a family of generating functions of Nelsen-Schmidt type and some identities on restricted barred preferential arrangements. 1122-1128 - Péter Csikvári, Péter E. Frenkel, Jan Hladký
Chromatic roots and limits of dense graphs. 1129-1135 - Hongliang Lu, Li Zhang:
Note on matchings in 3-partite 3-uniform hypergraphs. 1136-1142 - Mingfang Huang, Gexin Yu, Xiangqian Zhou
The strong chromatic index of (3, Δ)-bipartite graphs. 1143-1149
Volume 340, Number 6, June 2017
- Rémi Desgranges, Kolja Knauer
A correction of a characterization of planar partial cubes. 1151-1153 - Sándor Z. Kiss, Csaba Sándor:
Partitions of the set of nonnegative integers with the same representation functions. 1154-1161 - Marcel Abas, Tomás Vetrík
Large Cayley digraphs and bipartite Cayley digraphs of odd diameters. 1162-1171 - Oliver Cooley
The minimum vertex degree for an almost-spanning tight cycle in a 3-uniform hypergraph. 1172-1179 - John A. Arredondo, Camilo Ramírez Maluendas, Ferrán Valdez:
On the topology of infinite regular and chiral maps. 1180-1186 - Jürgen Bierbrauer, Stefano Marcugini, Fernanda Pambianco:
The Pace code, the Mathieu group M12 and the small Witt design S(5, 6, 12). 1187-1190 - Sherry H. F. Yan, Guizhi Qin, Zemin Jin, Robin D. P. Zhou:
On (2k+1, 2k+3)-core partitions with distinct parts. 1191-1202 - Zhihui Jiao, Hong Wang, Jin Yan:
Disjoint cycles in graphs with distance degree sum conditions. 1203-1209 - Andrea Munaro
On line graphs of subcubic triangle-free graphs. 1210-1226 - Yusuke Suzuki:
K7-minors in optimal 1-planar graphs. 1227-1234 - Ruonan Li
Cycle extension in edge-colored complete graphs. 1235-1241 - Raúl M. Falcón
Partial Latin rectangle graphs and autoparatopism groups of partial Latin rectangles with trivial autotopism groups. 1242-1260 - Nicholas J. A. Harvey, Christopher Liaw:
Rainbow Hamilton cycles and lopsidependency. 1261-1270 - Beifang Chen, Jue Wang, Thomas Zaslavsky
Resolution of indecomposable integral flows on signed graphs. 1271-1286 - Jason I. Brown
On the roots of all-terminal reliability polynomials. 1287-1299 - Byung-Geun Oh
On the number of vertices of positively curved planar graphs. 1300-1310 - Klaus Metsch:
A gap result for Cameron-Liebler k-classes. 1311-1318 - Tricia Muldoon Brown:
On the enumeration of k-omino towers. 1319-1326 - Eun Ju Cheon, Masaaki Homma, Seon Jeong Kim, Namyong Lee:
On a number of rational points on a plane curve of low degree. 1327-1334 - Hwayoung Lee, Bokhee Im, Jonathan D. H. Smith:
Stochastic tensors and approximate symmetry. 1335-1350 - Nicholas J. Cavenagh
Subcubic trades in Steiner triple systems. 1351-1358 - Weihua He
Hamiltonian paths in spanning subgraphs of line graphs. 1359-1366 - Junye Ma
Directed strongly regular graphs with rank 6. 1367-1373 - Giorgio Donati, Nicola Durante
Scattered linear sets of PG(3, qn) generated by collineations between stars of lines. 1374-1380 - Taylor Ball, Robert W. Bell
On the cop number of generalized Petersen graphs. 1381-1388 - Lili Mu, Yi Wang
Hankel determinants of shifted Catalan-like numbers. 1389-1396 - Te-Sheng Tan, Dai-Yang Wu
Partitions of n that avoid partitions of f, and an application to the tiny-pan coin weighing problem. 1397-1404 - Fábio Botler
On path decompositions of 2k-regular graphs. 1405-1411 - Catherine Erbes, Theodore Molla, S. Mousley, Michael Santana
Spanning trees with leaf distance at least d. 1412-1418 - Michitaka Furuya, Takamasa Yashima
Neighborhood-union condition for an [a, b]-factor avoiding a specified Hamiltonian cycle. 1419-1425 - G. R. Omidi, Maryam Shahsiah:
Ramsey numbers of uniform loose paths and cycles. 1426-1434 - José Aliste-Prieto, Anna de Mier
On trees with the same restricted U-polynomial and the Prouhet-Tarry-Escott problem. 1435-1441 - Krasimir Yordzhev
On the number of mutually disjoint pairs of S-permutation matrices. 1442-1448
Volume 340, Number 7, July 2017
- Yiqiao Wang, Xiaoxue Hu, Wei-Fan Wang:
A note on the linear 2-arboricity of planar graphs. 1449-1455 - Pierre Coupechoux
Extension of universal cycles for globally identifying colorings of cycles. 1456-1466 - Liliana Alcón, Marisa Gutierrez, Glenn Hurlbert
Pebbling in semi-2-trees. 1467-1480 - Esmeralda Nastase, Papa A. Sissokho
The maximum size of a partial spread II: Upper bounds. 1481-1487 - Huilan Chang, Wei-Cheng Lan:
Interval group testing for consecutive positives. 1488-1496 - Michael Gentner, Dieter Rautenbach:
Some comments on the Slater number. 1497-1502 - Yun-Ping Deng, Yu-Qin Sun, Qiong Liu, Haichao Wang:
Efficient dominating sets in circulant graphs. 1503-1507 - Michal Debski
Fractional strong chromatic index of bipartite graphs. 1508-1513 - Ana Paulina Figueroa
The minimum feedback arc set problem and the acyclic disconnection for graphs. 1514-1521 - Rongquan Feng, He Huang, Sanming Zhou:
Perfect codes in circulant graphs. 1522-1527 - Yucong Tang
An approximate ore-type result for tight Hamilton cycles in uniform hypergraphs. 1528-1534 - Gabriel Nivasch
On the zone of a circle in an arrangement of lines. 1535-1552 - Jason M. Altschuler, Elizabeth Yang:
Inclusion of forbidden minors in random representable matroids. 1553-1563 - Olivier Baudon, Jakub Przybylo
The neighbour-sum-distinguishing edge-colouring game. 1564-1572 - Gregory J. Puleo
Maximal k-edge-colorable subgraphs, Vizing's Theorem, and Tuza's Conjecture. 1573-1580 - Yue Zhou
Multiple factorizations of cyclic groups. 1581-1583 - Rennan Dantas, Frédéric Havet, Rudini M. Sampaio
Identifying codes for infinite triangular grids with a finite number of rows. 1584-1597 - Anthony D. Forbes, Terry S. Griggs, Tamsin J. Forbes:
Archimedean graph designs - II. 1598-1611 - Oleg V. Borodin, Anna O. Ivanova
Low minor 5-stars in 3-polytopes with minimum degree 5 and no 6-vertices. 1612-1616 - Tri Lai:
Proof of a refinement of Blum's conjecture on hexagonal dungeons. 1617-1632 - Martin Rolek
Double-critical graph conjecture for claw-free graphs. 1633-1638 - Wojciech Widel
A Fan-type heavy triple of subgraphs for pancyclicity of 2-connected graphs. 1639-1644 - Hao Chen
Ball packings with high chromatic numbers from strongly regular graphs. 1645-1648 - Josep Rifà
Completely regular codes with different parameters giving the same distance-regular coset graphs. 1649-1656 - Karim Samei
Cyclic R-additive codes. 1657-1668 - Rebekah Aduddell, Morgan Ascanio, Adam Deaton, Casey Mann:
Unilateral and equitransitive tilings by equilateral triangles. 1669-1680 - Chenying Wang, Piotr Miska
The r-derangement numbers. 1681-1692 - Kai An Sim
Lazy cops and robbers on generalized hypercubes. 1693-1704 - Nancy E. Clarke, Robert P. Gallant:
On 2-limited packings of complete grid graphs. 1705-1715 - John M. Campbell
The expansion of immaculate functions in the ribbon basis. 1716-1726 - Tatiana Romina Hartinger, Martin Milanic
1-perfectly orientable graphs and graph products. 1727-1737 - Suhui Dai, Yanxun Chang, Lidong Wang:
w-cyclic holey group divisible designs and their application to three-dimensional optical orthogonal codes. 1738-1748 - Daniel Soltész:
On the 1-switch conjecture. 1749-1756
Volume 340, Number 8, August 2017
- Mi-Mi Zhang, Jin-Xin Zhou
Trivalent vertex-transitive bi-dihedrants. 1757-1772 - Hui Zhou
On top locally-s-distance-transitive graphs. 1773-1783 - Liangchen Li:
A note on difference families from cyclotomy. 1784-1787 - Daiqiang Hu, Jian-Liang Wu
Planar graphs without intersecting 5-cycles are 4-choosable. 1788-1792 - Vadim E. Levit
Well-dominated graphs without cycles of lengths 4 and 5. 1793-1801 - Ruth Haas
Reconfiguring dominating sets in some well-covered and other classes of graphs. 1802-1817 - Daniel Horsley
Decomposing Ku+w-Ku into cycles of prescribed lengths. 1818-1843 - Jianxin Wei
The self-concatenation of isometric strings is isometric. 1844-1850 - Jason J. Molitierno
An upper bound on the algebraic connectivity of outerplanar graphs. 1851-1870 - Young Soo Kwon:
Classification of nonorientable regular embeddings of cartesian products of graphs. 1871-1877 - Encarnación Abajo, Gabriela Araujo-Pardo
New small regular graphs of girth 5. 1878-1888 - Wuyang Sun:
Covering a cubic graph by 5 perfect matchings. 1889-1896 - Raquel Águeda, Valentin Borozan, Raquel Díaz, Yannis Manoussakis, Leandro Montero:
Proper Hamiltonian cycles in edge-colored multigraphs. 1897-1902 - Susana-Clara López
A new labeling construction from the ⊗h-product. 1903-1909 - Hao Liu, Cunsheng Ding, Chengju Li:
Dimensions of three types of BCH codes over GF(q). 1910-1927 - Ayse Hümeyra Bilge
An equivalence class decomposition of finite metric spaces via Gromov products. 1928-1932 - Ngo Dac Tan
On 3-regular digraphs without vertex disjoint cycles of different lengths. 1933-1943 - Hao Liang, Jun-Ming Xu:
On Seymour's Second Neighborhood conjecture of m-free digraphs. 1944-1949 - Alexandr Polyanskii
Pairwise intersecting homothets of a convex body. 1950-1956 - Iryna V. Fryz
Block composition algorithm for constructing orthogonal n-ary operations. 1957-1966 - Hüseyin Acan
On a uniformly random chord diagram and its intersection graph. 1967-1985 - Sagnik Sen:
On homomorphisms of oriented graphs with respect to the push operation. 1986-1995 - Richard A. Brualdi, Michael W. Schroeder:
Alternating sign matrices and their Bruhat order. 1996-2019 - Laura Colmenarejo
Stability properties of the plethysm: A combinatorial approach. 2020-2032 - Yunfang Tang
Total weight choosability of graphs with bounded maximum average degree. 2033-2042 - Leila Maherani, Gholam Reza Omidi:
Monochromatic Hamiltonian Berge-cycles in colored hypergraphs. 2043-2052 - Márton Elekes, Dániel T. Soukup
Decompositions of edge-colored infinite complete graphs into monochromatic paths. 2053-2069 - Donatella Merlini, Renzo Sprugnoli:
Corrigendum to "Arithmetic into geometric progressions through Riordan arrays" [Discrete Math. 340(2) (2017) 160-174]. 2070
Volume 340, Number 9, September 2017
- Jiangmin Pan, Bo Ling
On symmetric graphs of order four times an odd square-free integer and valency seven. 2071-2078 - João Carvalho, Bruna S. Souza, Vilmar Trevisan
Exponentially many graphs have a Q-cospectral mate. 2079-2085 - Mohammad Hassan Shirdareh Haghighi
A new characterization of equipartite graphs. 2086-2090 - Zhi-Hong Chen:
Circumferences of 3-connected claw-free graphs, II. 2091-2107 - Lifeng Dai, Yingqian Wang
Every planar graph without cycles of length 4 or 9 is (1, 1, 0)-colorable. 2108-2122 - Sen-Peng Eu
Enumerations of vertices among all rooted ordered trees with levels and degrees. 2123-2129 - Stefaan De Winter
Non-existence of two types of partial difference sets. 2130-2133 - Noriyoshi Sukegawa
Improving bounds on the diameter of a polyhedron in high dimensions. 2134-2142 - Fabrício Benevides, Carlos Hoppen
Edge-colorings of graphs avoiding complete graphs with a prescribed coloring. 2143-2160 - Fenix W. D. Huang, Christian M. Reidys:
A topological framework for signed permutations. 2161-2182 - Katarzyna Rybarczyk
Poisson approximation of counts of induced subgraphs in random intersection graphs. 2183-2193 - Junfeng Du, Binlong Li, Liming Xiong
Forbidden pairs of disconnected graphs for traceability in connected graphs. 2194-2199 - Derek Garton:
A weighted Möbius function. 2200-2207 - Andrea Munaro
Bounded clique cover of some sparse graphs. 2208-2216 - Fei Huang, Xueliang Li, Zhongmei Qin, Colton Magnant, Kenta Ozeki
On two conjectures about the proper connection number of graphs. 2217-2222 - Mircea Merca
Lambert series and conjugacy classes in GL. 2223-2233 - Oleg V. Borodin, Anna O. Ivanova
On light neighborhoods of 5-vertices in 3-polytopes with minimum degree 5. 2234-2242 - Hengjia Wei, Gennian Ge:
Some more uniformly resolvable designs with block sizes 2 and 4. 2243-2249 - Li Liu, Lanqiang Li
Repeated-root constacyclic codes of length nlps. 2250-2261 - Gaojun Luo
A construction of linear codes and strongly regular graphs from q-polynomials. 2262-2274 - Fábio Botler
Decomposing 8-regular graphs into paths of length 4. 2275-2285 - Gérard H. E. Duchamp, Jean-Yves Enjalbert, Vincel Hoang Ngoc Minh, Christophe Tollu:
The mechanics of shuffle products and their siblings. 2286-2300 - Robert E. Jamison, Henry Martyn Mulder
Graphs constructible from cycles and complete graphs. 2301-2306 - Peter Borg
The maximum product of sizes of cross-intersecting families. 2307-2317 - Ze-Tu Gao, Jian-Hua Yin:
Lemke graphs and Graham's pebbling conjecture. 2318-2332
Volume 340, Number 10, October 2017
- Jiuqiang Liu, Xiaodong Liu:
Set systems with positive intersection sizes. 2333-2340 - Shangwei Lin
3-Restricted arc connectivity of digraphs. 2341-2348 - Michael A. Henning, Anders Yeo
A note on fractional disjoint transversals in hypergraphs. 2349-2354 - Artem Napov
A divide-and-conquer bound for aggregate's quality and algebraic connectivity. 2355-2365 - Meysam Alishahi
Chromatic number via Turán number. 2366-2377 - Song-Tao Guo, Hailong Hou, Yong Xu:
Hexavalent symmetric graphs of order 9p. 2378-2387 - Pedro J. Miana
Sums of powers of Catalan triangle numbers. 2388-2397 - Bostjan Bresar
Improving the Clark-Suen bound on the domination number of the Cartesian product of graphs. 2398-2401 - Jakub Przybylo
Distant sum distinguishing index of graphs. 2402-2407 - Tien Chih, Demitri Plessas
Graphs and their associated inverse semigroups. 2408-2414 - Cunsheng Ding, Chengju Li:
Infinite families of 2-designs and 3-designs from linear codes. 2415-2431 - David I. Bevan
Large butterfly Cayley graphs and digraphs. 2432-2436 - Masashi Kosuda, Manabu Oura:
Centralizer algebras of the group associated to ℤ4-codes. 2437-2446 - Niranjan Balachandran, Sajith Padinhatteeri
Distinguishing chromatic number of random Cayley graphs. 2447-2455 - Aubrey Blecher
The perimeter of words. 2456-2465 - Masaaki Harada:
Extremal Type II ℤ4-codes constructed from binary doubly even self-dual codes of length 40. 2466-2468 - Binzhou Xia
The covering radius of PGL2. 2469-2471 - Dean Crnkovic
Quasi-symmetric 2-(64, 24, 46) designs derived from AG(3, 4). 2472-2478 - Michael Ferrara, Bill Kay
The saturation number of induced subposets of the Boolean lattice. 2479-2487 - Tanja Gologranc
Toll number of the Cartesian and the lexicographic product of graphs. 2488-2498 - Isabel Beckenbach
Perfect f-matchings and f-factors in hypergraphs - A combinatorial approach. 2499-2506 - Dean Crnkovic
New 3-designs and 2-designs having U(3, 3) as an automorphism group. 2507-2515 - David Rolnick
Quantitative (p, q) theorems in combinatorial geometry. 2516-2527 - Michael Kopreski, Gexin Yu
Maximum average degree and relaxed coloring. 2528-2530 - Minglong Qi, Shengwu Xiong, Jingling Yuan, Wenbi Rao, Luo Zhong:
On some new difference systems of sets constructed from the cyclotomic classes of order 12. 2531-2537 - Boris Brimkov, Jennifer Edmond, Robert Lazar, Bernard Lidický
Injective choosability of subcubic planar graphs with girth 6. 2538-2549 - Jean-Luc Baril, Sergey Kirgizov:
The pure descent statistic on permutations. 2550-2558 - Denis S. Krotov
The extended 1-perfect trades in small hypercubes. 2559-2572 - Christina Graves
Vertex-minimal graphs with dihedral symmetry I. 2573-2588 - Pierre Charbit
Limits of structures and the example of tree semi-lattices. 2589-2603 - Makoto Nishina, Yusuke Suzuki:
A generating theorem of simple even triangulations with a finitizable set of reductions. 2604-2613
Volume 340, Number 11, November 2017
- Thomas Böhme, Jochen Harant, Matthias Kriesell, Michael Stiebitz:
Horst Sachs (1927-2016). 2615 - Krystal Guo
Digraphs with Hermitian spectral radius below 2 and their cospectrality with paths. 2616-2632 - Christoph Brause, Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt:
Sum choice number of generalized θ-graphs. 2633-2640 - Gábor Bacsó, Zdenek Ryjácek
Coloring the cliques of line graphs. 2641-2649 - Simon Jäger, Dieter Rautenbach:
Exponential independence. 2650-2658 - Tsyndyma Chimit-Dordjievna Batueva, Oleg V. Borodin, Mikhail A. Bykov, Anna O. Ivanova
Refined weight of edges in normal plane maps. 2659-2664 - Michael D. Plummer, Akira Saito:
Toughness, binding number and restricted matching extension in a graph. 2665-2672 - Susan A. van Aardt, Christoph Brause, Alewyn P. Burger, Marietjie Frick
Proper connection and size of graphs. 2673-2677 - Carl Johan Casselgren, Petros A. Petrosyan
On interval and cyclic interval edge colorings of (3, 5)-biregular graphs. 2678-2687 - Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
A stability version for a theorem of Erdős on nonhamiltonian graphs. 2688-2690 - Július Czap
Facially-constrained colorings of plane graphs: A survey. 2691-2703 - Csilla Bujtás
The minimum number of vertices in uniform hypergraphs with given domination number. 2704-2713 - Herbert Fleischner:
Reducing an arbitrary fullerene to the dodecahedron. 2714-2722
Volume 340, Number 12, December 2017
- Denis S. Krotov
The minimum volume of subspace trades. 2723-2731 - Dylan Heuer, Chelsey Morrow, Ben Noteboom, Sara Solhjem, Jessica Striker, Corey Vorland:
Chained permutations and alternating sign matrices - Inspired by three-person chess. 2732-2752 - András Gyárfás, Zoltán Király
Covering complete partite hypergraphs by monochromatic components. 2753-2761 - Seungsang Oh
Maximal independent sets on a grid graph. 2762-2768 - Jesse T. Geneson
Extremal functions of forbidden multidimensional matrices. 2769-2781 - Ye Wang:
On some cycles in linearized Wenger graphs. 2782-2788 - Changhong Lu, Bing Wang, Ping Zhang:
Monochromatic loose path partitions in k-uniform hypergraphs. 2789-2791 - Shipeng Wang, Liming Xiong
Forbidden set of induced subgraphs for 2-connected supereulerian graphs. 2792-2797 - Liliana Alcón
Helly EPT graphs on bounded degree trees: Characterization and recognition. 2798-2806 - Ivica Martinjak:
Algebraic properties of the canonical incidence matrix of a biplane. 2807-2812 - Kijung Kim
Investigations on association schemes with elementary abelian thin residue. 2813-2821 - Francesco Brenti, Angela Carnevale
Odd length for even hyperoctahedral groups and signed generating functions. 2822-2833 - Shane Chern
An overpartition analogue of partitions with bounded differences between largest and smallest parts. 2834-2839 - Yuan Cao, Yonglin Cao, Fanghui Ma:
Complete classification of (δ + αu2)-constacyclic codes over F2m / < u4 > of oddly even length. 2840-2852 - Matheus Bernardini
Counting numerical semigroups by genus and even gaps. 2853-2863 - Jiang Zhou, Lizhu Sun, Changjiang Bu:
Resistance characterizations of equiarboreal graphs. 2864-2870 - Shuya Chiba, Tomoki Yamashita:
A note on degree sum conditions for 2-factors with a prescribed number of cycles in bipartite graphs. 2871-2877 - Megan Cream, Ronald J. Gould, Victor Larsen
Forbidden subgraphs for chorded pancyclicity. 2878-2888 - Konstantinos Papalamprou, Leonidas S. Pitsoulis:
Signed-graphic matroids with all-graphic cocircuits. 2889-2899 - Wei Meng, Jia Guo, Mei Lu, Yubao Guo, Lutz Volkmann:
Universal arcs in local tournaments. 2900-2915 - Ruijuan Li, Tingting Han:
Arc-disjoint hamiltonian paths in non-round decomposable local tournaments. 2916-2924 - R. Julian R. Abel, Diana Combe, Adrian M. Nelson, William D. Palmer:
Block designs signed over groups of order 2n3m. 2925-2940 - Terry A. McKee
New characterizations of Gallai's i-triangulated graphs. 2941-2945 - Jean-Luc Baril, Sergey Kirgizov, Vincent Vajnovszki:
Patterns in treeshelves. 2946-2954 - Junqing Cai
Longest cycles in 4-connected graphs. 2955-2966 - Primoz Potocnik, Primoz Sparl:
On the radius and the attachment number of tetravalent half-arc-transitive graphs. 2967-2971 - Yian Xu:
On constructing normal and non-normal Cayley graphs. 2972-2977 - Robert E. L. Aldred, Jun Fujisawa
Edge proximity and matching extension in punctured planar triangulations. 2978-2985 - Houmem Belkhechine
Decomposability index of tournaments. 2986-2994 - Wei Xiong, Jinquan Xu, Zhengke Miao, Yang Wu, Hong-Jian Lai
Supereulerian width of dense graphs. 2995-3001 - Xun-Tuan Su:
Enumerating closed flows on forks. 3002-3010 - Guantao Chen, Xiaodong Chen, Yue Zhao:
Hamiltonicity of edge chromatic critical graphs. 3011-3015 - Xiuyun Wang:
All double generalized Petersen graphs are Hamiltonian. 3016-3019 - Han Ren, Chao Yang
A new formula for the decycling number of regular graphs. 3020-3031 - Ryuji Abe
On palindromes with three or four letters associated to the Markoff spectrum. 3032-3043 - Louis Deaett
Orthogonal representations of Steiner triple system incidence graphs. 3044-3054 - Deng Tang
Binary linear codes from vectorial boolean functions and their weight distribution. 3055-3072 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores
On strong graph bundles. 3073-3080 - Sheng-Liang Yang
Some matrix identities on colored Motzkin paths. 3081-3091 - Bojan Vuckovic:
Edge-partitions of graphs and their neighbor-distinguishing index. 3092-3096 - Lili Mu, Yi Wang
Hankel determinants of linear combinations of consecutive Catalan-like numbers. 3097-3103 - Zhi-Hong Chen:
Degree and neighborhood conditions for hamiltonicity of claw-free graphs. 3104-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 2024-10-31 20:05 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: