default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 338
Volume 338, Number 1, January 2015
- Qingchun Ren:
Ordered partitions and drawings of rooted plane trees. 1-9 - Casey Mann, Laura Asaro, John Hyde, Melanie Jensen
, Tyler Schroeder:
Uniform edge-c-colorings of the Archimedean tilings. 10-22 - Bhaswar B. Bhattacharya, Sumit Mukherjee:
Exact and asymptotic results on coarse Ricci curvature of graphs. 23-42 - Antonio Cossidente, Francesco Pavese:
Blocking sets of Hermitian generalized quadrangles. 43-46 - Pawel Pralat:
Almost all k-cop-win graphs contain a dominating set of cardinality k. 47-52 - Alexander I. Barvinok:
On testing Hamiltonicity of graphs. 53-58 - Yuval Ginosar, Ofir Schnabel:
A graph-theoretic approach for comparing dimensions of components in simply-graded algebras. 59-63 - Naoki Matsumoto, Atsuhiro Nakamoto:
Generating 4-connected even triangulations on the sphere. 64-70 - Paul Dorbec, Gasper Kosmrlj, Gabriel Renault:
The domination game played on unions of graphs. 71-79 - Mohamed Didi Biha, Hervé L. M. Kerivin, Peh H. Ng:
Polyhedral study of the connected subgraph problem. 80-92 - Per Alexandersson:
A combinatorial proof of the skew K-saturation theorem. 93-102 - Liliana Alcón, Marisa Gutierrez, María Pía Mazzoleni:
Characterizing paths graphs on bounded degree trees by minimal forbidden induced subgraphs. 103-110 - Masayoshi Yoshikawa:
On regular association schemes of order pq. 111-113 - Ruixia Wang:
(k+1)-kernels and the number of k-kings in k-quasi-transitive digraphs. 114-121 - Alexander Halperin, Colton Magnant, Hua Wang:
On large semi-linked graphs. 122-129 - Robert Hochberg:
The gap number of the T-tetromino. 130-138 - Alexander Rosa:
On a problem of Mariusz Meszka. 139-143 - Peter Dankelmann:
Distance and size in digraphs. 144-148
Volume 338, Number 2, February 2015
- Stanislav Jendrol', Mária Maceková:
Describing short paths in plane graphs of girth at least 5. 149-158 - Muhuo Liu, Bolian Liu, Bo Cheng:
Ordering (signless) Laplacian spectral radii with maximum degrees of graphs. 159-163 - Aistis Atminas, Andrew Collins, Vadim V. Lozin, Victor Zamaraev:
Implicit representations and factorial properties of graphs. 164-179 - Byungchan Kim, Eunmi Kim, Jeehyeon Seo:
Asymptotics for q-expansions involving partial theta functions. 180-189 - Felix Joos, Van Bang Le, Dieter Rautenbach:
Forests and trees among Gallai graphs. 190-195 - Hong Yue, Bo Hou, Suogang Gao:
Note on the tight relative 2-designs on H(n, 2). 196-208 - Emilie Hogan, Joseph O'Rourke, Cindy Traub, Ellen Veomett:
On coloring box graphs. 209-216 - Islam Akaria, Raphael Yuster:
Packing edge-disjoint triangles in regular and almost regular tournaments. 217-228 - Richard A. Brualdi, Eliseu Fritscher:
Tournaments associated with multigraphs and a theorem of Hakimi. 229-235 - Ayla Gafni:
Longest run of equal parts in a random integer composition. 236-247 - Fei-Huang Chang, Ma-Lian Chia, David Kuo, Sheng-Chyang Liaw, Meng-Hsuan Tsai:
L(2, 1)-labelings of subdivisions of graphs. 248-255 - Bo Kong, Xiying Zheng, Hongjuan Ma:
The depth spectrums of constacyclic codes over finite chain rings. 256-261 - Carlos Hoppen, Yoshiharu Kohayakawa, Hanno Lefmann:
Edge-colorings of uniform hypergraphs avoiding monochromatic matchings. 262-271 - Vaidy Sivaraman:
A unified proof of Brooks' theorem and Catlin's theorem. 272-273 - Stephane Durocher, David S. Gunderson, Pak Ching Li, Matthew Skala:
Cycle-maximal triangle-free graphs. 274-290 - Ryan R. Martin:
On the computation of edit distance functions. 291-305
Volume 338, Number 3, March 2015
- Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer:
On forbidden subgraphs and rainbow connection in graphs with minimum degree 2. 1-8 - Samson Black, Iain Crump, Matt DeVos, Karen A. Yeats:
Forbidden minors for graphs with no first obstruction to parametric Feynman integration. 9-35 - Yue-Li Wang:
Efficient twin domination in generalized De Bruijn digraphs. 36-40 - Majid Arezoomand, Bijan Taeri:
Normality of 2-Cayley digraphs. 41-47 - Angela Hicks, Emily Leven:
A simpler formula for the number of diagonal inversions of an (m, n)-parking function and a returning fermionic formula. 48-65 - Sarah Loeb, Jennifer Wise:
Fool's solitaire on joins and Cartesian products of graphs. 66-71 - Hengjia Wei, Hui Zhang, Mingzhi Zhu, Gennian Ge:
Optimal ternary constant-composition codes with weight four and distance six. 72-87 - Amol Aggarwal:
On unit distances in a convex polygon. 88-92 - Vinayak Joshi, Sachin Sarode:
Beck's conjecture and multiplicative lattices. 93-98 - Vadim E. Levit, David Tankus:
Weighted well-covered claw-free graphs. 99-106 - Zsolt Adam Wagner:
Cops and Robbers on diameter two graphs. 107-109 - Li-Ping Huang, Jin-Qian Huang, Kang Zhao:
On endomorphisms of alternating forms graph. 110-121 - Haiyuan Yao, Heping Zhang:
Non-matchable distributive lattices. 122-132 - Haobo Dai:
Congruences for the number of partitions and bipartitions with distinct even parts. 133-138 - Danjun Huang, Zhengke Miao, Weifan Wang:
Adjacent vertex distinguishing indices of planar graphs without 3-cycles. 139-148 - Olof Heden:
Linear maps of perfect codes and irregular C-partitions. 149-163 - Hiroshi Maehara:
Circle lattice point problem, revisited. 164-167 - Wei Jin, Alice Devillers, Cai Heng Li, Cheryl E. Praeger:
On geodesic transitive graphs. 168-173 - Ivan Yu. Mogilnykh, Faina I. Solov'eva:
Transitive nonpropelinear perfect codes. 174-182 - Xing Peng, Rafael Tesoro, Craig Timmons:
Bounds for generalized Sidon sets. 183-190 - Tilen Marc:
Vertex-transitive median graphs of non-exponential growth. 191-198 - Zoltán Blázsik, Jay Cummings, Willem H. Haemers:
Cospectral regular graphs with and without a perfect matching. 199-201 - Francesco Pavese:
Geometric constructions of two-character sets. 202-208
Volume 338, Number 4, April 2015
- Nicholas J. A. Harvey:
A note on the discrepancy of matrices with bounded row and column sums. 517-521 - Nacho López, Jordi Pujolàs:
Properties of mixed Moore graphs of directed degree one. 522-526 - Jan Foniok, Claude Tardif:
Digraph functors which admit both left and right adjoints. 527-535 - Nancy S. S. Gu, Li Guo:
Generating functions from the viewpoint of Rota-Baxter algebras. 536-554 - Anamari Nakic:
Non-existence of a simple 3-(16, 7, 5) design with an automorphism of order 3. 555-565 - Charles Zhao-Chen Wang, Yi Wang:
Total positivity of Catalan triangle. 566-568 - Bhaskar Bagchi, Basudeb Datta:
Corrigendum to "Combinatorial triangulations of homology spheres" [Discrete Math. 305(2005) 1-17]. 569-570 - Zhenhua Qu:
On the nonvanishing of representation functions of some special sequences. 571-575 - Anuradha Sharma:
Self-dual and self-orthogonal negacyclic codes of length 2mpn over a finite field. 576-592 - R. Julian R. Abel, Yang Li:
Some constructions for t pairwise orthogonal diagonal Latin squares based on difference matrices. 593-607 - Selda Küçükçifçi, Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
Resolvable 3-star designs. 608-614 - Ushnish Sarkar, Avishek Adhikari:
On characterizing radio k-coloring problem by path covering problem. 615-620 - Gábor Bacsó, Piotr Borowiecki, Mihály Hujter, Zsolt Tuza:
Minimum order of graphs with given coloring parameters. 621-632 - Ulrich Dempwolff:
Universal covers of dimensional dual hyperovals. 633-636 - Feifei Lu, Haitao Cao:
On the existence of holey 4-cycle frames. 637-644 - Bart De Bruyn:
On hyperovals of polar Grassmannians. 645-654 - Jean-Luc Baril, Armen Petrossian:
Equivalence classes of Dyck paths modulo some statistics. 655-660 - Ilkyoo Choi, André Raspaud:
Planar graphs with girth at least 5 are (3, 5)-colorable. 661-667
Volume 338, Number 5, May 2015
- Hengzhe Li, Xueliang Li, Yaping Mao, Jun Yue:
Note on the spanning-tree packing number of lexicographic product graphs. 669-673 - Boon Leong Ng, Fengming Dong:
The chromatic equivalence class of K1, n, n+2. 674-687 - Chuandong Xu, Shenggui Zhang, Bo Ning, Binlong Li:
A note on the number of spanning trees of line digraphs. 688-694 - Daniel Kotlar, Ran Ziv:
Rainbow sets in the intersection of two matroids: A generalization of results of Drisko and Chappell. 695-697 - Csaba Biró, Kris Wease:
The rate of growth of the minimum clique size of graphs of given order and chromatic number. 698-700 - Mark Broom, Chris Cannings:
Graphic deviation. 701-711 - Kefeng Diao, Vitaly I. Voloshin, Kaishun Wang, Ping Zhao:
The smallest one-realization of a given set IV. 712-724 - Valérie Berthé, Clelia de Felice, Francesco Dolce, Julien Leroy, Dominique Perrin, Christophe Reutenauer, Giuseppina Rindone:
Maximal bifix decoding. 725-742 - John Asplund, C. A. Rodger, Melissa S. Keranen:
Enclosings of λ-fold 5-cycle systems for u=2. 743-765 - John Asplund:
5-cycle systems of (λ+m)Kv+1 - λKv and λKv+u - λKv. 766-783 - Scott Corry:
Maximal harmonic group actions on finite graphs. 784-792 - Kenta Ozeki, Zdenek Ryjácek, Kiyoshi Yoshimoto:
2-factors with bounded number of components in claw-free graphs. 793-808 - Edita Mácajová, Martin Skoviera:
Remarks on nowhere-zero flows in signed cubic graphs. 809-815 - Mohammed Amin Tahraoui, Éric Duchêne, Hamamache Kheddouci:
Labeled 2-packings of trees. 816-824 - Pierre Aboulker, Pierre Charbit, Nicolas Trotignon, Kristina Vuskovic:
Vertex elimination orderings for hereditary graph classes. 825-834
Volume 338, Number 6, June 2015
- Peter J. Dukes, Kseniya Garaschuk:
Threefold triple systems with nonsingular N2. 835-838 - Susana-Clara López, Francesc A. Muntaner-Batle:
A new application of the ⊗h-product to α-labelings. 839-843 - Xiaomeng Zhu, Qin Yue, Liqin Hu:
Weight distributions of cyclic codes of length tlm. 844-856 - Xuemei Liu, Xing Gao:
New error-correcting pooling designs with vector spaces over finite field. 857-862 - Stefano Innamorati, Fulvio Zuanni:
In AG(3, q) any q2-set of class [1, m, n]2 is a cap. 863-865 - Edita Mácajová, Eckhard Steffen:
The difference between the circular and the integer flow number of bidirected graphs. 866-867 - Huiqiu Lin:
On the least distance eigenvalue and its applications on the distance spread. 868-874 - Alan J. Aw, Cheng Yeaw Ku:
The covering radius problem for sets of 1-factors of the complete uniform hypergraphs. 875-884 - Kannan Balakrishnan, Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Henry Martyn Mulder, Prasanth G. Narasimha-Shenoi, N. Narayanan:
Axiomatic characterization of the interval function of a block graph. 885-894 - Antonio Breda d'Azevedo, Domenico Antonino Catalano, Rui Duarte:
Regular pseudo-oriented maps and hypermaps of low genus. 895-921 - Yonglin Cao, Jian Gao, Fang-Wei Fu, Yuan Cao:
Enumeration and construction of additive cyclic codes over Galois rings. 922-937 - Iliya Bouyukliev, Yuuki Kageyama, Tatsuya Maruta:
On the minimum length of linear codes over F5. 938-953 - Marcel Erné, Vinayak Joshi:
Ideals in atomic posets. 954-971 - Kelly J. Pearson, Tan Zhang:
The Laplacian tensor of a multi-hypergraph. 972-982 - Tomasz Dzido, Krzysztof Krzywdzinski:
On a local similarity of graphs. 983-989 - István Tomon:
On the number of occurrences of the kth smallest distance between points in convex position. 990-993 - Yanbo Zhang, Hajo Broersma, Yaojun Chen:
Ramsey numbers of trees versus fans. 994-999 - Jeroen Schillewaert, Jacques Verstraëte:
Probabilistic constructions in generalized quadrangles. 1000-1010 - Leif K. Jørgensen:
New mixed Moore graphs and directed strongly regular graphs. 1011-1016 - Mingming Geng, Junling Zhou:
Large sets of resolvable Mendelsohn triple systems of prime power sizes. 1017-1021 - Grahame Erskine:
Diameter 2 Cayley graphs of dihedral groups. 1022-1024 - Konstantinos Tyros:
On colorings of variable words. 1025-1028 - Nicolas Gastineau:
Dichotomies properties on computational complexity of S-packing coloring problems. 1029-1041 - H. K. Dai:
Length lower bounds for reflecting sequences and universal traversal sequences. 1042-1065
Volume 338, Number 7, July 2015
- Alexander Engström, Lasse Leskelä, Harri Varpanen:
Geometric juggling with q-analogues. 1067-1074 - Christoph Helmberg, Vilmar Trevisan:
Threshold graphs of maximal Laplacian energy. 1075-1084 - Grant Cairns, Stacey Mendan, Yury Nikolayevsky:
A sharp refinement of a result of Zverovich-Zverovich. 1085-1089 - Cheng Yeaw Ku, Kok Bin Wong:
On r-cross t-intersecting families for weak compositions. 1090-1095 - Themba Dube, Dimitris N. Georgiou, Athanasios C. Megaritis, Seithuti P. Moshokoa:
A study of covering dimension for the class of finite lattices. 1096-1110 - Jun Ma, Hao Shen, Yeong-Nan Yeh:
Rooted cyclic permutations of lattice paths and uniform partitions. 1111-1125 - Fenling Xu, Baoyindureng Wu, Qinqin Li:
The clique-transversal number of a {K1, 3, K4}-free 4-regular graph. 1126-1130 - Sumit Mohanty, Arbind Kumar Lal:
Maximization of combinatorial Schrödinger operator's smallest eigenvalue with Dirichlet boundary condition. 1131-1143 - Jason I. Brown, Ortrud R. Oellermann:
On the spectrum and number of convex sets in graphs. 1144-1153 - Cheyu Lin, Tsai-Lien Wong, Xuding Zhu:
Circular chromatic indices of even degree regular graphs. 1154-1162 - Jun-Yang Zhang:
Regular Cayley maps of skew-type 3 for dihedral groups. 1163-1172 - Aras Erzurumluoglu, C. A. Rodger:
Fair holey hamiltonian decompositions of complete multipartite graphs and long cycle frames. 1173-1177 - Susan G. Barwick, Wen-Ai Jackson:
The tangent splash in PG(6, q). 1178-1190 - Jasine Babu, L. Sunil Chandran, Krishna Vaidyanathan:
Rainbow matchings in strongly edge-colored graphs. 1191-1196 - Miles Eli Jones, Sergey Kitaev, Jeffrey B. Remmel:
Frame patterns in n-cycles. 1197-1215 - Jun-Yang Zhang:
A classification of regular Cayley maps with trivial Cayley-core for dihedral groups. 1216-1225 - Saieed Akbari, Kenta Ozeki, Alireza Rezaei, Rahmtin Rotabi, Sara Sabour:
{0, 2}-Degree free spanning forests in graphs. 1226-1231 - Shrawan Kumar, J. M. Landsberg:
Connections between conjectures of Alon-Tarsi, Hadamard-Howe, and integrals over the special unitary group. 1232-1238 - Keerti Choudhary, Susan Margulies, Illya V. Hicks:
Integer domination of Cartesian product graphs. 1239-1242 - Krzysztof Petelczyc, Malgorzata Prazmowska, Krzysztof Prazmowski:
A complete classification of the -configurations with at least three K5-graphs. 1243-1251 - Xiaodan Chen, Kinkar Chandra Das:
Characterization of extremal graphs from Laplacian eigenvalues and the sum of powers of the Laplacian eigenvalues of graphs. 1252-1263 - Dabin Zheng, Xiaoqiang Wang, Long Yu, Hongwei Liu:
The weight enumerators of several classes of p-ary cyclic codes. 1264-1276
Volume 338, Number 8, August 2015
- Michitaka Furuya, Yuki Okubo:
Forbidden quadruplets generating a finite set of 2-connected graphs. 1277-1283 - T. R. Whitt III, C. A. Rodger:
Decomposition of the Kneser Graph into paths of length four. 1284-1288 - Sven Herrmann, Jack H. Koolen, Alice Lesser, Vincent Moulton, Taoyang Wu:
Optimal realizations of two-dimensional, totally-decomposable metrics. 1289-1299 - Yue Zhou:
Parabolic unitals in a family of commutative semifield planes. 1300-1306 - Yandong Bai, Binlong Li, Hao Li:
Vertex-disjoint cycles in bipartite tournaments. 1307-1309 - Gilad Braunschvig, Alon Brutzkus, David Peleg, Adam Sealfon:
Truth tellers and liars with fewer questions. 1310-1316 - Morteza Hasanvand:
Spanning trees and spanning Eulerian subgraphs with small degrees. 1317-1321 - Saieed Akbari, Tommy R. Jensen, Mark H. Siggers:
Decompositions of graphs into trees, forests, and regular subgraphs. 1322-1327 - Daniel Irving Bernstein, David J. Grynkiewicz, Carl Yerger:
On three sets with nondecreasing diameter. 1328-1344 - Vladimir P. Korzhik:
Nonorientable biembeddings of cyclic Steiner triple systems generated by Skolem sequences. 1345-1361 - Hung-Chih Lee:
Decomposition of the complete bipartite multigraph into cycles and stars. 1362-1369 - Jean-Luc Baril, Jean Marcel Pallo:
A Motzkin filter in the Tamari lattice. 1370-1378 - Simon Crevals, Patric R. J. Östergård:
Independent domination of grids. 1379-1384 - Joy Morris:
Elementary proof that is a DCI-group. 1385-1393 - Gregory J. Puleo:
Extremal aspects of the Erdős-Gallai-Tuza conjecture. 1394-1397 - Veronika Halász, Zsolt Tuza:
Distance-constrained labeling of complete trees. 1398-1406 - Hongtao Zhao, C. A. Rodger:
Large sets of wrapped Hamilton cycle decompositions of complete tripartite graphs. 1407-1415 - Stefko Miklavic, Primoz Sparl:
On extendability of Deza graphs with diameter 2. 1416-1423 - José D. Alvarado, Simone Dantas, Dieter Rautenbach:
Perfectly relating the domination, total domination, and paired domination numbers of a graph. 1424-1431 - Ange Bigeni:
A bijection between irreducible k-shapes and surjective pistols of height k-1. 1432-1448 - Haitao Cao, J. Lei, Lie Zhu:
Constructions of large sets of disjoint group-divisible designs using a generalization of. 1449-1459 - Ilan Karpas, Ofer Neiman, Shakhar Smorodinsky:
On vertex rankings of graphs and its relatives. 1460-1467 - Shi-Mei Ma, Toufik Mansour:
The 1/k-Eulerian polynomials and k-Stirling permutations. 1468-1472 - Guanglong Yu, Zhengke Miao:
On the local base of a primitive and nonpowerful sign pattern. 1473-1480 - Louis Esperet, Laetitia Lemoine, Frédéric Maffray:
Equitable partition of graphs into induced forests. 1481-1483 - Orit E. Raz, Oliver Roche-Newton, Micha Sharir:
Sets with few distinct distances do not have heavy lines. 1484-1492 - Peter Beelen, Sudhir R. Ghorpade, Sartaj Ul Hasan:
Linear codes associated to determinantal varieties. 1493-1500 - Yanxia Dong, Erfang Shan, Liying Kang:
Constructing the minimum dominating sets of generalized de Bruijn digraphs. 1501-1508 - Louis Esperet, Giuseppe Mazzuoccolo:
On the maximum fraction of edges covered by t perfect matchings in a cubic bridgeless graph. 1509-1514 - Elodie Leducq:
On the third weight of generalized Reed-Muller codes. 1515-1535 - Lenny Fukshansky, Stephan Ramon Garcia, Xun Sun:
Permutation invariant lattices. 1536-1541
Volume 338, Number 9, September 2015
- Michael D. Barrus, Stephen G. Hartke:
Minimal forbidden sets for degree sequence characterizations. 1543-1554 - Ya-Lei Jin, Xiao-Dong Zhang:
On the spectral radius of simple digraphs with prescribed number of arcs. 1555-1564 - Péter Komjáth:
A note on uncountable chordal graphs. 1565-1566 - Michelle Rudolph-Lilith, Lyle E. Muller:
On a link between Dirichlet kernels and central multinomial coefficients. 1567-1572 - Yuanyuan Liu, Qingde Kang:
Completing the spectrum for large sets of extended directed triple systems. 1573-1576 - Jesús Jerónimo-Castro, Alexander Magazinov, Pablo Soberón:
On a problem by Dol'nikov. 1577-1585 - Michael W. Schroeder:
ϕ-symmetric Hamilton cycle decompositions of graphs. 1586-1594 - Xiwang Cao, Mei Lu, Daqing Wan, Li-Ping Wang, Qiang Wang:
Linearized Wenger graphs. 1595-1602 - Ekaterina Vassilieva:
Moments of normally distributed random matrices given by generating series for connection coefficients - Explicit algebraic computation. 1603-1613 - Tien-Nam Le, Fiachra Knox, Moshe Rosenfeld:
Every 3-colorable graph has a faithful representation in the odd-distance graph. 1614-1620 - Gil Chun Kim, Yoonjin Lee:
Corrigendum to "A Cheeger inequality of a distance regular graph using Green's function" [Discrete Mathematics 313(20) (2013) 2337-2347]. 1621-1623 - Xiaomiao Wang, Tao Feng, Jing Zhang, Yan Xu:
Two-dimensional balanced sampling plans avoiding adjacent units. 1624-1642 - Stanislav Jendrol', Mária Maceková, Roman Soták:
Note on 3-paths in plane graphs of girth 4. 1643-1648 - Samuel Zbarsky:
Unimodality of partitions in near-rectangular Ferrers diagrams. 1649-1658
Volume 338, Number 10, October 2015
- Mirko Hornák, Zdenek Ryjácek, Martin Skoviera:
Preface. 1659 - Gábor Nyul, Gabriella Rácz:
The r-Lah numbers. 1660-1666 - Selda Küçükçifçi, Salvatore Milici, Zsolt Tuza:
Maximum uniformly resolvable decompositions of Kv and Kv-I into 3-stars and 3-cycles. 1667-1673 - Ngoc Chi Lê, Christoph Brause, Ingo Schiermeyer:
New sufficient conditions for α-redundant vertices. 1674-1680 - Binlong Li, Shenggui Zhang:
Forbidden subgraphs for longest cycles to contain vertices with large degrees. 1681-1689 - Arnfried Kemnitz, Massimiliano Marangio:
d-strong total colorings of graphs. 1690-1698 - Ludovít Niepel:
Locating-paired-dominating sets in square grids. 1699-1705 - Premysl Holub, Zdenek Ryjácek, Ingo Schiermeyer, Petr Vrána:
Rainbow connection and forbidden subgraphs. 1706-1713 - Csilla Bujtás, Zsolt Tuza:
Approximability of the upper chromatic number of hypergraphs. 1714-1721 - Arnfried Kemnitz, Massimiliano Marangio, Anja Pruchnewski, Margit Voigt:
(P, Q)-Total (r, s)-colorings of graphs. 1722-1729 - Byeong Moon Kim, Byung Chul Song, Yoomi Rho:
2-distance colorings of some direct products of paths and cycles. 1730-1739 - Ming Han, Xuding Zhu:
Locally planar graphs are 5-paintable. 1740-1749 - Herbert Fleischner, Roland Häggkvist:
Cycle double covers containing certain circuits in cubic graphs having special structures. 1750-1754 - Pavol Hell, César Hernández-Cruz:
Point determining digraphs, {0, 1}-matrix partitions, and dualities in full homomorphisms. 1755-1762 - Jochen Harant, Sebastian Richter:
A new eigenvalue bound for independent sets. 1763-1765 - Christoph Brause, Ngoc Chi Lê, Ingo Schiermeyer:
The Maximum Independent Set Problem in Subclasses of Subcubic Graphs. 1766-1778 - Hal A. Kierstead, Bernard Lidický:
On choosability with separation of planar graphs with lists of different sizes. 1779-1783 - Milan Pokorný, Pavel Híc, Dragan Stevanovic, Marko Milosevic:
On distance integral graphs. 1784-1792 - Alexander D. Mednykh, Ilya A. Mednykh:
On Wiman's theorem for graphs. 1793-1800 - Gareth A. Jones:
Bipartite graph embeddings, Riemann surfaces and Galois groups. 1801-1813 - Antonio Breda d'Azevedo, Domenico Antonino Catalano, Ján Karabás, Roman Nedela:
Maps of Archimedean class and operations on dessins. 1814-1825
Volume 338, Number 11, November 2015
- Alessandro Musesti, Maurizio Paolini, Cesco Reale:
An optimal bound on the number of moves for open mancala. 1827-1844 - Fábio Botler, Guilherme Oliveira Mota, Yoshiko Wakabayashi:
Decompositions of triangle-free 5-regular graphs into paths of length five. 1845-1855 - Denis S. Krotov, Evgeniya V. Sotnikova:
Embedding in q-ary 1-perfect codes and partitions. 1856-1859 - Dmitriy S. Malyshev:
The complexity of the 3-colorability problem in the absence of a pair of small forbidden induced subgraphs. 1860-1865 - Tri Lai:
A new proof for the number of lozenge tilings of quartered hexagons. 1866-1872 - Antonio Breda d'Azevedo, Maria Elisa Fernandes:
Classification of regular maps with prime number of faces and the asymptotic behaviour of their reflexible to chiral ratio. 1873-1882 - Min Li, Zhibing Chen, Xiaoqing Ruan, Xuerong Yong:
The formulas for the number of spanning trees in circulant graphs. 1883-1906 - Mordechai Shalom:
On the interval chromatic number of proper interval graphs. 1907-1916 - David Cariolaro, Giuseppe Mazzuoccolo:
Excessive [l, m]-factorizations. 1917-1927 - David Rolnick, Praveen S. Venkataramana:
On the growth of Stanley sequences. 1928-1937 - Jason I. Brown, Aysel Erey:
New bounds for chromatic polynomials and chromatic roots. 1938-1946 - Oleg V. Borodin, Anna O. Ivanova:
Describing tight descriptions of 3-paths in triangle-free normal plane maps. 1947-1952 - Nickolas S. Rollick:
Characterization of the finite C-MH-homogeneous graphs. 1953-1969 - Christian Ikenmeyer:
The Saxl conjecture and the dominance order. 1970-1975 - Dmitry A. Shabanov:
Around Erdős-Lovász problem on colorings of non-uniform hypergraphs. 1976-1981 - Ana Paulina Figueroa, Mika Olsen, Rita Zuazua:
On the vertices of a 3-partite tournament not in triangles. 1982-1988 - Toufik Mansour, Mark Shattuck, Stephan G. Wagner:
Counting subwords in flattened partitions of sets. 1989-2005 - Yiqiao Wang, Wei-Fan Wang, Jingjing Huo:
Some bounds on the neighbor-distinguishing index of graphs. 2006-2013 - John Engbers, Christopher J. Stocker:
Reversible peg solitaire on graphs. 2014-2019 - László Mérai, Oguz Yayla:
Improving results on the pseudorandomness of sequences generated via the additive order of a finite field. 2020-2025 - Seyed Hassan Alavi:
A generalisation of Johnson graphs with an application to triple factorisations. 2026-2036 - Neil J. Y. Fan, Liao He:
On the non-negativity of the complete cd-index. 2037-2041 - Runli Tian, Liming Xiong:
Hamiltonian claw-free graphs with locally disconnected vertices. 2042-2050 - Ronald J. Gould, Kazuhide Hirohata, Paul Horn:
On independent doubly chorded cycles. 2051-2071 - Victor A. Campos, Carlos Vinícius G. C. Lima, Nicolas Almeida Martins, Leonardo Sampaio Rocha, Marcio Costa Santos, Ana Silva:
The b-chromatic index of graphs. 2072-2079 - Cunquan Qu, Guanghui Wang, Guiying Yan:
Orthogonal matchings revisited. 2080-2088 - Dan Hathaway, Scott Schneider:
Combinatorics of reductions between equivalence relations. 2089-2094 - Vadim E. Zverovich:
On general frameworks and threshold functions for multiple domination. 2095-2104 - Juan Du, R. Julian R. Abel, Jinhua Wang:
Some new resolvable GDDs with k=4 and doubly resolvable GDDs with k=3. 2105-2118 - Allan Lo:
Existences of rainbow matchings and rainbow matching covers. 2119-2124
Volume 338, Number 12, December 2015
- Bart De Bruyn:
The uniqueness of a certain generalized octagon of order (2, 4). 2125-2142 - Rafael Gregorio Lucas D'Oliveira, Marcelo Firer:
The packing radius of a code and partitioning problems: The case for poset metrics on finite vector spaces. 2143-2167 - F. Aguiló-Gost, Pedro A. García-Sánchez, David Llena:
On the number of L-shapes in embedding dimension four numerical semigroups. 2168-2178 - Michael Gentner, Dieter Rautenbach:
Feedback vertex sets in cubic multigraphs. 2179-2185 - Vladimir P. Korzhik:
Recursive constructions and nonisomorphic minimal nonorientable embeddings of complete graphs. 2186-2196 - David Canright, Jong H. Chung, Pantelimon Stanica:
Circulant matrices and affine equivalence of monomial rotation symmetric Boolean functions. 2197-2211 - Giovanni Lo Faro, Salvatore Milici, Antoinette Tripodi:
Uniformly resolvable decompositions of Kv into paths on two, three and four vertices. 2212-2219 - Csilla Bujtás:
Domination game on forests. 2220-2228 - Azer Kerimov:
Covering a rectangular chessboard with staircase walks. 2229-2233 - Oleg V. Borodin, Anna O. Ivanova:
Low edges in 3-polytopes. 2234-2241 - Riccardo Biagioli, Frédéric Jouhet, Philippe Nadeau:
Combinatorics of fully commutative involutions in classical Coxeter groups. 2242-2259 - Yoshimi Egawa, Jun Fujisawa, Michael D. Plummer, Akira Saito, Tomoki Yamashita:
Perfect matchings avoiding prescribed edges in a star-free graph. 2260-2274 - Sunghan Bae, Chengju Li, Qin Yue:
On the complete weight enumerators of some reducible cyclic codes. 2275-2287 - Hortensia Galeana-Sánchez, Rocío Sánchez-López:
H-kernels and H-obstructions in H-colored digraphs. 2288-2294 - Maria Axenovich, Jonathan Rollin:
Brooks type results for conflict-free colorings and {a, b}-factors in graphs. 2295-2301 - Nicolas Bousquet, Stéphan Thomassé:
VC-dimension and Erdős-Pósa property. 2302-2317 - Tomislav Doslic, Dieter Rautenbach:
Factor-critical graphs with the minimum number of near-perfect matchings. 2318-2319 - Yu Hin Au:
Generalized de Bruijn words for primitive words and powers. 2320-2331 - Lily L. Liu, Bao-Xuan Zhu:
Strong q-log-convexity of the Eulerian polynomials of Coxeter groups. 2332-2340 - Daniel Hoske, Jonathan Rollin, Torsten Ueckerdt, Stefan Walzer:
Playing weighted Tron on trees. 2341-2347 - Gerard J. Chang, Sheng-Hua Chen, Chi-Yun Hsu, Chia-Man Hung, Huei-Ling Lai:
Strong edge-coloring for jellyfish graphs. 2348-2355 - Jonathan D. Lee, Ago-Erik Riet:
F-saturation games. 2356-2362 - Teeradej Kittipassorn, Gábor Mészáros:
Frustrated triangles. 2363-2373 - Felix Joos, Dieter Rautenbach:
Equality of distance packing numbers. 2374-2377 - Benjian Lv, Kaishun Wang:
The Terwilliger algebra of the incidence graphs of Johnson geometry, II. 2378-2386 - Tillmann Miltzow, Jens M. Schmidt, Mingji Xia:
Counting K4-subdivisions. 2387-2392 - Christophe Crespelle, Eric Thierry:
Computing the directed Cartesian-product decomposition of a directed graph from its undirected decomposition in linear time. 2393-2407 - Xiangwen Li, Xiaoxia Zhang:
Nowhere-zero 3-flows in semistrong product of graphs. 2408-2411 - Matjaz Krnc, Riste Skrekovski:
Centralization of transmission in networks. 2412-2420 - Endre Boros, Vladimir Gurvich:
Sandwich problem for Π- and Δ-free multigraphs and its applications to positional games. 2421-2436 - Jesse Geneson, Lilly Shen:
Linear bounds on matrix extremal functions using visibility hypergraphs. 2437-2441 - Shuya Chiba, Michitaka Furuya, Shoichi Tsuchiya:
Forbidden pairs and the existence of a dominating cycle. 2442-2452 - Pavol Hell, Pei-Lan Yen:
Join colourings of chordal graphs. 2453-2461 - Alfred Schreiber:
Multivariate Stirling polynomials of the first and second kind. 2462-2484 - Ngo Dac Tan:
On vertex disjoint cycles of different lengths in 3-regular digraphs. 2485-2491 - Zi-Xia Song, Talon Ward, Alexander York:
A note on weighted rooted trees. 2492-2494 - Gurusamy Rengasamy Vijayakumar:
Packing functions and dominating functions of countable graphs. 2495-2501 - Penny E. Haxell, Hal A. Kierstead:
Edge coloring multigraphs without small dense subsets. 2502-2506 - Grant Cairns, Timothy J. Koussas, Yury Nikolayevsky:
Great-circle spherical thrackles. 2507-2513 - Douglas R. Woodall:
Towards size reconstruction from fewer cards. 2514-2522 - Alexander Wires:
Dichotomy for finite tournaments of mixed-type. 2523-2538 - Laurent Beaudou, Reza Naserasr, Claude Tardif:
Homomorphisms of binary Cayley graphs. 2539-2544 - Mario Huicochea, Jesús Jerónimo-Castro, Luis Montejano, Déborah Oliveros:
About the piercing number of a family of intervals. 2545-2548 - Jingjun Bao, Lijun Ji, Yang Li, Chengmin Wang:
Some series of optimal multilength OOCs of weight four. 2549-2561 - Gabriela Araujo-Pardo, György Kiss, Amanda Montejano:
On the balanced upper chromatic number of cyclic projective planes and projective spaces. 2562-2571
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 2026-03-06 21:16 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:
