default search action
Discrete Mathematics, Volume 342
Volume 342, Number 1, January 2019
- Hong-Jian Lai
, Jiaao Li
Packing spanning trees in highly essentially connected graphs. 1-9 - Ali Azimi
Moore-Penrose inverse of incidence matrix of graphs with complete and cyclic blocks. 10-17 - César Bautista-Ramos
Log-concavity of some independence polynomials via a partial ordering. 18-28 - Gang Chen, Bangteng Xu:
Generalized wreath products of table algebras determined by their character tables and applications to association schemes. 29-37 - Daniel Birmajer, Juan B. Gil, Michael D. Weiner:
A family of Bell transformations. 38-54 - Adam Kabela:
Long paths and toughness of k-trees and chordal planar graphs. 55-63 - Brandon Bush, Jordan Culp, Kelly Pearson:
Perron-Frobenius theorem for hypermatrices in the max algebra. 64-73 - Andrey A. Dobrynin
Infinite family of transmission irregular trees of even order. 74-77 - Jing Huang, Shuchao Li
Further results on the expected hitting time, the cover cost and the related invariants of graphs. 78-95 - Amir Daneshgar
A class of highly symmetric graphs, symmetric cylindrical constructions and their spectra. 96-112 - Nicholas A. Loehr, Gregory S. Warrington
Quasisymmetric and Schur expansions of cycle index polynomials. 113-127 - Yuval Filmus
More complete intersection theorems. 128-142 - Laurent Beaudou
A lower bound on the size of an absorbing set in an arc-coloured tournament. 143-144 - Christina M. Mynhardt
Connected k-dominating graphs. 145-151 - Alexander E. Holroyd, Avi Levy, Moumanti Podder, Joel Spencer:
Existential monadic second order logic on random rooted trees. 152-167 - Tobias Windisch
The fiber dimension of a graph. 168-177 - Runrun Liu, Sarah Loeb, Yuxue Yin, Gexin Yu
DP-3-coloring of some planar graphs. 178-189 - Pengyu Liu
The HOMFLY polynomial of links in closed braid form. 190-200 - Mahir Bilen Can
The genesis of involutions (Polarizations and lattice paths). 201-216 - Qizhong Lin, Weiji Chen:
New upper bound for multicolor Ramsey number of odd cycles. 217-220 - Zhongmei Qin, Yongxin Lan, Yongtang Shi:
Improved bounds for rainbow numbers of matchings in plane triangulations. 221-225 - Gal Amram
An efficient shift rule for the prefer-max De Bruijn sequence. 226-232 - Daisuke Suyama, Michele Torielli
Signed graphs and the freeness of the Weyl subarrangements of type Bℓ. 233-249 - Joseph Malkoun
Determinants, choices and combinatorics. 250-255 - Valentin Gledel
Identification of points using disks. 256-269 - Makoto Araya, Masaaki Harada:
On the classification of linear complementary dual codes. 270-278 - Laihao Ding, Guan-Huei Duh, Guanghui Wang, Tsai-Lien Wong, Jianliang Wu, Xiaowei Yu, Xuding Zhu:
Graphs are (1, Δ+1)-choosable. 279-284
Volume 342, Number 2, February 2019
- Xuemei Zhang, Yaojun Chen, T. C. Edwin Cheng
On three color Ramsey numbers R(C4, C4, K1, n). 285-291 - Sascha Fischer:
On the pebbling number of Cm×Cn in case of even parity. 292-313 - Kan Hu
Complete regular dessins of odd prime power order. 314-325 - Feodor F. Dragan, Heather M. Guarnera
Obstructions to a small hyperbolicity in Helly graphs. 326-338 - Lily Chen, Kecai Deng, Gexin Yu
Strong edge-coloring for planar graphs with large girth. 339-343 - Yingzhi Tian
Nonseparating trees in 2-connected graphs and oriented trees in strongly connected digraphs. 344-351 - Kostas Manes, Ioannis Tasoulas, Aristidis Sapounakis, Panagiotis Tsikouras:
Counting pairs of noncrossing binary paths: A bijective approach. 352-359 - Jessalyn Bolkema, Corbin Groothuis:
Hunting rabbits on the hypercube. 360-372 - Carlo Brunetta
On hidden sums compatible with a given block cipher diffusion layer. 373-386 - Imran Allie
Oddness to resistance ratios in cubic graphs. 387-392 - Dejing Lv
Covering the boundary of a convex body with its smaller homothetic copies. 393-404 - Guangzhou Chen
Ideal ramp schemes and augmented orthogonal arrays. 405-411 - Yuan Cao, Yonglin Cao
Type 2 constacyclic codes over F2m[u]∕〈u3〉 of oddly even length. 412-426 - Zhilin Zhang, Shenglin Zhou
Flag-transitive point-quasiprimitive automorphism groups of 2-designs with λ≤4. 427-432 - Patrick Adams, Yuri Nikolayevsky
Planar bipartite biregular degree sequences. 433-440 - Huiqiu Lin, Xiaogang Liu
Graphs determined by their Aα-spectra. 441-450 - Tri Lai, Ranjan Rohatgi:
Enumeration of lozenge tilings of a hexagon with a shamrock missing on the symmetry axis. 451-472 - Michal Walicki:
Kernels of digraphs with finitely many ends. 473-486 - Yunchao Hong, Zhongxun Zhu, Amu Luo:
Extremal graphs with diameter 2 for two indices on resistance-distance. 487-497 - Jakub Przybylo
A note on the weak (2, 2)-Conjecture. 498-504 - Fan Wang
Perfect matchings extend to two or more hamiltonian cycles in hypercubes. 505-510 - Maria Axenovich, Philip Dörr, Jonathan Rollin
Induced and weak induced arboricities. 511-519 - Lindsey-Kay Lauderdale:
On the fixing sets of dihedral groups. 520-528 - Yue Cai, Catherine Yan
Counting with Borel's triangle. 529-539 - Calvin Deng:
Even (s̄, t̄)-core partitions and self-associate characters of S̃n. 540-545 - Hadi Kharaghani
Balancedly splittable Hadamard matrices. 546-561 - Rui Duarte
Partial parking functions. 562-571 - Faruk Göloglu
Proofs of several conjectures on linear codes from Boolean functions. 572-583 - Evgeniy Krasko, Alexander Omelchenko
Enumeration of r-regular maps on the torus. Part I: Rooted maps on the torus, the projective plane and the Klein bottle. Sensed maps on the torus. 584-599 - Evgeniy Krasko, Alexander Omelchenko
Enumeration of r-regular maps on the torus. Part II: Unsensed maps. 600-614
Volume 342, Number 3, March 2019
- Adriana Ortiz-Rodríguez, Federico Sánchez-Bringas:
On some combinatorial formulae coming from Hessian Topology. 615-622 - Runrun Liu, Xiangwen Li
Every planar graph without 4-cycles adjacent to two triangles is DP-4-colorable. 623-627 - Mircea Merca
Some notes on the (q, t)-Stirling numbers. 628-634 - Ilkyoo Choi
Characterization of forbidden subgraphs for bounded star chromatic number. 635-642 - Bo Ning
The Randić index and signless Laplacian spectral radius of graphs. 643-653 - Martin C. Cooper
The epistemic gossip problem. 654-663 - Antonio Cossidente, Giuseppe Marino
The covering radius of PGL(3, q). 664-670 - Yansheng Wu
Weight enumerators of reducible cyclic codes and their dual codes. 671-682 - Jakub Przybylo
Distant total sum distinguishing index of graphs. 683-688 - Jiangmin Pan, Fugang Yin
Arc-transitive Cayley graphs on non-abelian simple groups with soluble vertex stabilizers and valency seven. 689-696 - Adrian M. Nelson:
Induction theorems for generalized Bhaskar Rao designs. 697-714 - Hao Sun
A formula about W-operator and its application to Hurwitz number. 715-722 - Carolyn Chun, Deborah Chun, Tyler Moss, Steven D. Noble
The e-exchange basis graph and matroid connectedness. 723-725 - Kira V. Adaricheva
Representation of convex geometries by circles on the plane. 726-746 - Dragan Masulovic
Canonizing structural Ramsey theorems. 747-759 - Xinmin Hou
The size of 3-uniform hypergraphs with given matching number and codegree. 760-767 - Rögnvaldur G. Möller, Primoz Potocnik, Norbert Seifter
Sharply k-arc-transitive-digraphs: Finite and infinite examples. 768-776 - Charles A. Cusack, Airat Bekmetjev, Mark Powers:
Two-pebbling and odd-two-pebbling are not equivalent. 777-783 - Vakhtang Lomadze:
The predictable degree property and minimality in multidimensional convolutional coding. 784-792 - John McGill, M. A. Ollis:
On the asymptotic growth of bipartite graceful permutations. 793-799 - Yan Li, Jisoo Yoo, Daeyeoul Kim:
On a question of Sury. 800-806 - Tanja Gologranc, Polona Repolusk:
Toll number of the strong product of graphs. 807-814 - Aaron Berger
An analogue of the Erdős-Ginzburg-Ziv Theorem over Z. 815-820 - Yongxin Lan, Henry Liu, Zhongmei Qin, Yongtang Shi
Degree powers in graphs with a forbidden forest. 821-835 - Yiting Jiang
Colouring of generalized signed triangle-free planar graphs. 836-843 - Satoshi Yoshiara:
Splitness of the Veronesean and the Taniguchi dual hyperovals. 844-854 - Sophie Huczynska
Weighted external difference families and R-optimal AMD codes. 855-867 - Katharina T. Huber, Jack H. Koolen
The polytopal structure of the tight-span of a totally split-decomposable metric. 868-878 - Jangwon Yie
k-centric Turán numbers and multi-color Ramsey numbers for a loose 3-uniform path of length 3. 879-887 - Kai Wang
Efficient counting of degree sequences. 888-897 - Rong Wu, Baogang Xu:
A note on chromatic number of (cap, even hole)-free graphs. 898-903 - Ming-Zhu Chen
Erdős-Gallai stability theorem for linear forests. 904-916 - David Ellison
The impact of loops on the game of cops and robbers on graphs. 917-925
Volume 342, Number 4, April 2019
- John Asplund
On the k-planar local crossing number. 927-933 - José D. Alvarado, Simone Dantas
On the maximum number of minimum dominating sets in forests. 934-942 - François Dross
A lower bound on the order of the largest induced linear forest in triangle-free planar graphs. 943-950 - Sandi Klavzar
Domination game and minimal edge cuts. 951-958 - Christopher Duffy
Oriented colourings of graphs with maximum degree three and four. 959-974 - Zhibing Chen, Mordecai J. Golin
The transfer matrices and the capacity of the 2-dimensional (1, ∞)-runlength limited constraint. 975-987 - Noga Alon, Clara Shikhelman:
H-free subgraphs of dense graphs maximizing the number of cliques and their blow-ups. 988-996 - Jean-Luc Baril, Sergey Kirgizov, Armen Petrossian:
Enumeration of Łukasiewicz paths modulo some patterns. 997-1005 - Giuseppe Mazzuoccolo
Rainbow spanning tree decompositions in complete graphs colored by cyclic 1-factorizations. 1006-1016 - Bostjan Bresar, Mario Valencia-Pabon:
Independence number of products of Kneser graphs. 1017-1027 - Shin-ya Kadota, Tomokazu Onozuka, Yuta Suzuki
The graph Ramsey number R(Fℓ, K6). 1028-1037 - Michael A. Bekos
Edge partitions of optimal 2-plane and 3-plane graphs. 1038-1047 - John Engbers
Maximizing and minimizing the number of generalized colorings of trees. 1048-1055 - Emeric Gioan, Chi Ho Yuen:
On the number of circuit-cocircuit reversal classes of an oriented matroid. 1056-1059 - Ajit A. Diwan:
The minimum forcing number of perfect matchings in the hypercube. 1060-1062 - Éva Czabarka
A degree condition for diameter two orientability of graphs. 1063-1065 - Zhi-Hong Chen:
Hamiltonicity of claw-free graphs and Fan-type conditions. 1066-1078 - Miao Liang, Lijun Ji:
Optimal ternary constant-composition codes with weight four and distance three. 1079-1088 - Shira Zerbib:
The (p, q) property in families of d-intervals and d-trees. 1089-1097 - Aart Blokhuis, István Kovács, Gábor Péter Nagy
Inherited conics in Hall planes. 1098-1107 - Fenjin Liu
New families of graphs determined by their generalized spectrum. 1108-1112 - Aaron Berger, Danielle Wang
Modified Erdös-Ginzburg-Ziv constants for Z∕nZ and (Z∕nZ)2. 1113-1116 - Dongchun Han, Hanbin Zhang
On generalized Erdős-Ginzburg-Ziv constants of Cnr. 1117-1127 - Zai Ping Lu, Er Jian Xu:
On arc-transitive Cayley digraphs of out-valency 3. 1128-1138 - Aleksander Vesel:
Cube-complements of generalized Fibonacci cubes. 1139-1146 - Timothy Sun:
A simple construction for orientable triangular embeddings of the complete graphs on 12s vertices. 1147-1151 - Bohua Zhu, Junling Zhou
New lower bounds on 2-spontaneous emission error designs. 1152-1158 - Seyed Hassan Alavi
Symmetric designs and four dimensional projective special unitary groups. 1159-1169 - Li Wang:
Setwise intersecting families in classical Coxeter groups. 1170-1185 - Yangyang Cheng, Qiang Sun, Ta Sheng Tan
Rainbow Hamiltonian cycles in strongly edge-colored graphs. 1186-1190 - Dylan Bruce, Zi-Xia Song
Gallai-Ramsey numbers of C7 with multiple colors. 1191-1194 - Maria Axenovich, Mónika Csikós
Induced saturation of graphs. 1195-1212 - Paul Dorbec
Cutting lemma and union lemma for the domination game. 1213-1222
Volume 342, Number 5, May 2019
- Qiaoping Guo, Wei Meng:
On cycles in regular 3-partite tournaments. 1223-1232 - James Tuite:
Digraphs with degree two and excess two are diregular. 1233-1244 - Maria Axenovich, András Gyárfás:
A note on Ramsey numbers for Berge-G hypergraphs. 1245-1252 - Jian-Yi Shi:
Reduced expressions for the elements in a Bruhat interval. 1253-1260 - Peter Dankelmann
Average eccentricity, k-packing and k-domination in graphs. 1261-1274 - Endre Boros, Ondrej Cepek
Separable discrete functions: Recognition and sufficient conditions. 1275-1292 - Marthe Bonamy, Thomas J. Perrett
Gallai's path decomposition conjecture for graphs of small maximum degree. 1293-1299 - Chen Chen, Shuchao Li
Relation between the H-rank of a mixed graph and the rank of its underlying graph. 1300-1309 - Jimeng Xiao, Huajun Zhang, Shenggui Zhang:
Fractional chromatic numbers of tensor products of three graphs. 1310-1317 - Clément Charpentier, Simone Dantas
On Nordhaus-Gaddum type inequalities for the game chromatic and game coloring numbers. 1318-1324 - Yinghui Wang:
A variant of the Stanley depth for multisets. 1325-1335 - Klaus Metsch
On the smallest non-trivial tight sets in Hermitian polar spaces H(d, q2), d even. 1336-1342 - Tomasz Bartnicki
Generalized arboricity of graphs with large girth. 1343-1350 - Alexandr Valyuzhenich
Minimum supports of functions on the Hamming graphs with spectral constraints. 1351-1360 - Christian Pech
On a family of highly regular graphs by Brouwer, Ivanov, and Klin. 1361-1377 - Christina Graves
Vertex-minimal graphs with dihedral symmetry II. 1378-1391 - Jie Hu, Guanghui Wang, Jianliang Wu
Adjacent vertex distinguishing total coloring of planar graphs with maximum degree 9. 1392-1402 - Fábio Botler
Gallai's path decomposition conjecture for triangle-free planar graphs. 1403-1414 - Laura Ciobanu, Alexander Kolpakov
Free subgroups of free products and combinatorial hypermaps. 1415-1433 - Seungsang Oh
State matrix recursion method and monomer-dimer problem. 1434-1445 - Shanding Xu, Xiwang Cao, Jiafu Mi, Chunming Tang:
A new family of optimal FHS sets with composite lengths. 1446-1455 - Hai Q. Dinh, Xiaoqiang Wang, Hongwei Liu, Songsak Sriboonchitta:
On the Hamming distances of repeated-root constacyclic codes of length 4ps. 1456-1470 - Ming Chen, Jie Hu, Xiaowei Yu, Shan Zhou
List strong edge coloring of planar graphs with maximum degree 4. 1471-1480 - Antonio Cossidente, Francesco Pavese
Relative m-ovoids of elliptic quadrics. 1481-1488 - Jesse Geneson
Forbidden arithmetic progressions in permutations of subsets of the integers. 1489-1491 - Noah Kravitz:
Harborth constants for certain classes of metacyclic groups. 1492-1509 - G. E. Farr:
Binary functions, degeneracy, and alternating dimaps. 1510-1519 - János Barát
Decomposition of cubic graphs related to Wegner's conjecture. 1520-1527
Volume 342, Number 6, June 2019
- Brant Jones
Avoiding patterns and making the best choice. 1529-1545 - Panpan Wang, Junqing Cai
Spanning trees with at most 4 leaves in K1, 5-free graphs. 1546-1552 - Cory Palmer
Turán numbers for Berge-hypergraphs and related extremal problems. 1553-1563 - Shuchao Li
On σ-span and F-span of trees and full binary trees. 1564-1576 - Sajal Kumar Mukherjee, Sudip Bera:
Combinatorial proofs of the Newton-Girard and Chapman-Costas-Santos identities. 1577-1580 - Per Alexandersson
The cone of cyclic sieving phenomena. 1581-1601 - Christoph Brause, Premysl Holub, Adam Kabela, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
On forbidden induced subgraphs for K1, 3-free perfect graphs. 1602-1608 - Luis Montejano:
Rainbow simplices in triangulations of manifolds. 1609-1612 - Yan Cao, Guantao Chen, Suyun Jiang, Huiqing Liu, Fuliang Lu:
Average degrees of edge-chromatic critical graphs. 1613-1623 - Samuele Giraudo
Colored operads, series on colored operads, and combinatorial generating systems. 1624-1657 - Ekaterina A. Vassilieva, Alina R. Mayorova
A new link between the descent algebra of type B, domino tableaux and Chow's quasisymmetric functions. 1658-1673 - Alexander Diaz-Lopez
Descent polynomials. 1674-1686 - Felix Bock, Dieter Rautenbach:
On matching numbers of tree and bipartite degree sequences. 1687-1695 - Natalie C. Behague
Semi-perfect 1-factorizations of the hypercube. 1696-1702 - Zejun Huang, Zhenhua Lyu, Pu Qiao:
A Turán problem on digraphs avoiding distinct walks of a given length with the same endpoints. 1703-1717 - Muhuo Liu
Spectral results on Hamiltonian problem. 1718-1730 - Yi Zhang, Mei Lu:
Matching in 3-uniform hypergraphs. 1731-1737 - Sean English
Saturation of Berge hypergraphs. 1738-1761 - Brice Huang:
An upper bound on the number of (132, 213)-avoiding cyclic permutations. 1762-1771 - Alexander D. Mednykh, Ilya A. Mednykh
The number of spanning trees in circulant graphs, its arithmetic properties and asymptotic. 1772-1781 - Yue Wang, Jianliang Wu
On the (3, 1)-choosability of planar graphs without adjacent cycles of length 5, 6, 7. 1782-1791 - Yu Qing Chen, Teng Fang
Affine flag graphs and classification of a family of symmetric graphs with complete quotients. 1792-1798 - Kecai Deng
Caterpillars with maximum degree 3 are antimagic. 1799-1801 - Song-Tao Guo, Hailong Hou, Yong Xu:
Hexavalent half-arc-transitive graphs of order 9p. 1802-1811 - Olga Varghese:
Planarity of Cayley graphs of graph products of groups. 1812-1819 - Oleg V. Borodin, Anna O. Ivanova
An improvement of Lebesgue's description of edges in 3-polytopes and faces in plane quadrangulations. 1820-1827 - Sungsik Kang, Boram Park
On incidence choosability of cubic graphs. 1828-1837 - Miaomiao Han
List star edge coloring of k-degenerate graphs. 1838-1848 - Péter Komjáth
Minimal covering sets for infinite set systems. 1849-1856 - Dong-Dong Hou, Yan-Quan Feng
Existence of regular 3-hypertopes with 2n chambers. 1857-1863
Volume 342, Number 7, July 2019
- Joseph Briggs
Inverting the Turán problem. 1865-1884 - Clemens Huemer
Matching points with disks with a common intersection. 1885-1893 - Yusuf Civan
Bounding the chromatic number of squares of K4-minor-free graphs. 1894-1903 - Hong-Jian Lai
On r-hued colorings of graphs without short induced paths. 1904-1911 - Andrew Kwon:
A note on minimal additive complements of integers. 1912-1918 - Zoltán Füredi, Alexandr V. Kostochka, Ruth Luo
A variation of a theorem by Pósa. 1919-1923 - Rongcun Qin, Hengming Zhao:
Constructions for optimal (u×v, {3, 4}, 1, Q)-OOSPCs. 1924-1948 - Arturas Dubickas
Fractional parts of powers of large rational numbers. 1949-1955 - Shinya Fujita, Bo Ning
On sufficient conditions for rainbow cycles in edge-colored graphs. 1956-1965 - Ryan Blair, Alexandra Kjuchukova, Makoto Ozawa
The incompatibility of crossing number and bridge number for knot diagrams. 1966-1978 - Ryota Matsubara, Haruhide Matsuda
[a, b]-factors of graphs on surfaces. 1979-1988 - Xueying Shi
New quantum MDS codes with large minimum distance and short length from generalized Reed-Solomon codes. 1989-2001 - Kenjiro Takazawa
A generalized-polymatroid approach to disjoint common independent sets in two matroids. 2002-2011 - Michael Ferrara, Zoltán Füredi, Sogol Jahanbekam
List-distinguishing Cartesian products of cliques. 2012-2022 - Xiao-Nan Lu
Grid-block difference families and related combinatorial structures. 2023-2032 - Richard P. Stanley, Fabrizio Zanello:
A note on the asymptotics of the number of O-sequences of given length. 2033-2034 - Marco Aldi
Arithmetical Semirings. 2035-2047 - Zilong Yan, Yuejian Peng:
λ-perfect hypergraphs and Lagrangian densities of hypergraph cycles. 2048-2059 - Hanyuan Deng, Selvaraj Balachandran, Suresh Elumalai
Some tight bounds for the harmonic index and the variation of the Randić index of graphs. 2060-2065 - Slobodan Filipovski, Alejandra Ramos-Rivera, Robert Jajcay:
On biregular bipartite graphs of small excess. 2066-2076 - Yuan Cao, Yonglin Cao
An explicit representation and enumeration for self-dual cyclic codes over F2m+uF2m of length 2s. 2077-2091 - Xiaodan Chen
On minimally 2-(edge)-connected graphs with extremal spectral radius. 2092-2099 - Olga Varghese:
On coherence of graph products of groups and Coxeter groups. 2100-2105 - Gang Chen, Yongxin Lan, Zi-Xia Song
Planar anti-Ramsey numbers of matchings. 2106-2111 - Victor J. W. Guo
A symmetric generalization of an identity of Andrews and Yee. 2112-2115 - Xihe Li
Complete graphs and complete bipartite graphs without rainbow path. 2116-2126 - Christoph Brause, Stefan Ehard, Dieter Rautenbach:
Bounds and extremal graphs for degenerate subsets, dynamic monopolies, and partial incentives. 2127-2133 - Hiroshi Nozaki:
Largest regular multigraphs with three distinct eigenvalues. 2134-2138 - Gwo Dong Lin:
On powers of the Catalan number sequence. 2139-2147 - Ervin Györi, Gyula Y. Katona
The optimal pebbling number of staircase graphs. 2148-2157 - Yan-An Hwang
Erratum to "Ranking by outdegree for directed graphs" [Discrete Math. 271 (2003) 261-270]. 2158-2160 - Vasilis Chasiotis
Corrigendum to "The D-optimal saturated designs of order 22" [Discrete Math. 341 (2018) 380-387]. 2161 - Valery A. Liskovets
Corrigendum to "Enumeration of eulerian and unicursal planar maps" [Discrete Math. 282 (2004) 208-221]. 2162-2163
Volume 342, Number 8, August 2019
- Patrick Bennett
Weighted Turán problems with applications. 2165-2172 - Brian Alspach, Afsaneh Khodadadpour, Donald L. Kreher
On factor-invariant graphs. 2173-2178 - Yun Gao
The dual code of any (δ+αu2)-constacyclic code over F2m[u]∕〈u4〉 of oddly even length. 2179-2191 - Jorge Alberto Olarte, Francisco Santos
Short proof of two cases of Chvátal's conjecture. 2192-2194 - John Asplund
Enclosings of decompositions of complete multigraphs in 2-edge-connected r-factorizations. 2195-2203 - Pablo Henrique Perondi
Exact Ramsey numbers in multipartite graphs arising from Hadamard matrices and strongly regular graphs. 2204-2212 - Andrea C. Burgess, Peter Danziger, Tommaso Traetta:
The Hamilton-Waterloo Problem with even cycle lengths. 2213-2222 - Francesco Belardo
On the multiplicity of α as an Aα(Γ)-eigenvalue of signed graphs with pendant vertices. 2223-2233 - Benjamin Friedman, Sean McGuinness:
The Alon-Tarsi conjecture: A perspective on the main results. 2234-2253 - Will Agnew-Svoboda, Alana Huszar, Erin McNicholas, Jeffrey Schreiner-McGraw, Colin L. Starr, Corrine Yap
Unipancyclic matroids. 2254-2269 - Yi Wang
Analytic aspects of Delannoy numbers. 2270-2277 - Zhibin Du
On the continuity of the maximum size of P-sets of acyclic matrices. 2278-2282 - C. A. Castillo-Guillén, Carlos Rentería-Márquez, Eliseo Sarmiento Rosales, Horacio Tapia-Recillas, Rafael H. Villarreal
The dual of a constacyclic code, self dual, reversible constacyclic codes and constacyclic codes with complementary duals over finite local Frobenius non-chain rings with nilpotency index 3. 2283-2296 - Yuefang Sun, Gregory Z. Gutin, Jiangdong Ai:
Arc-disjoint strong spanning subdigraphs in compositions and products of digraphs. 2297-2305 - Vaidy Sivaraman
An application of the Gyárfás path argument. 2306-2307 - Yuan Yuan, Rong-Xia Hao
Toughness condition for the existence of all fractional (a, b, k)-critical graphs. 2308-2314 - Norifumi Ojiro:
A 40-dimensional extremal Type II lattice with no 4-frames. 2315-2323 - Tao Feng
On the existence of O'Nan configurations in ovoidal Buekenhout-Metz unitals in PG(2, q2). 2324-2332 - Yuxue Yin, Gexin Yu
Planar graphs without cycles of lengths 4 and 5 and close triangles are DP-3-colorable. 2333-2341 - Yuan Chen, Pham Hoang Ha, Dang Dinh Hanh:
Spanning trees with at most 4 leaves in K1, 5-free graphs. 2342-2349 - Chen Song, Rong-Xia Hao:
Antimagic orientations of disconnected even regular graphs. 2350-2355 - Jason I. Brown
On the reliability roots of simplicial complexes and matroids. 2356-2370 - Hemanshu Kaul
Proportional choosability: A new list analogue of equitable coloring. 2371-2383 - Gholamreza Abrishami, Freydoon Rahbarnia
A note on the smallest connected non-traceable cubic bipartite planar graph. 2384-2392 - Ali Azimi
The Moore-Penrose inverse of the incidence matrix of complete multipartite and bi-block graphs. 2393-2401 - Shao-Hua Liu
The operators Fi on permutations, 132-avoiding permutations and inversions. 2402-2414 - Emanuele Munarini:
Pell graphs. 2415-2428 - Masao Tsugaki, Takamasa Yashima
A degree sum condition for the existence of an S-path-system in a bipartite graph. 2429-2438 - Oleg V. Borodin, Anna O. Ivanova
Describing the neighborhoods of 5-vertices in 3-polytopes with minimum degree 5 and no vertices of degree from 6 to 8. 2439-2444 - Alexandru Dimca
Freeness for 13 lines arrangements is combinatorial. 2445-2453
Volume 342, Number 9, September 2019
- Charles J. Colbourn, Douglas R. Stinson
Constructions of optimal orthogonal arrays with repeated rows. 2455-2466 - Akihiro Higashitani, Kazuki Kurimoto:
Permutations with small maximal k-consecutive sums. 2467-2481 - Yunshu Gao, Xiaoyao Lin, Hong Wang:
Vertex-disjoint double chorded cycles in bipartite graphs. 2482-2492 - Se-Jin Oh, Travis Scrimshaw
Identities from representation theory. 2493-2541 - Ademir Hujdurovic
Graphs with Cayley canonical double covers. 2542-2548 - Mark Pankov
On two types of Z-monodromy in triangulations of surfaces. 2549-2558 - Ji-Ming Guo
Sharp upper bounds of the spectral radius of a graph. 2559-2563 - David Gonzalez
An upper bound for the restricted online Ramsey number. 2564-2569 - Alice L. L. Gao, Matthew H. Y. Xie
Schur positivity and log-concavity related to longest increasing subsequences. 2570-2578 - Sven C. Polak
Semidefinite programming bounds for Lee codes. 2579-2589 - Alan J. Cain, António Malheiro
Combinatorics of patience sorting monoids. 2590-2611 - Bernard Lidický, Kacy Messerschmidt, Riste Skrekovski
Facial unique-maximum colorings of plane graphs with restriction on big vertices. 2612-2617 - Josefran de Oliveira Bastos, Fabrício Siqueira Benevides
Counting Gallai 3-colorings of complete graphs. 2618-2631 - Zi-Xia Song:
Erdős-Lovász Tihany Conjecture for graphs with forbidden holes. 2632-2635 - Jianfeng Wang
Graph energy based on the eccentricity matrix. 2636-2646 - Shigeki Matsutani
The partial differential coefficients for the second weighted Bartholdi zeta function of a graph. 2647-2663 - Molly W. Dunkum
Edge integrity of nearest neighbor graphs and separator theorems. 2664-2679 - Robin van der Veer
Combinatorial analogs of topological zeta functions. 2680-2693 - Ying Wang, Guoce Xin:
Hankel determinants for convolution powers of Catalan numbers. 2694-2716 - Anthony B. Evans, Stephen M. Gagola III:
The strong admissibility of finite Moufang loops. 2717-2725 - S. Ganesamurthy
A C5-decomposition of the λ-fold line graph of the complete graph. 2726-2732 - Libby Taylor:
On the regularity of orientable matroids. 2733-2737 - Ademir Hujdurovic
Detecting strong cliques. 2738-2750 - Matthias Keller
A new discrete Hopf-Rinow theorem. 2751-2757
Volume 342, Number 10, October 2019
- Sebastian M. Cioaba
Preface to the Special Issue of Discrete Mathematics: Dedicated to the Algebraic and Extremal Graph Theory Conference, August 7-10, 2017, University of Delaware, Newark, USA. 2759 - Willem H. Haemers
Spectral characterization of mixed extensions of small graphs. 2760-2764 - Gabriel Coutinho
Quantum walks and the size of the graph. 2765-2769 - Lihong Qiu, Yizhe Ji, Wei Wang:
A new arithmetic criterion for graphs being determined by their generalized Q-spectrum. 2770-2782 - Felix Lazebnik:
The maximum number of colorings of graphs of given order and size: A survey. 2783-2791 - Cristina Dalfó
On the Randić index of graphs. 2792-2796 - Ebrahim Ghorbani:
Cographs: Eigenvalues and Dilworth number. 2797-2803 - Zhanar Berikkyzy
On the edit distance of powers of cycles. 2804-2817 - Gary R. W. Greaves
Another construction of edge-regular graphs with regular cliques. 2818-2820 - Or Eisenberg, Mark Kempton, Gabor Lippner
Pretty good quantum state transfer in asymmetric graphs via potential. 2821-2833 - Allison J. Ganger, Shannon N. Golden, Brian G. Kronenthal
On the girth of two-dimensional real algebraically defined graphs. 2834-2842 - Michael Tait:
On a problem of Neumann. 2843-2845 - Chris D. Godsil
Using the existence of t-designs to prove Erdős-Ko-Rado. 2846-2849 - Aida Abiad, Steve Butler, Willem H. Haemers
Graph switching, 2-ranks, and graphical Hadamard matrices. 2850-2855 - Vladislav Taranchuk
The anti-Ramsey problem for the Sidon equation. 2856-2866 - André Kündgen
Expected reliability of communication protocols. 2867-2874 - Aida Abiad, Gabriel Coutinho
On the k-independence number of graphs. 2875-2885 - William M. Kantor:
Automorphism groups of designs with λ=1. 2886-2892 - Shaohui Zhai, Erling Wei, Jinghua He, Dong Ye
Homeomorphically irreducible spanning trees in hexangulations of surfaces. 2893-2899 - Encarnación Abajo, Camino Balbuena
Improving bounds on the order of regular graphs of girth 5. 2900-2910 - Mokshay Madiman, Liyao Wang, Jae Oh Woo
Majorization and Rényi entropy inequalities via Sperner theory. 2911-2923 - Mohammad Adm, Shaun M. Fallat:
The maximum multiplicity of the largest k-th eigenvalue in a matrix whose graph is acyclic or unicyclic. 2924-2950
Volume 342, Number 11, November 2019
- Vaidy Sivaraman, Daniel C. Slilaty:
The graphs that have antivoltages using groups of small order. 2951-2965 - Jeffrey B. Remmel, Sittipong Thamrongpairoj:
The combinatorial properties of the Benoumhani polynomials for the Whitney numbers of Dowling lattices. 2966-2983 - Lily Chen, Runrun Liu, Gexin Yu, Ren Zhao, Xiangqian Zhou:
DP-4-colorability of two classes of planar graphs. 2984-2993 - Joshua D. Laison, Erin McNicholas, Nicole S. Seaders:
Base size sets and determining sets. 2994-2999 - Jan Goedgebeur
On the minimum leaf number of cubic graphs. 3000-3005 - Hong-Jian Lai, Mingquan Zhan, Taoye Zhang, Ju Zhou:
On s-hamiltonian line graphs of claw-free graphs. 3006-3016 - Shengxiang Lv, Yichao Chen:
Constructing a minimum genus embedding of the complete tripartite graph Kn, n, 1 for odd n. 3017-3024 - Juan Wang, Lianying Miao:
Acyclic coloring of graphs with maximum degree at most six. 3025-3033 - Andrii Arman, Bill Kay
A note on weak delta systems. 3034-3042 - Taras O. Banakh, Dominic van der Zypen:
Minimal covers of infinite hypergraphs. 3043-3046 - Chengfu Qin
A constructive characterization of contraction critical 8-connected graphs with minimum degree 9. 3047-3056 - Khodakhast Bibak
A generalization of Schönemann's theorem via a graph theoretic method. 3057-3061 - Hai Q. Dinh, Xiaoqiang Wang, Hongwei Liu, Songsak Sriboonchitta:
On the symbol-pair distances of repeated-root constacyclic codes of length 2ps. 3062-3078 - Rigoberto Flórez, Leandro Junes, José Luis Ramírez:
Enumerating several aspects of non-decreasing Dyck paths. 3079-3097 - Liantao Lan, Yanxun Chang:
Two-weight codes: Upper bounds and new optimal constructions. 3098-3113 - Yu Tian, Mengxiang You, Suiming Shang:
Existence results for a fourth-order discrete boundary value problem with a parameter. 3114-3122 - François Dross, Borut Luzar
Note on 3-choosability of planar graphs with maximum degree 4. 3123-3129 - Dániel Gerbner, Abhishek Methuku, Máté Vizer:
Generalized Turán problems for disjoint copies of graphs. 3130-3141 - Antoine Dailly, Florent Foucaud, Adriana Hansberg:
Strengthening the Murty-Simon conjecture on diameter 2 critical graphs. 3142-3159 - Xiaowei Yu, Yulin Chang, Shan Zhou:
Antimagic orientation of Halin graphs. 3160-3165 - Xiangli Kong, Shudi Yang:
Complete weight enumerators of a class of linear codes with two or three weights. 3166-3176 - Anand Babu
Bounds for the Graham-Pollak theorem for hypergraphs. 3177-3181 - Neil J. Y. Fan:
Standard Rothe tableaux. 3182-3193 - Miklós Bóna
Pattern avoidance in permutations and their squares. 3194-3200 - André C. Silva
Graphs with at most one crossing. 3201-3207 - Oleg V. Borodin, Anna O. Ivanova
Describing faces in 3-polytopes with no vertices of degree from 5 to 7. 3208-3215 - Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Planar anti-Ramsey numbers of paths and cycles. 3216-3224 - Runrun Liu, Martin Rolek, Gexin Yu:
Minimum degree condition for a graph to be knitted. 3225-3228 - François Dross, Pascal Ochem:
Vertex partitions of (C3, C4, C6)-free planar graphs. 3229-3236 - Stephen W. Drury, Huiqiu Lin:
Corrigendum to "Colorings and spectral radius of digraphs" [Discrete Math. 339 (1) (2016) 327-332]. 3237-3241
Volume 342, Number 12, December 2019
- Ilkyoo Choi, Gexin Yu, Xia Zhang:
Planar graphs with girth at least 5 are (3, 4)-colorable. - Christian Bosse:
A note on Hadwiger's conjecture for W5-free graphs with independence number two. - Jirapha Limbupasiriporn:
Binary codes from Paley graphs of prime-power-square order. - Madeline Brandt, William Dickinson, Anna Victoria Ellsworth, Jennifer Kenkel, Hanson Smith
Optimal packings of two to four equal circles on any flat torus. - Jiangmin Pan, Ci Xuan Wu:
On edge-primitive graphs of order twice a prime power. - Djordje Baralic, Jelena Ivanovic
A simple permutoassociahedron. - Péter Komjáth, Saharon Shelah
Universal graphs omitting finitely many finite graphs. - Hongliang Lu, Mikio Kano, Qinglin Yu:
Characterizations of graphs G having all [1, k]-factors in kG. - Kiyoshi Ando:
A local condition for k-contractible edges. - Matt Noble, Shayne N. Richardson:
Balls, bins, and embeddings of partial k-star designs. - Stéphane Bessy, Dieter Rautenbach:
Relating broadcast independence and independence. - Matthias Hamann
Self-embeddings of trees. - Yongxin Lan, Yongtang Shi, Zi-Xia Song:
Extremal Theta-free planar graphs. - Fabio Enrique Brochero Martínez, Lucas Reis, Lays Silva-Jesus:
Factorization of composed polynomials and applications. - Kasper Szabo Lyngsie, Martin Merker
Spanning trees without adjacent vertices of degree 2. - Hai Q. Dinh, Saroj Rani:
Structure of some classes of repeated-root constacyclic codes of length 2Kℓmpn. - Koji Chinen:
Divisible formal weight enumerators and extremal polynomials not satisfying the Riemann hypothesis. - Noah Kravitz:
On the number of simultaneous core partitions with d-distinct parts. - Bogdan Nica:
A relative bound for independence. - Takayuki Hibi, Akiyoshi Tsuchiya
Gorenstein simplices with a given δ-polynomial. - Michael Skotnica:
No-three-in-line problem on a torus: Periodicity. - Fuyin Tian, Shixin Zhu:
Some new quantum MDS codes from generalized Reed-Solomon codes. - Dongchun Han, Hanbin Zhang
Zero-sum invariants on finite abelian groups with large exponent. - Joe Gildea
An altered four circulant construction for self-dual codes from group rings and new extremal binary self-dual codes I. - Lon H. Mitchell
Generating infinitely many satisfactory colorings of positive integers. - Yuval Filmus, Ferdinand Ihringer:
Boolean constant degree functions on the slice are juntas. - Shohei Satake
A constructive solution to a problem of ranking tournaments. - Shao-Hua Liu
An involution on increasing trees. - Padraig Ó Catháin, Eric Swartz:
Homomorphisms of matrix algebras and constructions of Butson-Hadamard matrices. - Irene Pivotto, Gordon F. Royle
Highly-connected planar cubic graphs with few or many Hamilton cycles. - Yaoping Hou, Zikai Tang, Dijian Wang:
On signed graphs with just two distinct adjacency eigenvalues. - Cemile Tosun:
Explicit factors of generalized cyclotomic polynomials and generalized Dickson polynomials of order 2m3 over finite fields. - Stanislav Jendrol':
On rainbow matchings in plane triangulations. - György Kiss, Nicola Pace, Angelo Sonnino
On circular-linear one-factorizations of the complete graph. - Wanshun Yang, Weifan Wang, Yiqiao Wang:
Acyclic coloring of IC-planar graphs. - Qichun Wang:
The covering radius of the Reed-Muller code RM(2, 7) is 40. - Julio C. M. Pezzott, Irene N. Nakaoka:
On groups whose commuting graph on a transversal is strongly regular.
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-12-26 00:37 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: