Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 341
Volume 341, Number 1, January 2018
- T. K. Rapke, Karen Seyffarth:
On nice and injective-nice tournaments. 1-19
- Sarah E. Anderson, S. Nagpal, Kirsti Wash:
Domination in the hierarchical product and Vizing's conjecture. 20-24 - Dong Zhang
:
Topological multiplicity of the maximum eigenvalue of graph 1-Laplacian. 25-32 - Lucélia Kowalski Pinheiro, Vilmar Trevisan:
Maximality of the signless Laplacian energy. 33-41 - Jiaao Li, Rong Luo, Yi Wang:
Nowhere-zero 3-flow of graphs with small independence number. 42-50 - Dennis Clemens, Mirjana Mikalacki:
How fast can Maker win in fair biased games? 51-66 - L. Wang, Haitao Cao:
A note on the Hamilton-Waterloo problem with C8-factors and Cm-factors. 67-73 - Bence Csajbók, Corrado Zanella:
Maximum scattered 픽q-linear sets of PG(1, q4). 74-80 - Yi Wang, Shi-Cai Gong, Yi-Zheng Fan:
On the determinant of the Laplacian matrix of a complex unit gain graph. 81-86 - Sophie Huczynska, Maura B. Paterson:
Existence and non-existence results for strong external difference families. 87-95 - Jeong-Hyun Kang:
A new approach to the chromatic number of the square of Kneser graph K(2k+1, k). 96-103 - Michael Tait:
Degree Ramsey numbers for even cycles. 104-108 - Xin Wang, Hengjia Wei, Gennian Ge:
A strengthened inequality of Alon-Babai-Suzuki's conjecture on set systems with restricted intersections modulo p. 109-118 - Michael Gentner, Irene Heinrich, Simon Jäger, Dieter Rautenbach:
Large values of the clustering coefficient. 119-125 - Xinmin Hou, Yu Qiu, Boyuan Liu:
Turán number and decomposition number of intersecting odd cycles. 126-137 - Louis Anthony Agong, Carmen Amarra, John S. Caughman IV, Ari J. Herman, Taiyo S. Terada:
On the girth and diameter of generalized Johnson graphs. 138-142 - Fabrício Benevides, Dániel Gerbner, Cory Palmer, Dominik K. Vu:
Identifying defective sets using queries of small size. 143-150 - Hui Du, Ralph J. Faudree, Jeno Lehel, Kiyoshi Yoshimoto:
A panconnectivity theorem for bipartite graphs. 151-154 - Gholamreza Abrishami, Michael A. Henning:
Independent domination in subcubic graphs of girth at least six. 155-164 - Paul Brown, Trevor I. Fenner:
The size of a graph is reconstructible from any n-2 cards. 165-174 - Michael D. Barrus, Elizabeth A. Donovan:
Neighborhood degree lists of graphs. 175-183 - John Haslegrave, Richard A. B. Johnson, Sebastian Koch:
Locating a robber with multiple probes. 184-193 - Dan McQuillan, James M. McQuillan:
Strong vertex-magic and edge-magic labelings of 2-regular graphs of odd order using Kotzig completion. 194-202 - Ronald J. Gould, Kazuhide Hirohata, Ariel Keller:
On vertex-disjoint cycles and degree sum conditions. 203-212 - Adam Gray, Talmage James Reid, Xiangqian Zhou:
Clones in matroids representable over a prime field. 213-216 - S. Morteza Mirafzal:
More odd graph theory from another point of view. 217-220 - Gyula Y. Katona, Daniel Soltész, Kitti Varga:
Properties of minimally t-tough graphs. 221-231 - Dominique Perrin, Christophe Reutenauer:
Hall sets, Lazard sets and comma-free codes. 232-243 - Haodong Liu, Hongliang Lu:
A degree condition for a graph to have (a, b)-parity factors. 244-252 - Sejeong Bang:
Diameter bounds for geometric distance-regular graphs. 253-260 - Ariel Bruner, Micha Sharir:
Distinct distances between a collinear set and an arbitrary set of points. 261-265 - Sebastián Bustamante, Maya Stein:
Monochromatic tree covers and Ramsey numbers for set-coloured graphs. 266-276 - Ebrahim Ghaderpour:
Constructions for orthogonal designs using signed group orthogonal designs. 277-285
Volume 341, Number 2, February 2018
- Sukumar Das Adhikari, Luis Boza, Shalom Eliahou, M. P. Revuelta, María Isabel Sanz Domínguez:
Equation-regular sets and the Fox-Kleitman conjecture. 287-298 - Douglas R. Stinson:
Ideal ramp schemes and related combinatorial objects. 299-307 - Jiafu Mi, Xiwang Cao:
Asymptotically good quasi-cyclic codes of fractional index. 308-314 - Aras Erzurumluoglu, C. A. Rodger:
Fair and internally fair (holey) hamiltonian decompositions of. 315-323 - Hai Q. Dinh, Yun Fan, Hualu Liu, Xiusheng Liu, Songsak Sriboonchitta:
On self-dual constacyclic codes of length over. 324-335 - Fedor Petrov:
Combinatorial and probabilistic formulae for divided symmetrization. 336-340 - Ken Kamano:
Lonesum decomposable matrices. 341-349 - Yan Liu, Minjia Shi, Patrick Solé:
Two-weight and three-weight codes from trace codes over. 350-357 - Yan Zhuang:
A generalized Goulden-Jackson cluster method and lattice path enumeration. 358-379 - Vasilis Chasiotis, Stratis Kounias, Nikos Farmakis:
The D-optimal saturated designs of order 22. 380-387 - Rui Duarte, António Guedes de Oliveira:
Between Shi and Ish. 388-399 - Xiaofeng Gu, Hong-Jian Lai:
A property on reinforcing edge-disjoint spanning hypertrees in uniform hypergraphs. 400-404 - Anna A. Taranenko:
Transversals in completely reducible multiary quasigroups and in multiary quasigroups of order 4. 405-420 - Kai Fender, Hadi Kharaghani, Sho Suda:
On a class of quaternary complex Hadamard matrices. 421-426 - John Asplund, N. Bradley Fox:
Enumerating cycles in the graph of overlapping permutations. 427-438 - Seyyed Aliasghar Hosseini, Bojan Mohar:
Game of cops and robbers in oriented quotients of the integer grid. 439-450 - Henri Perret du Cray, Ignasi Sau:
Improved FPT algorithms for weighted independent set in bull-free graphs. 451-462 - Kathie Cameron, Murilo V. G. da Silva, Shenwei Huang, Kristina Vuskovic:
Structure and algorithms for (cap, even hole)-free graphs. 463-473 - József Balogh, Alexandr V. Kostochka, Xujun Liu:
Packing chromatic number of cubic graphs. 474-483 - Sebastian Milz, Lutz Volkmann:
Degree sequence conditions for maximally edge-connected and super-edge-connected digraphs depending on the clique number. 484-491 - Jessica De Silva, Kristin Heysse, Adam Kapilow, Anna Schenfisch, Michael Young:
Turán numbers of vertex-disjoint cliques in -partite graphs. 492-496 - Zhanar Berikkyzy, Steve Butler, Jay Cummings, Kristin Heysse, Paul Horn, Ruth Luo, Brent Moran:
A forest building process on simple graphs. 497-507 - Hamid Reza Daneshpajouh:
A topological lower bound for the chromatic number of a special family of graphs. 508-512 - Lili Hu, Xiangwen Li:
Every signed planar graph without cycles of length from 4 to 8 is 3-colorable. 513-519 - Dean Crnkovic:
Regular Hadamard matrices constructed from Hadamard 2-designs and conference graphs. 520-524 - Guangkui Xu, Xiwang Cao, Shanding Xu, Jingshui Ping:
Complete weight enumerators of a class of linear codes with two weights. 525-535 - Lingye Wang, R. Julian R. Abel, Dameng Deng, Jinhua Wang:
Existence of incomplete canonical Kirkman packing designs. 536-554 - You Lu, Chong Li, Rong Luo, Zhengke Miao:
List neighbor sum distinguishing edge coloring of subcubic graphs. 555-569 - Fabio Enrique Brochero Martínez, Sávio Ribas:
Extremal product-one free sequences in Dihedral and Dicyclic Groups. 570-578
Volume 341, Number 3, March 2018
- Adam Kabela:
An update on non-Hamiltonian 54-tough maximal planar graphs. 579-587 - Zhengke Miao, Yingqian Wang, Chuanni Zhang, Huajun Zhang:
Planar graphs without 3-cycles adjacent to cycles of length 3 or 5 are (3,1)-colorable. 588-599 - Mohit Kumbhat, Kevin Moss, Derrick Stolee:
Choosability with union separation. 600-605 - Hiroshi Nishiyama, Yusuke Kobayashi, Yukiko Yamauchi, Shuji Kijima, Masafumi Yamashita:
The parity Hamiltonian cycle problem. 606-626 - Carl Johan Casselgren, Hrant Khachatrian, Petros A. Petrosyan:
Some bounds on the number of colors in interval and cyclic interval edge colorings of graphs. 627-637 - Sebastián González Hermosillo de la Maza, César Hernández-Cruz:
On the existence of 3- and 4-kernels in digraphs. 638-651 - Danila D. Cherkashin:
A note on panchromatic colorings. 652-657 - Malgorzata Bednarska-Bzdega, Michael Krivelevich, Viola Mészáros, Clément Requilé:
Proper colouring Painter-Builder game. 658-664 - Aaron Berger, Christopher Chute, Matthew Stone:
Query complexity of mastermind variants. 665-671 - Jeng-Jung Wang, Lih-Hsing Hsu:
On the spanning connectivity of the generalized Petersen graphs P(n,3). 672-690 - Ik-Pyo Kim, Michael J. Tsatsomeros:
Inverse relations in Shapiro's open questions. 691-700 - Peter Danziger, S. Park:
Orthogonally Resolvable Matching Designs. 701-704 - Simone Costa, Fiorenza Morini, Anita Pasotti, Marco Antonio Pellegrini:
A problem on partial sums in abelian groups. 705-712 - Jessica McDonald, Gregory J. Puleo:
The list chromatic index of simple graphs whose odd cycles intersect in at most one edge. 713-722 - Lu Lu, Qiongxiang Huang, Jiangxia Hou, Xun Chen:
A sharp lower bound on Steiner Wiener index for trees with given diameter. 723-731 - Shengxiang Lv, Zihan Yuan:
The smallest surface that contains all signed graphs on K4,n. 732-747 - Yi Zhang, Mei Lu:
d-matching in 3-uniform hypergraphs. 748-758 - Hongwei Liu, Xiaoqiang Wang, Dabin Zheng:
On the weight distributions of a class of cyclic codes. 759-771 - Slobodan Filipovski, Robert Jajcay:
On the excess of vertex-transitive graphs of given degree and girth. 772-780 - Bartlomiej Bosek, Michal Debski, Jaroslaw Grytczuk, Joanna Sokól, Malgorzata Sleszynska-Nowak, Wiktor Zelazny:
Graph coloring and Graham's greatest common divisor problem. 781-785 - Deqiong Li, Yaoping Hou:
A note on Bartholdi zeta function and graph invariants based on resistance distance. 786-792 - Jonathan Cutler, A. J. Radcliffe:
Minimizing the number of independent sets in triangle-free regular graphs. 793-800 - Damir Vukicevic, Shuang Zhao, Jelena Sedlar, Shou-Jun Xu, Tomislav Doslic:
Global forcing number for maximal matchings. 801-809 - Rongxing Xu, Yeong-Nan Yeh, Xuding Zhu:
List colouring of graphs and generalized Dyck paths. 810-819 - Bojan Vuckovic:
Multi-set neighbor distinguishing 3-edge coloring. 820-824 - Oleg V. Borodin, Anna O. Ivanova, Olesy N. Kazak, Ekaterina I. Vasil'eva:
Heights of minor 5-stars in 3-polytopes with minimum degree 5 and no vertices of degree 6 and 7. 825-829 - Claude Carlet, Cem Güneri, Ferruh Özbudak, Patrick Solé:
A new concatenated type construction for LCD codes and isometry codes. 830-835 - Daniel A. Jaume, Gonzalo Molina:
Null decomposition of trees. 836-850 - Fabrizio Caselli, Mario Marietti:
A simple characterization of special matchings in lower Bruhat intervals. 851-862 - Nóra Frankl, Janos Nagy, Márton Naszódi:
Coverings: Variations on a result of Rogers and on the Epsilon-net theorem of Haussler and Welzl. 863-874
Volume 341, Number 4, April 2018
- Kirill Paramonov:
Cores with distinct parts and bigraded Fibonacci numbers. 875-888 - Hiranmoy Pal:
More circulant graphs exhibiting pretty good state transfer. 889-895 - Bernhard Gittenberger, Emma Yu Jin, Michael Wallner:
On the shape of random Pólya structures. 896-911 - Jia-Li Du, Yan-Quan Feng:
Pentavalent symmetric graphs admitting transitive non-abelian characteristically simple groups. 912-918 - C. A. Castillo-Guillén, Carlos Rentería-Márquez, Horacio Tapia-Recillas:
Duals of constacyclic codes over finite local Frobenius non-chain rings of length 4. 919-933 - Yichao Chen, Jonathan L. Gross, Toufik Mansour:
On the genus distributions of wheels and of related graphs. 934-945 - Jie Han, Yoshiharu Kohayakawa:
On hypergraphs without loose cycles. 946-949 - Hui Lei, Yongtang Shi, Zi-Xia Song, Tao Wang:
Star 5-edge-colorings of subcubic multigraphs. 950-956 - Ilkyoo Choi, Junehyuk Jung, Minki Kim:
On tiling the integers with 4-sets of the same gap sequence. 957-964 - Anuradha Sharma, Taranjot Kaur:
Enumeration of complementary-dual cyclic Fq-linear Fqt-codes. 965-980 - Ryan Alweiss:
Ramsey numbers of odd cycles versus larger even wheels. 981-989 - Seiken Saito:
A proof of Terras' conjecture on the radius of convergence of the Ihara zeta function. 990-996 - Marcin Krzywkowski, Stephan G. Wagner:
Graphs with few total dominating sets. 997-1009 - Liantao Lan, Yanxun Chang:
Constructions for optimal cyclic ternary constant-weight codes of weight four and distance six. 1010-1020 - Ju Zhou:
Characterization of the induced matching extendable graphs with 2n vertices and 3n edges. 1021-1031 - Dieter Rautenbach, Moritz Schneider:
The cat and the noisy mouse. 1032-1035 - Thiebout Delabie, Matthew C. H. Tointon:
The asymptotic dimension of box spaces of virtually nilpotent groups. 1036-1040 - Jimeng Xiao, Jiuqiang Liu, Shenggui Zhang:
Families of vector spaces with r-wise L-intersections. 1041-1054 - Hai Q. Dinh, Abhay Kumar Singh, Songsak Sriboonchitta:
Negacyclic codes of length 4ps over Fpm+uFpm and their duals. 1055-1071 - Joseph A. Thas:
On k-caps in PG(n, q), with q even and n≥4. 1072-1077 - Zoltán Lóránt Nagy:
Saturating sets in projective planes and hypergraph covers. 1078-1083 - Thomas Mahoney, Gregory J. Puleo, Douglas B. West:
Online sum-paintability: The slow-coloring game. 1084-1093 - António Girão, Gábor Mészáros, Stephen G. Z. Smith:
On a conjecture of Gentner and Rautenbach. 1094-1097 - Jakub Przybylo:
Distant total irregularity strength of graphs via random vertex ordering. 1098-1102 - Camino Balbuena, Diego González-Moreno, Mika Olsen:
Vertex disjoint 4-cycles in bipartite tournaments. 1103-1108 - Atsuhiro Nakamoto, Yoshiaki Oda, Mamoru Watanabe, Tomoki Yamashita:
A note on two geometric paths with few crossings for points labeled by integers in the plane. 1109-1113 - Kun Wang, Kejun Chen:
A short disproof of Euler's conjecture based on quasi-difference matrices and difference matrices. 1114-1119 - Yingzhi Tian, Jixiang Meng, Hong-Jian Lai, Liqiong Xu:
Connectivity keeping stars or double-stars in 2-connected graphs. 1120-1124 - SeungHyun Shin:
Nonexistence of certain pseudogeometric graphs. 1125-1130 - Herman J. Haverkort:
No acute tetrahedron is an 8-reptile. 1131-1135 - Seyyed Aliasghar Hosseini:
A note on k-cop-win graphs. 1136-1137 - Jason I. Brown, Ben Cameron:
On the unimodality of independence polynomials of very well-covered graphs. 1138-1143 - Ping Sun:
Enumeration formulas for standard Young tableaux of nearly hollow rectangular shapes. 1144-1149 - Tomasz Dzido, Andrzej Jastrzebski:
Turán numbers for odd wheels. 1150-1154 - Jan Ekstein, Shinya Fujita, Adam Kabela, Jakub Teska:
Bounding the distance among longest paths in a connected graph. 1155-1159 - Jin Yan, Shaohua Zhang, Junqing Cai:
Fan-type condition on disjoint cycles in a graph. 1160-1165