default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 313
Volume 313, Number 1, January 2013
- Gunnar Brinkmann:
Generating regular directed graphs. 1-7 - Takuya Kashimura, Yasuhide Numata, Akimichi Takemura:
Separation of integer points by a hyperplane under some weak notions of discrete convexity. 8-18 - Kinkar Chandra Das:
Proof of conjectures on adjacency eigenvalues of graphs. 19-25 - Yaser Alizadeh, Ali Iranmanesh
, Tomislav Doslic:
Additively weighted Harary index of some composite graphs. 26-34 - Carol T. Zamfirescu:
Survey of two-dimensional acute triangulations. 35-49 - Andy Miller:
Trees of integral triangles with given rectangular defect. 50-66 - Samuel Fiorini, Volker Kaibel, Kanstantsin Pashkovich, Dirk Oliver Theis:
Combinatorial bounds on nonnegative rank and extended formulations. 67-83 - Bart De Bruyn:
Polygonal valuations. 84-93 - Marko Jakovac, Andrej Taranenko:
On the k-path vertex cover of some graph products. 94-100 - Hao Li, Hong-Jian Lai:
Group colorability of multigraphs. 101-104 - Sevak H. Badalyan, Stepan E. Markosyan:
On the independence number of the strong product of cycle-powers. 105-110 - Mitre Costa Dourado, Dieter Rautenbach, Vinícius Gusmão Pereira de Sá, Jayme Luiz Szwarcfiter:
On the geodetic Radon number of grids. 111-121 - Arseniy V. Akopyan, Roman N. Karasev:
Inscribing a regular octahedron into polytopes. 122-128 - John P. McSorley, Alan H. Schoen:
Rhombic tilings of (n, k)-Ovals, (n, k, λ)-cyclic difference sets, and related topics. 129-154
Volume 313, Number 2, January 2013
- Zoltán Füredi, Younjin Kim:
The structure of the typical graphs of given diameter. 155-163 - Toru Kojima:
On C4-supermagic labelings of the Cartesian product of paths and graphs. 164-173 - Michael A. Henning, Anders Yeo:
Total domination and matching numbers in graphs with all vertices in triangles. 174-181 - Anthony Mendes:
Hook and content bijections. 182-185 - Jun Guo, Kaishun Wang, Fenggao Li:
Metric dimension of symplectic dual polar graphs and symmetric bilinear forms graphs. 186-188 - Pekka H. J. Lampio, Ferenc Szöllösi, Patric R. J. Östergård:
The quaternary complex Hadamard matrices of orders 10, 12, and 14. 189-206 - Zoltán Lóránt Nagy, Lale Özkahya, Balázs Patkós, Máté Vizer:
On the ratio of maximum and minimum degree in maximal intersecting families. 207-211
Volume 313, Number 3, February 2013
- Tomás Vetrík:
Cayley graphs of given degree and diameters 3, 4 and 5. 213-216 - Niluk John, Stephen Suen:
Graph products and integer domination. 217-224 - Bolian Liu, Ljiljana Pavlovic, Tomica Divnic, Jianxi Liu, Marina M. Stojanovic:
On the conjecture of Aouchiche and Hansen about the Randić index. 225-235 - Robert S. Coulter, Todd Gutekunst:
Subsets of finite groups exhibiting additive regularity. 236-248 - Emerson L. Monte Carmelo:
Covering codes and extremal problems from invariant sets under permutations. 249-257 - Sarah Birdsong, Gábor Hetyei:
A Gray code for the shelling types of the boundary of a hypercube. 258-268 - Shuya Chiba, Shinya Fujita:
Covering vertices by a specified number of disjoint cycles, edges and isolated vertices. 269-277 - Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi, Junling Zhou:
TBSs in some minimum coverings. 278-285 - Takahisa Toda, Ivo Vigan:
On separating families of bipartitions. 286-292 - Alan Arroyo, Hortensia Galeana-Sánchez:
The Path Partition Conjecture is true for some generalizations of tournaments. 293-300 - Qiaojun Shu, Yiqiao Wang, Weifan Wang:
Acyclic list edge coloring of outerplanar graphs. 301-311
Volume 313, Number 4, February 2013
- Daniel C. Slilaty, Xiangqian Zhou:
Some minor-closed classes of signed graphs. 313-325 - Huilan Chang:
Sortabilities of partition properties in multi-dimensional parameter spaces. 326-329 - Robert Willenbring:
The Möbius function of generalized factor order. 330-347 - Ian T. Roberts, Matthias Böhm:
On the existence of regular antichains. 348-356 - Yong-Gao Chen, Xiao-Feng Zhou:
On sequences containing at most 4 pairwise coprime integers. 357-365 - Alexandr V. Kostochka:
On almost (k-1)-degenerate (k+1)-chromatic graphs and hypergraphs. 366-374 - Tsuyoshi Miezaki:
On a generalization of spherical designs. 375-380 - Ramiro Feria-Purón, Mirka Miller, Guillermo Pineda-Villavicencio:
On large bipartite graphs of diameter 3. 381-390 - Yanmei Hong, Hong-Jian Lai:
Non-separating subgraphs. 391-396 - Tita Khalis Maryati, A. N. M. Salman, Edy Tri Baskoro:
Supermagic coverings of the disjoint union of graphs and amalgamations. 397-405 - Stanislav Jendrol', Heinz-Jürgen Voss:
Light subgraphs of graphs embedded in the plane - A survey. 406-421 - Shalom Eliahou, Martin J. Erickson:
Mutually describing multisets and integer partitions. 422-433 - Cunsheng Ding, Jing Yang:
Hamming weights in irreducible cyclic codes. 434-446 - Douglas R. Stinson:
Nonincident points and blocks in designs. 447-452 - András Frank, Satoru Fujishige, Naoyuki Kamiyama, Naoki Katoh:
Independent arborescences in directed graphs. 453-459 - Michael Ferrara, Silke Gehrke, Ronald J. Gould, Colton Magnant, Jeffrey S. Powell:
Pancyclicity of 4-connected {claw, generalized bull}-free graphs. 460-467 - Keenan Monks, Kenneth G. Monks, Kenneth M. Monks, Maria Monks:
Strongly sufficient sets and the distribution of arithmetic sequences in the 3x+1 graph. 468-489 - Junling Zhou, Yanxun Chang:
Overlarge sets of Mendelsohn triple systems with resolvability. 490-497 - Chin-Mei Fu, Yuan-Lung Lin, Shu-Wen Lo, Yu-Fong Hsu, Wen-Chung Huang:
The Doyen-Wilson theorem for bull designs. 498-507 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
Iterated clique graphs and bordered compact surfaces. 508-516 - Oleg V. Borodin:
Colorings of plane graphs: A survey. 517-539 - Jaeun Lee, Young Soo Kwon:
Cayley hypergraphs and Cayley hypermaps. 540-549 - Jeffrey W. Miller:
Reduced criteria for degree sequences. 550-562 - Martin Sonntag, Hanns-Martin Teichert:
Neighborhood structures and products of undirected graphs. 563-574
Volume 313, Number 5, March 2013
- Qiuli Lu, Zhengke Miao, Yingqian Wang:
Sufficient conditions for a planar graph to be list edge Δ-colorable and list totally (Δ+1)-colorable. 575-580 - Vincent Vajnovszki:
Lehmer code transforms and Mahonian statistics on permutations. 581-589 - Gary R. Cook:
Maximal (n, 4)-arcs in the projective plane of order 11. 590-594 - Jin-Hui Fang, Yong-Gao Chen:
On finite additive complements. 595-598 - Tomonori Fukunaga:
The warping degree of a nanoword. 599-604 - Vadim E. Levit, Eugen Mandrescu:
On the structure of the minimum critical independent set of a graph. 605-610 - Matthew Chao, Dustan Levenstein, Viorel Nitica, Robert Sharp:
A coloring invariant for ribbon L-tetrominos. 611-621 - Ilya I. Bogdanov, Grigory R. Chelnokov:
Finding a subset of nonnegative vectors with a coordinatewise large sum. 622-625 - Kinkar Chandra Das, Ji-Ming Guo:
Laplacian eigenvalues of the second power of a graph. 626-634 - Juanjo Rué, Ignasi Sau, Dimitrios M. Thilikos:
Asymptotic enumeration of non-crossing partitions on surfaces. 635-649 - Fenggao Li, Kaishun Wang, Jun Guo:
Symplectic graphs modulo pq. 650-655 - Young Soo Kwon:
A classification of regular t-balanced Cayley maps for cyclic groups. 656-664 - Sebastian M. Cioaba, Michael Tait:
Variations on a theme of Graham and Pollak. 665-676 - Rong Chen:
Crossing 3-separations in 3-connected matroids. 677-688 - Chaim Even-Zohar, Vsevolod F. Lev:
Small asymmetric sumsets in elementary abelian 2-groups. 689-692 - Mohammad Ghebleh:
On the set of circular total chromatic numbers of graphs. 693-697 - Qian Kong, Benjian Lv, Kaishun Wang:
The Terwilliger algebra of Odd graphs. 698-703 - Murat Güzeltepe:
Codes over Hurwitz integers. 704-714 - Artem V. Pyatkin:
Triangle-free 2P3-free graphs are 4-colorable. 715-720 - Mark Pankov:
Automorphisms of infinite Johnson graphs. 721-725 - Chin-Mei Fu, Yu-Fong Hsu, Shu-Wen Lo, Wen-Chung Huang:
Some gregarious kite decompositions of complete equipartite graphs. 726-732 - Domingos M. Cardoso, Maria Aguieiras A. de Freitas, Enide Andrade Martins, María Robbiano:
Spectra of graphs obtained by a generalization of the join graph operation. 733-741
Volume 313, Number 6, March 2013
- Louis Esperet, Laetitia Lemoine, Frédéric Maffray, Grégory Morel:
The chromatic number of {P5, K4}-free graphs. 743-754 - Xueliang Li, Sujuan Liu:
A sharp upper bound for the rainbow 2-connection number of a 2-connected graph. 755-759 - Michael Ferrara, Colton Magnant, Paul S. Wenger:
Conditions for families of disjoint k-connected subgraphs in a graph. 760-764 - Sundar Vishwanathan:
A counting proof of the Graham-Pollak Theorem. 765-766 - K. Reji Kumar, Gary MacGillivray:
Efficient domination in circulant graphs. 767-771 - Xiumei Wang, Yixun Lin, Marcelo Henriques de Carvalho, Cláudio Leonardo Lucchesi, G. Sanjith, Charles H. C. Little:
A characterization of PM-compact bipartite and near-bipartite graphs. 772-783 - Wei Xiong, Hong-Jian Lai, Xiaoling Ma, Keke Wang, Meng Zhang:
Hamilton cycles in 3-connected claw-free and net-free graphs. 784-795 - Andrei Gagarin, Vadim E. Zverovich:
The bondage number of graphs on topological surfaces and Teschner's conjecture. 796-808 - Oliver Schaudt, Rainer Schrader, Vera Weil:
On the separability of graphs. 809-820 - Fei Li:
Circulant digraphs integral over number fields. 821-823 - Allan Bickle, Arthur White:
Nordhaus-Gaddum results for genus. 824-829 - David G. Wagner, Yehua Wei:
Corrigendum to "A criterion for the half-plane property" [Discrete Mathematics 309 (2008) 1385-1390]. 830
Volume 313, Number 7, April 2013
- Blake Madill, Narad Rampersad:
The abelian complexity of the paperfolding word. 831-838 - Wayne Goddard, Michael A. Henning:
Independent domination in graphs: A survey and recent results. 839-854 - Darcy Best, Hadi Kharaghani, Hugh Ramp:
On unit weighing matrices with small weight. 855-864 - Tay-Woei Shyu:
Decomposition of complete bipartite graphs into paths and stars with same number of edges. 865-871 - Valentas Kurauskas:
On small subgraphs in a random intersection digraph. 872-885 - Liang Feng Zhang:
On the eigenvalues of certain matrices over Zm. 886-895 - Emine Sule Yazici:
The number of common flowers of two STS(v)s and embeddable Steiner triple trades. 896-902 - Yi-Zheng Fan, Yi Wang, Huan Guo:
The least eigenvalues of the signless Laplacian of non-bipartite graphs with pendant vertices. 903-909 - Hong Feng, Roberta Rui Zhou:
Note on the f-vectors of cutsets in the subspace lattice. 910-913
Volume 313, Number 8, April 2013
- Bostjan Bresar, Sandi Klavzar, Douglas F. Rall:
Domination game played on trees and spanning subgraphs. 915-923 - Maria Axenovich, Georg Osang:
Unavoidable subtrees. 924-930 - Yue Zhang, Jian-Hua Yin:
A strong Pósa Condition for a graphic list to be forcibly Z3-connected. 931-944 - Susan Hollingsworth:
Packing trees into complete bipartite graphs. 945-948 - Rangaswami Balakrishnan, T. Kavaskar:
Interpolation theorem for partial Grundy coloring. 949-950 - Manoj Changat, Anandavally K. Lakshmikuttyamma, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Geetha Seethakuttyamma, Simon Spacapan:
A forbidden subgraph characterization of some graph classes using betweenness axioms. 951-958 - Michael A. Henning, Anders Yeo:
Hypergraphs with large transversal number. 959-966 - Louigi Addario-Berry, Frédéric Havet, Cláudia Linhares Sales, Bruce A. Reed, Stéphan Thomassé:
Oriented trees in digraphs. 967-974 - Robert Lukot'ka:
Circular flow number of generalized Blanuša snarks. 975-981
Volume 313, Number 9, May 2013
- Hai Q. Dinh:
Structure of repeated-root constacyclic codes of length 3ps and their duals. 983-991 - Michael A. Henning, Dieter Rautenbach, Philipp Matthias Schäfer:
Open packing, total domination, and the P3-Radon number. 992-998 - Zehui Shao, Aleksander Vesel:
A note on the chromatic number of the square of the Cartesian product of two cycles. 999-1001 - Bo Hou, Panpan Shen, Ran Zhang, Suogang Gao:
On the non-existence of tight Gaussian 6-designs on two concentric spheres. 1002-1010 - Carl Johan Casselgren, Roland Häggkvist:
Completing partial Latin squares with one filled row, column and symbol. 1011-1017 - Richard H. Hammack:
On uniqueness of prime bipartite factors of graphs. 1018-1027 - Landon Rabern:
Partitioning and coloring graphs with degree constraints. 1028-1034 - Vadim V. Lozin, Martin Milanic:
Critical properties of graphs of bounded clique-width. 1035-1044 - Suhadi Wido Saputro, Rinovia Simanjuntak, Saladin Uttunggadewa, Hilda Assiyatun, Edy Tri Baskoro, A. N. M. Salman, Martin Baca:
The metric dimension of the lexicographic product of graphs. 1045-1051
Volume 313, Number 10, May 2013
- John D. LaGrange, Kyle A. Roy:
Poset graphs and the lattice of graph annihilators. 1053-1062 - Ping Ngai Chung:
On the c-strong chromatic number of t-intersecting hypergraphs. 1063-1069 - Wai Hong Chan, Wai Chee Shiu, Pak Kiu Sun, Xuding Zhu:
The strong game colouring number of directed graphs. 1070-1077 - Gadi Aleksandrowicz, Andrei Asinowski, Gill Barequet:
Permutations with forbidden patterns and polyominoes on a twisted cylinder of width 3. 1078-1086 - Paul J. P. Grobler, Adriana Roux:
Coalescence and criticality of graphs. 1087-1097 - Yue Guan, Jianfeng Hou, Yingyuan Yang:
An improved bound on acyclic chromatic index of planar graphs. 1098-1103 - Martin Knor, Primoz Potocnik, Riste Skrekovski:
Wiener index of iterated line graphs of trees homeomorphic to. 1104-1111 - Javad Bagherian:
On the characters of nilpotent association schemes. 1112-1118 - Jie Han, Yi Zhao:
On multipartite Hajnal-Szemerédi theorems. 1119-1129
Volume 313, Number 11, June 2013
- Keith Edwards:
Preface. 1131 - Andrei V. Gagarin, Vadim E. Zverovich:
Upper bounds for the bondage number of graphs on topological surfaces. 1132-1137 - A. D. Forbes, Terry S. Griggs:
Archimedean graph designs. 1138-1149 - R. M. Falcón:
The set of autotopisms of partial Latin squares. 1150-1161 - Peter Rowlinson:
On graphs with an eigenvalue of maximal multiplicity. 1162-1166 - Robert F. Bailey, Andrea C. Burgess:
Generalized packing designs. 1167-1190 - Anthony B. Evans:
The existence of strong complete mappings of finite groups: A survey. 1191-1196 - Arrigo Bonisoli, Beatrice Ruini:
Tree-designs with balanced-type conditions. 1197-1205 - Grzegorz Andrzejczak, Przemyslaw Gordinowicz:
On automorphisms of the countable p.e.c. graph. 1206-1211 - Justin Southey, Michael A. Henning:
Domination versus independent domination in cubic graphs. 1212-1220 - Terry A. McKee:
A note on sparseness conditions on chordless vertices of cycles. 1221-1223 - Christina M. Mynhardt, Mark Schurch:
A class of graphs with depression three. 1224-1232 - Peter J. Cameron:
Dixon's theorem and random synchronization. 1233-1236 - Bart De Bruyn:
Hyperplanes of DW(5, K) containing a quad. 1237-1247 - Andrew R. A. McGrae, Michele Zito:
The complexity of the empire colouring problem for linear forests. 1248-1255 - Dudley Stark:
The asymptotic number of spanning forests of complete bipartite labelled graphs. 1256-1261 - Bill Jackson:
Counting 2-connected deletion-minors of binary matroids. 1262-1266 - Katsuhiro Ota, Kenta Ozeki, Gabriel Sueiro:
Forbidden induced subgraphs for near perfect matchings. 1267-1280
Volume 313, Number 12, June 2013
- Eyal Ackerman, Jacob Fox, Rom Pinchasi:
A note on light geometric graphs. 1281-1283 - Eric M. Nelson, Tim Penttila:
On transitive irreducible BLT-sets. 1284-1288 - Tobias Fritz:
Velocity polytopes of periodic graphs and a no-go theorem for digital physics. 1289-1301 - Wei Dong, Wensong Lin:
Injective coloring of planar graphs with girth 6. 1302-1311 - Bart De Bruyn:
Isometric embeddings of the near polygons Hn and Gn into dual polar spaces. 1312-1321 - Patrick Ali:
The Steiner diameter of a graph with prescribed girth. 1322-1326 - Rong Pan, Yanxun Chang:
Determination of the sizes of optimal (m, n, k, λ, k-1)-OOSPCs for λ=k-1, k. 1327-1337 - R. Bruce Richter:
Hamilton paths in generalized Petersen graphs. 1338-1341 - Ethan D. Bloch:
Polyhedral representation of discrete Morse functions. 1342-1348 - L'udmila Bezegová, Jaroslav Ivanco:
Number of edges in degree-magic graphs. 1349-1357 - Mariusz Felisiak, Daniel Simson:
On combinatorial algorithms computing mesh root systems and matrix morsifications for the Dynkin diagram An. 1358-1367 - Jeffrey H. Dinitz, Esther R. Lamken, Gregory S. Warrington:
On the existence of three dimensional Room frames and Howell cubes. 1368-1384 - Simon Spacapan:
A characterization of the edge connectivity of direct products of graphs. 1385-1393 - Xiaofeng Gu, Hong-Jian Lai:
Realizing degree sequences with k-edge-connected uniform hypergraphs. 1394-1400 - Susanna F. de Rezende, Cristina G. Fernandes, Daniel M. Martin, Yoshiko Wakabayashi:
Intersecting longest paths. 1401-1408
Volume 313, Number 13, July 2013
- Tim Boykett:
Rectangular groupoids and related structures. 1409-1418 - Mario Gionfriddo, Gaetano Quattrocchi, Giorgio Ragusa:
Minimum embedding of STSs into (K3+e)(K3+e)-systems. 1419-1428 - Eric Clark, Richard Ehrenborg:
The excedance algebra. 1429-1435 - Khodakhast Bibak, Roberto Tauraso:
Determinants of grids, tori, cylinders and Möbius ladders. 1436-1440 - Zachary B. Charles, Miriam Farber, Charles R. Johnson, Lee Kennedy-Shaffer:
Nonpositive eigenvalues of the adjacency matrix and lower bounds for Laplacian eigenvalues. 1441-1451 - Kenji Kimura:
ff-factors, complete-factors, and component-deleted subgraphs. 1452-1463 - Hortensia Galeana-Sánchez, Mika Olsen:
Characterization of asymmetric CKI- and KP-digraphs with covering number at most 3. 1464-1474 - Brian Alspach, Cafer Çaliskan, Donald L. Kreher:
Orthogonal projection and liftings of Hamilton-decomposable Cayley graphs on abelian groups. 1475-1489 - Encarnación Abajo, Rocío M. Casablanca, Ana Diánez, Pedro García-Vázquez:
The Menger number of the strong product of graphs. 1490-1495 - Stefano Innamorati, Mauro Zannetti, Fulvio Zuanni:
A combinatorial characterization of the Hermitian surface. 1496-1499 - Vaidy Sivaraman:
Two short proofs of the bounded case of S.B. Rao's degree sequence conjecture. 1500-1501
Volume 313, Number 14, July 2013
- Haimiao Chen:
Enumerating typical abelian coverings of Cayley graphs. 1503-1510 - Gerard Jennhwa Chang, N. Narayanan:
On a conjecture on the balanced decomposition number. 1511-1514 - Sergey Kitaev, Jeffrey Liese:
Harmonic numbers, Catalan's triangle and mesh patterns. 1515-1531 - Neil I. Gillespie:
A note on binary completely regular codes with large minimum distance. 1532-1534 - Haimiao Chen:
Lifting automorphisms along abelian regular coverings of graphs. 1535-1539 - Nicolas Lichiardopol:
Proof of the Caccetta-Häggkvist conjecture for oriented graphs with positive minimum out-degree and of independence number two. 1540-1542 - Francesco Pavese:
Hyperovals on H(3, q2)H(3, q2) left invariant by a group of order 6(q+1)36(q+1)3. 1543-1546 - Raphael C. S. Machado, Celina M. H. de Figueiredo, Nicolas Trotignon:
Edge-colouring and total-colouring chordless graphs. 1547-1552 - Nathaniel Johnston:
Non-uniqueness of minimal superpermutations. 1553-1557 - Matthijs Bomhoff, Walter Kern, Georg Still:
A note on perfect partial elimination. 1558-1563
Volume 313, Number 15, August 2013
- Shi-Chao Chen:
Congruences for the number of kk-tuple partitions with distinct even parts. 1565-1568 - Adel Alahmadi, Robert E. L. Aldred, Romar dela Cruz, Patrick Solé, Carsten Thomassen:
The maximum number of minimal codewords in an [n, k][n, k]-code. 1569-1574 - Sergio Bermudo, José M. Rodríguez, José María Sigarreta, Jean-Marie Vilaire:
Gromov hyperbolic graphs. 1575-1585 - Jing Zhang:
Bicyclic BSECs of block size 3 and any λλ. 1586-1588 - Chuanan Wei, Dianxuan Gong, Jianbo Li:
Summation formulae for qq-Watson type 4ϕ34ϕ3-series. 1589-1593 - Tamás Király, Júlia Pap:
PPAD-completeness of polyhedral versions of Sperner's Lemma. 1594-1599 - Imre Bárány, Boris D. Ginzburg, Victor S. Grinberg:
2013 unit vectors in the plane. 1600-1601 - Alessandro Cincotti:
Analyzing nn-player Maundy Cake. 1602-1609 - Aijun Dong, Guojun Li, Guanghui Wang:
Equitable and list equitable colorings of planar graphs without 4-cycles. 1610-1619
Volume 313, Number 16, August 2013
- Nancy Eaton, Gary Tiner:
On the Erdős-Sós conjecture for graphs having no path with k+4 vertices. 1621-1629 - Rommel M. Barbosa, Márcia R. Cappelle, Dieter Rautenbach:
On graphs with maximal independent sets of few sizes, minimum degree at least 2, and girth at least 7. 1630-1635 - Ville Junnila, Tero Laihonen:
Optimal identification of sets of edges using 2-factors. 1636-1647 - Chuandong Xu, Shenggui Zhang, You Lu:
Covering digraphs with small indegrees or outdegrees by directed cuts. 1648-1654 - Xiaoling Zhang, Chris D. Godsil:
The inertia of distance matrices of some graphs. 1655-1664 - David Meier:
Corrigendum to "On the existence of latin squares with special distribution properties" [Discrete Math 311 (2011) 124-131]. 1665 - Hao Li, Ping Li, Mingquan Zhan, Taoye Zhang, Ju Zhou:
Z3Z3-connectivity in Abelian Cayley graphs. 1666-1676 - Carina Alves, Sueli I. R. Costa:
Commutative group codes in ℝ4, ℝ6, ℝ8 and ℝ16 - Approaching the bound. 1677-1687
Volume 313, Number 17, September 2013
- Konrad Sperfeld:
On the page number of complete odd-partite graphs. 1689-1696 - Edita Mácajová, Ján Mazák:
On even cycle decompositions of 4-regular line graphs. 1697-1699 - Oleg V. Borodin, Anna O. Ivanova:
Describing (d-2)-stars at d-vertices, d≤5, in normal plane maps. 1700-1709 - Oleg V. Borodin, Anna O. Ivanova:
Describing 4-stars at 5-vertices in normal plane maps with minimum degree 5. 1710-1714 - Bo Ning, Shenggui Zhang:
Ore- and Fan-type heavy subgraphs for Hamiltonicity of 2-connected graphs. 1715-1725 - Itai Benjamini, Van Cyr, Eviatar B. Procaccia, Ran J. Tessler:
Harmonic labeling of graphs. 1726-1745 - Hantao Zhang:
25 new rr-self-orthogonal Latin squares. 1746-1753 - Peter Borg:
Non-trivial intersecting uniform sub-families of hereditary families. 1754-1761
Volume 313, Number 18, September 2013
- Hua Han, Zai Ping Lu:
A note on connected cubic Cayley graphs. 1763-1766 - Filip Moric:
Small distances in convex polygons. 1767-1782 - Roger F. House:
A 4-dimensional graph has at least 9 edges. 1783-1789 - Mauro Biliotti, Alessandro Montinaro:
An infinite class of 2-designs with λ=1λ=1 containing a PSU(3, q)PSU(3, q)-invariant oval. 1790-1792 - John W. Estes, William Staton, Bing Wei:
A bound on the values of independence polynomials at -1/k-1/k for kk-degenerate graphs. 1793-1798 - Yuehua Bu, Daphne Der-Fen Liu, Xuding Zhu:
Backbone coloring for graphs with large girths. 1799-1804 - Peter Borg:
A Hilton-Milner-type theorem and an intersection conjecture for signed sets. 1805-1815 - Shi-Mei Ma:
Enumeration of permutations by number of alternating runs. 1816-1822 - Yong Zhang, Jianguo Lei:
Multimagic rectangles based on large sets of orthogonal arrays. 1823-1831
Volume 313, Number 19, October 2013
- Mirko Hornák, Stanislav Jendrol':
Preface. 1833-1834 - Jun Fujisawa, Michael D. Plummer, Akira Saito:
Forbidden subgraphs generating a finite set. 1835-1842 - Marta Borowiecka-Olszewska, Mariusz Haluszczak:
On Ramsey (K1, m, G)(K1, m, G)-minimal graphs. 1843-1855 - Keith J. Edwards:
Achromatic number of collections of paths and cycles. 1856-1860 - Tomás Feder, Pavol Hell, Shekoofeh Nekooei Rizi:
Obstructions to partitions of chordal graphs. 1861-1871 - Charles C. Lindner, Mariusz Meszka, Alexander Rosa:
Triple metamorphosis of twofold triple systems. 1872-1883 - Jan Ekstein, Premysl Holub, Tomás Kaiser, Maria Koch, Stephan Matos Camacho, Zdenek Ryjácek, Ingo Schiermeyer:
The rainbow connection number of 2-connected graphs. 1884-1892 - Hao Li:
Rainbow C3's and c4's in edge-colored graphs. 1893-1896 - Henry Martyn Mulder, Ladislav Nebesky:
Guides and shortcuts in graphs. 1897-1907 - Ayesha Shabbir, Tudor Zamfirescu:
Highly non-concurrent longest cycles in lattice graphs. 1908-1914 - Ralph J. Faudree, Ronald J. Gould:
A note on powers of Hamilton cycles in generalized claw-free graphs. 1915-1917 - L'udmila Bezegová:
Balanced degree-magic complements of bipartite graphs. 1918-1923 - Jens-P. Bode, Heiko Harborth:
The minimum size of kk-rainbow connected graphs of given order. 1924-1928 - Janina Müttel, Dieter Rautenbach:
A short proof of the versatile version of Fleischner's theorem. 1929-1933 - Roman Cada, Shuya Chiba:
Circumferences of 2-factors in claw-free graphs. 1934-1943 - Kenta Noguchi:
The empire problem in even embeddings on closed surfaces with ε≤0ε≤0. 1944-1951 - Moshe Rosenfeld, Vu Dinh Hoa:
Cubic factorizations. 1952-1960 - Izak Broere, Michael Dorfling:
The property of kk-colourable graphs is uniquely decomposable. 1961-1964 - Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, VI: Structural and functional jumps in complexity. 1965-1977 - Peter Hudák, Tomás Madaras:
On doubly light triangles in plane graphs. 1978-1988 - Stephan Brandt, Janina Müttel, Dieter Rautenbach:
Cycles in squares of trees without generalized claws. 1989-1999 - Martina Mockovciaková, Roman Soták:
Arbitrarily large difference between dd-strong chromatic index and its trivial lower bound. 2000-2006 - Zsolt Tuza:
Problems on cycles and colorings. 2007-2013 - Camino Balbuena, Mirka Miller, Jozef Sirán, Mária Zdímalová:
Large vertex-transitive graphs of diameter 2 from incidence graphs of biaffine planes. 2014-2019 - Timothy D. LeSaulnier, Douglas B. West:
Rainbow edge-coloring and rainbow domination. 2020-2025 - Gyula O. H. Katona, Zsolt Tuza:
Color the cycles. 2026-2033 - Hao Li:
Generalizations of Dirac's theorem in Hamiltonian graph theory - A survey. 2034-2053
Volume 313, Number 20, October 2013
- Zhengke Miao, Dong Ye, Cun-Quan Zhang:
Circuit extension and circuit double cover of graphs. 2055-2060 - Vladimir I. Benediktovich:
On rational approximation of a geometric graph. 2061-2064 - Hengjia Wei, Gennian Ge:
Group divisible designs with block size four and group type gum1gum1 for more small gg. 2065-2083 - David Rolnick:
The on-line degree Ramsey number of cycles. 2084-2093 - Lijun Ji, Rui Shen:
Constructions for large sets of v-1 {0, v/3}-intersecting Steiner triple systems of order v. 2094-2103 - Joe Chaffee, C. A. Rodger:
Group divisible designs with two associate classes, and quadratic leaves of triple systems. 2104-2114 - Guangfu Wang, Heping Zhang:
l1l1-embeddability under the edge-gluing operation on graphs. 2115-2118 - Patrick Bahls, Lauren Kutler, Sarah Mousley:
Estimates on the size of the cycle spectra of Hamiltonian graphs. 2119-2123 - Hua Sun:
A group action on noncrossing partitions. 2124-2126 - Gi-Sang Cheon, Ji-Hwan Jung, Louis W. Shapiro:
Generalized Bessel numbers and some combinatorial settings. 2127-2138 - Marcelo Tavares:
A remark about the density of the orbits of the Collatz permutation. 2139-2145 - Bing Zhou:
A lower bound for the chromatic capacity in terms of the chromatic number of a graph. 2146-2149 - Anuradha Sharma, Amit K. Sharma:
On a gg-fold joint mm-spotty Lee weight enumerator. 2150-2161 - Cheng Yeaw Ku, Kok Bin Wong:
Generalizing Tutte's theorem and maximal non-matchable graphs. 2162-2167 - Edward Early:
Chain lengths in the dominance lattice. 2168-2177 - Lijie Jia, Liping Yuan, Carol T. Zamfirescu, Tudor Zamfirescu:
Balanced triangulations. 2178-2191 - Aleksandra Eric, Carlos M. da Fonseca:
The maximum number of P-vertices of some nonsingular double star matrices. 2192-2194 - Serge C. Ballif:
Upper bounds on sets of orthogonal colorings of graphs. 2195-2205 - Michitaka Furuya, Shoichi Tsuchiya:
Forbidden subgraphs and the existence of a spanning tree without small degree stems. 2206-2212 - Bhaskar Bagchi, N. S. Narasimha Sastry:
Ovoidal packings of PG(3, q)PG(3, q) for even qq. 2213-2217 - Borut Luzar, Riste Skrekovski:
Improved bound on facial parity edge coloring. 2218-2222 - Rebecca Milley, Gabriel Renault:
Dead ends in misère play: The misère monoid of canonical numbers. 2223-2231 - Jaehoon Kim, Suil O:
Average connectivity and average edge-connectivity in graphs. 2232-2238 - Cheng Yeaw Ku, Kok Bin Wong:
A Kruskal-Katona type theorem for integer partitions. 2239-2246 - Emre Kolotoglu, Spyros S. Magliveras:
On large sets of projective planes of orders 3 and 4. 2247-2252 - Rade T. Zivaljevic:
Rotation number of a unimodular cycle: An elementary approach. 2253-2261 - Daniel Meister:
Two characterisations of the minimal triangulations of permutation graphs. 2262-2280 - Joshua D. Laison, Colin L. Starr, Andrea Walker:
Finite prime distance graphs and 2-odd graphs. 2281-2291 - Giuseppe Mazzuoccolo:
Covering a cubic graph with perfect matchings. 2292-2296 - Xin Zhang:
List total coloring of pseudo-outerplanar graphs. 2297-2306 - Teresa X. S. Li, Charles B. Mei, Melissa Y. F. Miao:
Eulerian pairs on Fibonacci words. 2307-2311 - Owen Hill, Diana Smith, Yingqian Wang, Lingji Xu, Gexin Yu:
Planar graphs without cycles of length 4 or 5 are (3, 0, 0)(3, 0, 0)-colorable. 2312-2317 - Bhaskar Bagchi, Basudeb Datta:
On kk-stellated and kk-stacked spheres. 2318-2329 - Ziming Duan, Lianying Miao, Cuiqi Wang, Zhengke Miao:
L(p, 2, 1)L(p, 2, 1)-labeling of the infinite regular trees. 2330-2336 - Gil Chun Kim, Yoonjin Lee:
A Cheeger inequality of a distance regular graph using Green's function. 2337-2347 - José Luis Cosme-Álvarez, Bernardo Llano:
The acyclic and C⃗3-free disconnection of tournaments. 2348-2353 - Hung-Chih Lee, Jenq-Jong Lin:
Decomposition of the complete bipartite graph with a 1-factor removed into cycles and stars. 2354-2358 - Lale Özkahya, Michael Young:
Anti-Ramsey number of matchings in hypergraphs. 2359-2364 - Rosário Fernandes, Henrique F. da Cruz:
An extension of Brualdi's algorithm for the construction of (0, 1)-matrices with prescribed row and column sum vectors. 2365-2379 - Tobias Fritz:
Corrigendum to "Velocity polytopes of periodic graphs and a no-go theorem for digital physics" [Discrete Mathematics 313 (2013) 1289-1301]. 2380
Volume 313, Number 21, November 2013
- Vahan V. Mkrtchyan, Samvel S. Petrosyan, Gagik N. Vardanyan:
Corrigendum to "On disjoint matchings in cubic graphs" [Discrete Math. 310 (2010) 1588-1613]. 2381 - Rodrigo O. Braga, Virginia M. Rodrigues, Vilmar Trevisan:
On the distribution of Laplacian eigenvalues of trees. 2382-2389 - Pavel Skums:
HH-product of graphs, HH-threshold graphs and threshold-width of graphs. 2390-2400 - Bhaswar B. Bhattacharya, Sandip Das:
On pseudo-convex partitions of a planar point set. 2401-2408 - Monther R. Alfuraidan:
Antipodal distance-transitive covers with primitive quotient of diameter two. 2409-2422 - Momoko Kobayashi, Atsuhiro Nakamoto, Tsubasa Yamaguchi:
Polychromatic 4-coloring of cubic even embeddings on the projective plane. 2423-2431 - Edita Pelantová, Stepán Starosta:
Languages invariant under more symmetries: Overlapping factors versus palindromic richness. 2432-2445 - Khodakhast Bibak:
On the determinant of bipartite graphs. 2446-2450 - Jianfa Qian, Lina Zhang:
New optimal subsystem codes. 2451-2455 - Rom Pinchasi:
Crossing by lines all edges of a line arrangement. 2456-2462 - Cheng Yeaw Ku, Kok Bin Wong:
An analogue of the Erdős-Ko-Rado theorem for weak compositions. 2463-2468 - Michael D. Barrus:
Hereditary unigraphs and Erdős-Gallai equalities. 2469-2481 - Ashwin Ganesan:
Automorphism groups of Cayley graphs generated by connected transposition sets. 2482-2485 - G. L. Morgan:
On symmetric and locally finite actions of groups on the quintic tree. 2486-2492 - Fan Yang, Xiangwen Li:
Degree sum of 3 independent vertices and Z3Z3-connectivity. 2493-2505 - Gurusamy Rengasamy Vijayakumar:
Dominating functions and total dominating functions of countable graphs. 2506-2511
Volume 313, Number 22, November 2013
- Genghua Fan:
The Erdős-Sós conjecture for spiders of large size. 2513-2517 - Sylwia Cichacz, Agnieszka Görlich, Zsolt Tuza:
Cordial labeling of hypertrees. 2518-2524 - Benoît Larose, Adrien Lemaître:
List-homomorphism problems on graphs and arc consistency. 2525-2537 - Yanxun Chang, Tao Feng, Giovanni Lo Faro, Antoinette Tripodi:
Metamorphosis of simple twofold triple systems into maximum twofold (K4-e)(K4-e)-packings. 2538-2546 - Eyal Ackerman, Rom Pinchasi:
Covering a chessboard with staircase walks. 2547-2551 - Szu-En Cheng, Sergi Elizalde, Anisse Kasraoui, Bruce E. Sagan:
Inversion polynomials for 321-avoiding permutations. 2552-2565 - Andrey B. Kupavskii, Andrei M. Raigorodskii, Maria V. Titova:
New bounds for the distance Ramsey number. 2566-2574 - Jiangmin Pan, Yin Liu:
There exist no arc-regular prime-valent graphs of order four times an odd square-free integer. 2575-2581 - Hortensia Galeana-Sánchez, César Hernández-Cruz, Manuel Alejandro Juárez-Camacho:
On the existence and number of (k+1)(k+1)-kings in kk-quasi-transitive digraphs. 2582-2591 - Richard A. Brualdi, Geir Dahl:
Majorization for partially ordered sets. 2592-2601 - Bao-Xuan Zhu:
Log-concavity and unimodality of compound polynomials. 2602-2606 - Huiqiu Lin, Stephen W. Drury:
The maximum Perron roots of digraphs with some given parameters. 2607-2613 - Noah Arbesfeld:
Partial permutations avoiding pairs of patterns. 2614-2625 - Torsten Mütze, Ueli Peter:
On globally sparse Ramsey graphs. 2626-2637 - Oleg V. Borodin, Alexandr V. Kostochka, Matthew P. Yancey:
On 11-improper 22-coloring of sparse graphs. 2638-2649 - Zoltán Miklós:
Hypergraphic submodular function minimization. 2650-2655 - Simone Ugolini:
Sequences of binary irreducible polynomials. 2656-2662 - Saeed Shaebani:
The bb-chromatic number of regular graphs via the edge-connectivity. 2663-2666
Volume 313, Number 23, December 2013
- Mei Lu, Yubao Guo, Michel Surmacs:
Strongly quasi-Hamiltonian-connected semicomplete multipartite digraphs. 2667-2672 - Vladimir P. Korzhik:
Proper 1-immersions of graphs triangulating the plane. 2673-2686 - Edoardo Ballico, Alberto Ravagnani:
The dual geometry of Hermitian two-point codes. 2687-2695 - Jian-Liang Wu, Xin Zhang, Hailuan Li:
Equitable vertex arboricity of graphs. 2696-2701 - Oleg V. Borodin, Anna O. Ivanova, Tommy R. Jensen, Alexandr V. Kostochka, Matthew P. Yancey:
Describing 3-paths in normal plane maps. 2702-2711 - Miles Eli Jones, Jeffrey B. Remmel:
A reciprocity method for computing generating functions over the set of permutations with no consecutive occurrence of a permutation pattern. 2712-2729 - Giuliano Gadioli La Guardia:
Nonbinary convolutional codes derived from group character codes. 2730-2736 - Yuehua Bu, Caixia Fu:
(1, 1, 0)-coloring of planar graphs without cycles of length 4 and 6. 2737-2741 - Márcia R. Cappelle, Dieter Rautenbach:
Extending Berge's and Favaron's results about well-covered graphs. 2742-2747 - Patrik Nystedt:
A combinatorial proof of associativity of Ore extensions. 2748-2750 - Wolfgang Haas:
On the general excess bound for binary codes with covering radius one. 2751-2762 - Yong Gao, Donovan R. Hare, James Nastos:
The cluster deletion problem for cographs. 2763-2771 - Ralph J. Faudree, Ronald J. Gould:
Precise location of vertices on Hamiltonian cycles. 2772-2777 - Ze-Tu Gao, Jian-Hua Yin:
The tt-pebbling number of C5□□C5. 2778-2791 - Lucia Morotti:
On multisets of hook lengths of partitions. 2792-2797 - Zbigniew Lonc, Karolina Warno:
Minimum size transversals in uniform hypergraphs. 2798-2815 - Christoph Neumann:
Constructing highly arc transitive digraphs using a direct fibre product. 2816-2829 - Mario Gionfriddo, Salvatore Milici:
On the existence of uniformly resolvable decompositions of Kv and Kv-I-I into paths and kites. 2830-2834 - Vahid Dabbaghian, Tiankuang Wu:
Recursive construction of non-cyclic pandiagonal Latin squares. 2835-2840 - Oleg V. Borodin, Anna O. Ivanova:
Describing 3-faces in normal plane maps with minimum degree 4. 2841-2847 - Hiroshi Maehara:
Euclidean embeddings of finite metric spaces. 2848-2856
Volume 313, Number 24, December 2013
- Geir Agnarsson:
On the number of hypercubic bipartitions of an integer. 2857-2864 - R. Krithika, Rogers Mathew, N. S. Narayanaswamy, N. Sadagopan:
A Dirac-type characterization of k-chordal graphs. 2865-2867 - Tobias Müller:
A counterexample to a conjecture of Grünbaum on piercing convex sets in the plane. 2868-2871 - Makoto Araya, Masaaki Harada:
There is no [21, 5, 14] code over F5. 2872-2874 - Jakub Przybylo:
Distant irregularity strength of graphs. 2875-2880 - Johannes Kellendonk, Daniel Lenz, Jean Savinien:
A characterization of subshifts with bounded powers. 2881-2894 - Vítor Costa, Simone Dantas, Dieter Rautenbach:
Matchings in graphs of odd regularity and girth. 2895-2902 - Mikio Kano, Haruhide Matsuda, Masao Tsugaki, Guiying Yan:
Spanning k-ended trees of bipartite graphs. 2903-2907 - Henry Escuadro, Futaba Fujie, Chad E. Musick:
On the total detection numbers of complete bipartite graphs. 2908-2917 - Rong Pan, Yanxun Chang:
Combinatorial constructions for maximum optical orthogonal signature pattern codes. 2918-2931 - Asaf Ferber, Michael Krivelevich, Alon Naor:
Avoider-Enforcer games played on edge disjoint hypergraphs. 2932-2941 - Chin-Mei Fu, Ming-Hway Huang, Yuan-Lung Lin:
On the existence of 5-sun systems. 2942-2950
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-12-04 01:29 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
