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