default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 309
Volume 309, Number 1, January 2009
- Jordan R. Bell, Brett Stevens:
A survey of known results and research areas for n-queens. 1-31 - Michael A. Henning
:
A survey of selected recent results on total domination in graphs. 32-63 - Xuezheng Lv, Chengdong Yi:
Cycles through 4 vertices in 3-connected graphs. 64-76 - Jianfeng Hou, Guizhen Liu, Jiansheng Cai:
Edge-choosability of planar graphs without adjacent triangles or without 7-cycles. 77-84 - Francisco Larrión, Miguel A. Pizaña, R. Villarroel-Flores:
The clique operator on matching and chessboard graphs. 85-93 - Sr. Arworn:
An algorithm for the numbers of endomorphisms on paths (DM13208). 94-103 - Zdenek Dvorák:
Two-factors in orientated graphs with forbidden transitions. 104-112 - Jochen Harant, Dieter Rautenbach:
Domination in bipartite graphs. 113-122 - Fred M. Hoppe:
The effect of redundancy on probability bounds. 123-127 - Ernest J. Cockayne, Richard G. Gibson, Christina M. Mynhardt:
Claw-free graphs are not universal fixers. 128-133 - Gek Ling Chia, Chee-Kit Ho:
Chromatic equivalence classes of complete tripartite graphs. 134-143 - Evelyne Flandrin, Hao Li, Bing Wei:
A sufficient condition for pancyclability of graphs. 144-150 - Masao Ishikawa, Jiang Zeng:
The Andrews-Stanley partition function and Al-Salam-Chihara polynomials. 151-175 - Raffaele Mosca:
The stable set polytope for some extensions of P4-free graphs. 176-187 - David Craft, Zevi Miller, Dan Pritikin:
A solitaire game played on 2-colored graphs. 188-201 - Xiang-Yong Sun, Jianliang Wu, Yu-Wen Wu, Jianfeng Hou:
Total colorings of planar graphs without adjacent triangles. 202-206 - Christoph Richard:
On q-functional equations and excursion moments. 207-230 - Alice Steimle, William Staton:
The isomorphism classes of the generalized Petersen graphs. 231-237 - Alexandra Ovetsky Fradkin:
On the well-coveredness of Cartesian products of graphs. 238-246 - Michael I. Hartley, Dimitri Leemans:
On locally spherical polytopes of type {5, 3, 5}. 247-254 - Sheng Chen, Sheng Kui Ye:
Critical groups for homeomorphism classes of graphs. 255-258 - S. Aparna Lakshmanan, Ambat Vijayakumar:
The (t)-property of some classes of graphs. 259-263 - Jinyang Chen, Jixiang Meng, Lihong Huang:
Super edge-connectivity of mixed Cayley graph. 264-270 - Satyan L. Devadoss:
A realization of graph associahedra. 271-276 - Oleg V. Borodin, Anna O. Ivanova, Alexandr V. Kostochka, Naeem N. Sheikh:
Planar graphs decomposable into a forest and a matching. 277-279 - Qiong Li, Yuehua Bu:
Equitable list coloring of planar graphs without 4- and 6-cycles. 280-287 - Yi Hong, Jian-Liang Lin, Zhi-Sui Tao, Zhi-Hong Chen:
The Hamiltonian index of graphs. 288-292
Volume 309, Number 2, January 2009
- Guglielmo Lunardon, Francesco Mazzocca, Nicola Melone, Domenico Olanda:
Preface. 293 - Ilaria Cardinali, Bart De Bruyn, Antonio Pasini:
On the simple connectedness of hyperplane complements in dual polar spaces. 294-303 - Bart De Bruyn:
The hyperplanes of DW(5, 2h) which arise from embedding. 304-321 - Dean Crnkovic:
A series of Siamese twin designs. 322-327 - Alberto Picone, Antonino Giorgio Spera:
Automorphisms of hyperelliptic GAG-codes. 328-340 - Hans Cuypers, A. De Wispelaere, Hendrik Van Maldeghem:
One-point extensions of generalized hexagons and octagons. 341-353 - Giovanni Lo Faro, Antoinette Tripodi:
The spectrum of I and I with any lambda. 354-362 - Eva Ferrara Dentice, Corrado Zanella:
Bose-Burton type theorems for finite Grassmannians. 363-370 - Lilya Budaghyan, Alexander Pott:
On differential uniformity and nonlinearity of functions. 371-384 - Lourens M. Pretorius, Konrad J. Swanepoel:
The Sylvester-Gallai theorem, colourings and algebra. 385-399 - Alan C. H. Ling, Charles J. Colbourn, Gaetano Quattrocchi:
Minimum embedding of Steiner triple systems into (K4-e)-designs II. 400-411 - Axel Kohnert:
(l, s)-extension of linear codes. 412-417 - Hiroaki Taniguchi:
A new family of dual hyperovals in I with d>=3. 418-429 - Norman L. Johnson:
Planes and processes. 430-461 - Joseph A. Thas:
SPG-reguli, SPG-systems, BLT-sets and sets with the BLT-property. 462-474 - Donatella Merlini, Renzo Sprugnoli, M. Cecilia Verri:
Combinatorial sums and implicit Riordan arrays. 475-486 - Charles Curtis Lindner, Gaetano Quattrocchi, Christopher A. Rodger:
Embedding Steiner triple systems in hexagon triple systems. 487-490 - Beukje Temmermans, Hendrik Van Maldeghem:
Some characterizations of the exceptional planar embedding of I. 491-496 - Hans-Joachim Kroll, Rita Vincenti:
Construction of caps by means of caps in complementary subspaces. 497-500 - Dalibor Froncek:
Oberwolfach rectangular table negotiation problem. 501-504 - Lucia Gionfriddo:
Hexagon kite systems. 505-512
Volume 309, Number 3, February 2009
- Jeffrey H. Dinitz, Hadi Kharaghani, Gholamreza B. Khosrovshahi, Shahriar Shahriari:
Preface. 513-514 - Gholamreza B. Khosrovshahi, Behruz Tayfeh-Rezaie:
Classification of simple 2-(11, 3, 3) designs. 515-520 - Tim Hsu, Mark J. Logan, Shahriar Shahriari:
Methods for nesting rank 3 normalized matching rank-unimodal posets. 521-531 - Andries E. Brouwer, Patric R. J. Östergård:
Classification of the (0, 2)-graphs of valency 8. 532-547 - Elena V. Konstantinova:
Vertex reconstruction in Cayley graphs. 548-559 - Navid Imani, Hamid Sarbazi-Azad, Selim G. Akl:
Some topological properties of star graphs: The surface area and volume. 560-569 - Ka Hin Leung, Qing Xiang:
On the dimensions of the binary codes of a class of unitals. 570-575 - Edwin R. van Dam, Willem H. Haemers:
Developments on spectral characterizations of graphs. 576-586 - Saeed Akbari, Sadegh Bolouki, Pooya Hatami, Milad Siami:
On the signed edge domination number of graphs. 587-594 - Saieed Akbari, F. Moazami, A. Mohammadian:
Commutativity of the adjacency matrices of graphs. 595-600 - Saieed Akbari, Ebrahim Ghorbani, Sanaz Zare:
Some relations between rank, chromatic number and energy of graphs. 601-605 - Richard M. Wilson:
On set systems with restricted intersections modulo p and p-ary t-designs. 606-612 - Saieed Akbari, Maryam Ghanbari, Sogol Jahanbekam, M. Jamaali:
List coloring of graphs having cycles of length divisible by a given number. 613-614
Volume 309, Number 4, March 2009
- Alessandro Conflitti:
On Whitney numbers of the order ideals of generalized fences and crowns. 615-621 - Hamideh Aram, Seyed Mahmoud Sheikholeslami, Odile Favaron:
Domination subdivision numbers of trees. 622-628 - Jianping Ou, Xiaohong Cheng, Jichang Wu:
On 3-restricted edge connectivity of undirected binary Kautz graphs. 629-638 - Allan Frendrup, Michael A. Henning, Bert Randerath, Preben D. Vestergaard:
An upper bound on the domination number of a graph with minimum degree 2. 639-646 - Zhiquan Hu, Hao Li:
Weak cycle partition involving degree sum conditions. 647-654 - Raul Cordovil, Braulio Maia Jr., Manoel Lemos:
Removing circuits in 3-connected binary matroids. 655-665 - Atsuhiro Nakamoto, Yoshiaki Oda, Katsuhiro Ota:
3-trees with few vertices of degree 3 in circuit graphs. 666-672 - Erkko Lehtonen, Ágnes Szendrei:
Equivalence of operations with respect to discriminator clones. 673-685 - M. H. Armanious, M. A. Elbiomy:
On semi-planar Steiner quasigroups. 686-692 - Anush Tserunyan:
Characterization of a class of graphs related to pairs of disjoint matchings. 693-713 - Tom De Medts, Hendrik Van Maldeghem:
The uniqueness of a generalized hexagon of order 3 containing a subhexagon of order (1, 3). 714-720 - Naiomi T. Cameron, Kendra Killpatrick:
k-ribbon Fibonacci tableaux. 721-740 - Martin Funk, Domenico Labbate, Vito Napolitano:
Tactical (de-)compositions of symmetric configurations. 741-747 - Longqin Wang, Zhengke Miao, Chao Yan:
Local bases of primitive non-powerful signed digraphs. 748-754 - Dancheng Lu, Tongsuo Wu:
On bipartite zero-divisor graphs. 755-762 - Luciano Panek, Marcelo Firer, Marcelo Muniz Silva Alves:
Symmetry groups of Rosenbloom-Tsfasman spaces. 763-771 - Klaus Denecke, Kittisak Saengsura:
Separation of clones of cooperations by cohyperidentities. 772-783 - Heather Jordon, Joy Morris:
Directed cyclic Hamiltonian cycle systems of the complete symmetric digraph. 784-796 - Ami Litman, Shiri Moran-Schein:
On smooth sets of integers. 797-813 - Jean-Luc Marichal:
Weighted lattice polynomials. 814-820 - Darryn E. Bryant, Melinda Buchanan, Ian M. Wanless:
The spectrum for quasigroups with cyclic automorphisms and additional symmetries. 821-833 - B. V. Subramanya Bharadwaj, L. Sunil Chandran:
Bounds on isoperimetric values of trees. 834-842 - Klaus Meer, Dieter Rautenbach:
On the OBDD size for graphs of bounded tree- and clique-width. 843-851 - Vladimir P. Korzhik:
Exponentially many nonisomorphic orientable triangular embeddings of K12s+3. 852-866 - Daya Ram Gaur, Kazuhisa Makino:
On the fractional chromatic number of monotone self-dual Boolean functions. 867-877 - Patrick Jacob, P. Mathieu:
Multiple partitions, lattice paths and a Burge-Bressoud-type correspondence. 878-886 - Takashi Agoh, Karl Dilcher:
Shortened recurrence relations for Bernoulli numbers. 887-898 - Zhao Zhang:
Semi-hyper-connected vertex transitive graphs. 899-907 - Shiying Wang, Shangwei Lin, Chunfang Li:
Sufficient conditions for super k-restricted edge connectivity in graphs of diameter 2. 908-919 - Kevin K. H. Cheung:
Maximal planar graphs of inscribable type and diagonal flips. 920-925 - Yinghua Duan, Haidong Wu, Qinglin Yu:
On Tutte polynomial uniqueness of twisted wheels. 926-936 - Mridul Aanjaneya:
Tromino tilings of domino-deficient rectangles. 937-944 - Haitao Cao, L. Wang, Ruizhong Wei:
The existence of HGDDs with block size four and its application to double frames. 945-949 - Primoz Potocnik, Mateja Sajna:
The existence of regular self-complementary 3-uniform hypergraphs. 950-954 - Babak Behsaz, Pooya Hatami:
Measure preserving homomorphisms and independent sets in tensor graph powers. 955-958 - Helmut Prodinger:
A simple bijection between a subclass of 2-binary trees and ternary trees. 959-961 - Christoph Buchheim, Peter J. Cameron, Taoyang Wu:
On the subgroup distance problem. 962-968 - Zsuzsanna Szaniszló, Maggy Tomova, Cindy Wyels:
The N-queens Problem on a symmetric Toeplitz matrix. 969-974 - Landang Yuan, Qingde Kang:
A tripling construction for overlarge sets of KTS. 975-981 - Xianyong Meng, Jianhua Guo, Rensuo Li, Tao Chen, Bentang Su:
The total chromatic number of Pseudo-Halin graphs with lower degree. 982-986 - Jun Zhang, Jinghua Xiang:
A generalization of Fan's results: Distribution of cycle lengths in graphs. 987-990 - Chunxiang Wang, Zhiquan Hu, Xiangwen Li:
A constructive characterization of total domination vertex critical graphs. 991-996 - Thomas Böhme, Alexandr V. Kostochka:
Many disjoint dense subgraphs versus large k-connected subgraphs in large graphs with given edge density. 997-1000 - He-Xi Ye, Chao Yang, Jun-Ming Xu:
Diameter vulnerability of graphs by edge deletion. 1001-1006 - Baogen Xu:
On signed cycle domination in graphs. 1007-1012 - Lutz Volkmann, Stefan Winzen:
Every cycle-connected multipartite tournament has a universal arc. 1013-1017
Volume 309, Number 5, March 2009
- Guantao Chen, Xingxing Yu, Wenan Zang:
Preface. 1019 - Zhiquan Hu, Hao Li:
Removable matchings and hamiltonian cycles. 1020-1024 - Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang:
Nowhere-zero 4-flow in almost Petersen-minor free graphs. 1025-1032 - Paul A. Catlin, Hong-Jian Lai, Yehong Shao:
Edge-connectivity and edge-disjoint spanning trees. 1033-1040 - Rui Xu:
Note on cycle double covers of graphs. 1041-1042 - Daqing Yang:
Relaxed very asymmetric coloring games. 1043-1050 - Qing Cui, Yumei Hu, Jian Wang:
Long cycles in 4-connected planar graphs. 1051-1059 - Yuqin Sun, Yusheng Li:
Size bipartite Ramsey numbers. 1060-1066 - T. C. Edwin Cheng, Yaojun Chen, C. T. Ng:
Codiameters of 3-domination critical graphs with toughness more than one. 1067-1078 - Tao Wang, Qinglin Yu:
Factor-critical property in 3-dominating-critical graphs. 1079-1083 - Yunqing Zhang, Ke Min Zhang:
The Ramsey number R(C8, K8). 1084-1090 - Qing Cui, Jian Wang:
Maximum bipartite subgraphs of cubic triangle-free planar graphs. 1091-1111 - Jin Yan, Guizhen Liu:
On 2-factors with cycles containing specified edges in a bipartite graph. 1112-1117 - Guoli Ding:
The edge version of Hadwiger's conjecture. 1118-1122 - Guoli Ding:
On canonical antichains. 1123-1134 - Ellen X. Y. Qu, Jianglu Wang:
Vertex pancyclicity in quasi-claw-free graphs. 1135-1141 - Alexandr V. Kostochka, B. Y. Stodolsky:
An upper bound on the domination number of n-vertex connected cubic graphs. 1142-1162 - Hao Li, Jianping Li:
(s, m)-radius of k-connected graphs. 1163-1177 - Ralph J. Faudree, Ronald J. Gould, Michael S. Jacobson:
Pancyclic graphs and linear forests. 1178-1189 - Mark N. Ellingham, D. Christopher Stephens:
The orientable genus of some joins of complete graphs with large edgeless graphs. 1190-1198
Volume 309, Number 6, April 2009
- Jocelyn Quaintance:
Word representations of m×n×p proper arrays. 1199-1212 - José Gómez:
On large vertex-symmetric digraphs. 1213-1221 - André Barbé, Fritz von Haeseler:
Frame cellular automata: Configurations, generating sets and related matroids. 1222-1254 - Tatsuya Maruta, Maori Shinohara, Ayako Kikui:
On optimal linear codes over F5. 1255-1272 - Joachim von Below, Simon Rénier:
A characterization of even doubly-stochastic matrices. 1273-1283 - Heping Zhang, Lifeng Ou, Haiyuan Yao:
Fibonacci-like cubes as Z-transformation graphs. 1284-1293 - Krzysztof Brys, Zbigniew Lonc:
Polynomial cases of graph decomposition: A complete solution of Holyer's problem. 1294-1326 - András Sárközy, Arne Winterhof:
Measures of pseudorandomness for binary sequences constructed using finite fields. 1327-1333 - Tatjana Gerzen:
Searching for an edge in a graph with restricted test sets. 1334-1346 - Zlatka Mateva, Svetlana Topalova:
Hadamard 2-(63, 31, 15) designs invariant under the dihedral group of order 10. 1347-1356 - Matthieu Latapy, Thi Ha Duong Phan:
The lattice of integer partitions and its infinite extension. 1357-1367 - Min Tang, Yong-Gao Chen:
On the monotonicity properties of additive representation functions, II. 1368-1373 - Christian Delhommé, Maurice Pouzet, Gábor Sági, Norbert Sauer:
Representation of ideals of relational structures. 1374-1384 - David G. Wagner, Yehua Wei:
A criterion for the half-plane property. 1385-1390 - Armen H. Zemanian:
The galaxies of nonstandard enlargements of infinite and transfinite graphs. 1391-1408 - Gabriela Araujo-Pardo, Camino Balbuena, Juan Carlos Valenzuela:
Constructions of bi-regular cages. 1409-1416 - Chunlin Liu, Zhenghua Wang:
A bijection between ordered trees and bicoloured ordered trees. 1417-1421 - Jianxing Yin, Chengmin Wang:
Kirkman covering designs with even-sized holes. 1422-1434 - John Irving, Amarpreet Rattan:
Minimal factorizations of permutations into star transpositions. 1435-1442 - Alexandru Nica, Ion Oancea:
Posets of annular non-crossing partitions of types B and D. 1443-1466 - Christophe Paul, Jan Arne Telle:
Edge-maximal graphs of branchwidth k: The k-branches. 1467-1475 - Luc Devroye, Ebrahim Malalla:
On the k-orientability of random graphs. 1476-1490 - Stephen G. Hartke, Kathleen Ponto:
k-ordered hamiltonicity of iterated line graphs. 1491-1497 - Mehmet Cenkci:
An explicit formula for generalized potential polynomials and its applications. 1498-1510 - Sylwia Cichacz, Yoshimi Egawa, Mariusz Wozniak:
Arbitrary decompositions into open and closed trails. 1511-1516 - Zongduo Dai, Guang Gong, Hong-Yeop Song:
A trace representation of binary Jacobi sequences. 1517-1527 - Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
Roman domination in regular graphs. 1528-1537 - Gek Ling Chia, Poh-Hwa Ong:
On self-clique graphs with given clique sizes, II. 1538-1547 - Marko Jakovac, Sandi Klavzar:
Vertex-, edge-, and total-colorings of Sierpinski-like graphs. 1548-1556 - T. C. Edwin Cheng, Yonglin Guo, Shenggui Zhang, Yongjun Du:
Extreme values of the sum of squares of degrees of bipartite graphs. 1557-1564 - Yoshimi Egawa, Yumiko Okadome, Masanori Takatou:
5-Shredders in 5-connected graphs. 1565-1574 - Manoj Changat, G. N. Prasanth, Joseph Mathews:
Triangle path transit functions, betweenness and pseudo-modular graphs. 1575-1583 - Kenta Ozeki, Tomoki Yamashita:
Hamiltonian cycles and dominating cycles passing through a linear forest. 1584-1592 - Taekyun Kim:
On a p-adic interpolation function for the q-extension of the generalized Bernoulli polynomials and its derivative. 1593-1602 - Kah Loon Ng:
On a conjecture concerning the orientation number of a graph. 1603-1610 - Gábor N. Sárközy:
A fast parallel algorithm for finding Hamiltonian cycles in dense graphs. 1611-1622 - Li-Da Tong:
The (a, b)-forcing geodetic graphs. 1623-1628 - Luigia Berardi, Tiziana Masini:
On sets of type (m, n)r-1 in PG(r, q). 1629-1636 - Weiping Wang, Tian-ming Wang:
Identities on Bell polynomials and Sheffer sequences. 1637-1648 - Lian-Cui Zuo, Qinglin Yu, Jianliang Wu:
Vertex arboricity of integer distance graph G(Dm, k). 1649-1657 - Matthew Kahle:
Topology of random clique complexes. 1658-1671 - Pilar Sabariego, Francisco Santos:
Triple-loop networks with arbitrarily many minimum distance diagrams. 1672-1684 - Robert Janczewski:
Greedy T-colorings of graphs. 1685-1690 - S. Parameshwara Bhatta:
A characterization of neutral elements by the exclusion of sublattices. 1691-1702 - Dieter Rautenbach, Lutz Volkmann:
On the existence of edge cuts leaving several large components. 1703-1707 - Beifang Chen, Arthur L. B. Yang:
A note on flow polynomials of graphs. 1708-1710 - Petr Gregor:
Perfect matchings extending on subcubes to Hamiltonian cycles of hypercubes. 1711-1713 - Kiyoshi Hosono:
On convex decompositions of a planar point set. 1714-1717 - David Richerby:
Interval bigraphs are unit grid intersection graphs. 1718-1719 - Chun-Gang Ji, Wei-Ping Li, Pieter Moree:
Values of coefficients of cyclotomic polynomials II. 1720-1723 - Dieter Kratsch, Haiko Müller:
On a property of minimal triangulations. 1724-1729 - Andrew Thomason, Peter Wagner:
Bounding the size of square-free subgraphs of the hypercube. 1730-1735 - Radoslav Fulek:
Linear bound on extremal functions of some forbidden patterns in 0-1 matrices. 1736-1739 - Talmage James Reid, Xiangqian Zhou:
On clone sets of GF(q)-representable matroids. 1740-1745 - Christopher R. H. Hanusa:
Applying a combinatorial determinant to count weighted cycle systems in a directed graph. 1746-1748 - Ying-Chao Hung:
A note on randomized Shepp's urn scheme. 1749-1759 - Tsai-Lien Wong, Xuding Zhu:
Distinguishing labeling of group actions. 1760-1765 - Ron Aharoni, Tibor Szabó:
Vizing's conjecture for chordal graphs. 1766-1768 - Blerta Shtylla, Lorenzo Traldi, Louis Zulli:
On the realization of double occurrence words. 1769-1773 - Iris Gaber-Rosenblum, Yehuda Roditty:
The depression of a graph and the diameter of its line graph. 1774-1778 - Xiaoming Pi, Huanping Liu:
On the characterization of trees with signed edge domination numbers 1, 2, 3, or 4. 1779-1782 - S. Beena:
On Sigma and Sigma ' labelled graphs. 1783-1787 - Artur Fortuna, Zdzislaw Skupien, Andrzej Zak:
Maximizing hamiltonian pairs and k-sets via numerous leaves in a tree. 1788-1792
Volume 309, Number 7, April 2009
- Patrick Healy, Nikola S. Nikolov:
Preface to GD'05 special issue. 1793 - Mark de Berg, Elena Mumford, Bettina Speckmann:
On rectilinear duals for vertex-weighted plane graphs. 1794-1812 - Therese Biedl, Franz-Josef Brandenburg, Xiaotie Deng:
On the complexity of crossings in permutations. 1813-1823 - Emilio Di Giacomo, Giuseppe Liotta, Henk Meijer, Stephen K. Wismath:
Volume requirements of 3D upward drawings. 1824-1837 - Markus Chimani, Carsten Gutwenger:
Non-planar core reduction of graphs. 1838-1855 - Pier Francesco Cortese, Giuseppe Di Battista, Maurizio Patrignani, Maurizio Pizzonia:
On embedding a cycle in a plane graph. 1856-1869 - Éric Fusy:
Transversal structures on triangulations: A combinatorial study and straight-line drawings. 1870-1894 - Tim Dwyer, Yehuda Koren, Kim Marriott:
Constrained graph layout by stress majorization and gradient projection. 1895-1908 - Markus Geyer, Michael Kaufmann, Imrich Vrto:
Two trees which are self-intersecting when drawn simultaneously. 1909-1916 - Jan Kyncl, Pavel Valtr:
On edges crossing few other edges in simple topological complete graphs. 1917-1923
Volume 309, Number 8, April 2009
- Zh. G. Nikoghosyan:
Dirac-type generalizations concerning large cycles in graphs. 1925-1930 - Shin-Shin Kao, Hong-Chun Hsu, Lih-Hsing Hsu:
Globally bi-3*-connected graphs. 1931-1946 - Boris D. Lubachevsky, Ronald L. Graham:
Minimum perimeter rectangles that enclose congruent non-overlapping circles. 1947-1962 - Siham Bekkai, David Forge, Mekkia Kouider:
Covering the vertices of a graph with cycles of bounded length. 1963-1966 - P. Seneviratne:
Partial permutation decoding for the first-order Reed-Muller codes. 1967-1970 - Geir T. Helleloid, Madeeha Khalid, David Petrie Moulton, Philip Matchett Wood:
Graph pegging numbers. 1971-1985 - Norbert Polat:
Netlike partial cubes II. Retracts and netlike subgraphs. 1986-1998 - Lawrence Somer, Michal Krízek:
On symmetric digraphs of the congruence xk = y (mod n). 1999-2009 - Gil Kaplan, Arieh Lev, Yehuda Roditty:
On zero-sum partitions and anti-magic trees. 2010-2014 - Bing Chen, Shenggui Zhang, Shengning Qiao:
Hamilton cycles in claw-heavy graphs. 2015-2019 - Alessandro Conflitti:
Enumerating Sn by associated transpositions and linear extensions of finite posets. 2020-2041 - Dirk Meierling, Lutz Volkmann:
On the number of cycles in local tournaments. 2042-2052 - Nicolas Bedaride:
Directional complexity of the hypercubic billiard. 2053-2066 - Heping Zhang, Shan Zhou:
Characterizations for P>=2-factor and P>=3-factor covered graphs. 2067-2076 - J. M. McDonald:
Achieving maximum chromatic index in multigraphs. 2077-2084 - Nadia Creignou, Hervé Daudé:
The SAT-UNSAT transition for random constraint satisfaction problems. 2085-2099 - Zbigniew R. Bogdanowicz:
Hamilton cycles in circulant digraphs with prescribed number of distinct jumps. 2100-2107 - Alexandre Pinlou:
An oriented coloring of planar graphs with girth at least five. 2108-2118 - Norbert Polat:
Netlike partial cubes III. The median cycle property. 2119-2133 - Jung-Ting Hung, Li-Da Tong, Hong-Tsu Wang:
The hull and geodetic numbers of orientations of graphs. 2134-2139 - Robert C. Brigham, Ronald D. Dutton, Teresa W. Haynes, Stephen T. Hedetniemi:
Powerful alliances in graphs. 2140-2147 - Yutaka Hiramine:
On affine difference sets and their multipliers. 2148-2152 - Timothy J. Hetherington:
Entire choosability of near-outerplane graphs. 2153-2165 - Brian Heinold:
Sum choice numbers of some graphs. 2166-2173 - Rongquan Feng, Jin Ho Kwak, Young Soo Kwon:
Enumerating typical abelian prime-fold coverings of a circulant graph. 2174-2179 - David Tankus, Michael Tarsi:
Greedily constructing maximal partial f-factors. 2180-2189 - William Y. C. Chen, Sabrina X. M. Pang:
On the combinatorics of the Pfaff identity. 2190-2196 - Lian-Hwao Huang, Gerard J. Chang:
L(h, k)-labelings of Hamming graphs. 2197-2201 - Olof Heden:
Full rank perfect codes and alpha-kernels. 2202-2216 - Louis Esperet, Pascal Ochem:
On circle graphs with girth at least five. 2217-2222 - Jason I. Brown, R. Hoshino:
Nordhaus-Gaddum inequalities for the fractional and circular chromatic numbers. 2223-2232 - Yongzhu Chen, Weiyi Zhu, Weifan Wang:
Edge choosability of planar graphs without 5-cycles with a chord. 2233-2238 - Arthur L. Liestman, Thomas C. Shermer, Ladislav Stacho:
Edge-disjoint spanners in tori. 2239-2249 - Patrick Bahls:
Asymptotic connectivity of infinite graphs. 2250-2259 - Shai Gutner, Michael Tarsi:
Some results on (a: b)-choosability. 2260-2270 - Primoz Sparl:
On the classification of quartic half-arc-transitive metacirculants. 2271-2283 - Thomas Zehrt:
The covolume of discrete subgroups of Iso(H2m). 2284-2291 - Jason I. Brown, Richard Hoshino:
Independence polynomials of circulants with an application to music. 2292-2304 - William Duckworth, Bernard Mans:
Connected domination of regular graphs. 2305-2322 - R. Julian R. Abel, Gennian Ge, Malcolm Greig, Alan C. H. Ling:
Further results on (v, {5, w*}, 1)-PBDs. 2323-2339 - Elizabeth Jonck, Johannes H. Hattingh, Charl J. Ras:
A characterization of lambdad, 1-minimal trees and other attainable classes. 2340-2348 - Saharon Shelah:
What majority decisions are possible. 2349-2364 - Rigoberto Flórez:
Harmonic conjugation in harmonic matroids. 2365-2372 - Yunshu Gao, Guojun Li, Xuechao Li:
Degree condition for the existence of a k-factor containing a given Hamiltonian cycle. 2373-2381 - Shixin Zhu, Xiaoshan Kai:
Dual and self-dual negacyclic codes of even length over Z2a. 2382-2391 - Ryuzo Torii:
Path transferability of graphs with bounded minimum degree. 2392-2397 - Deepak Kumar Dalai, Subhamoy Maitra, Sumanta Sarkar:
Results on rotation symmetric bent functions. 2398-2409 - Marcus Greferath, Ryan K. Therkelsen:
On coloured constant composition designs. 2410-2416 - Liming Xiong, Mei Lu, Longsheng Han:
The structure of even factors in claw-free graphs. 2417-2423 - Xiangwen Li:
On 3-choosable planar graphs of girth at least 4. 2424-2431 - Yubin Gao, Yanling Shao:
Double vertex digraphs of digraphs. 2432-2444 - Xueliang Fu, Yuansheng Yang, Baoqi Jiang:
On the domination number of generalized Petersen graphs P(n, 2). 2445-2451 - Ernst Schuster:
Uniformly resolvable designs with index one and block sizes three and four - with three or five parallel classes of block size four. 2452-2465 - Gábor Bacsó:
Complete description of forbidden subgraphs in the structural domination problem. 2466-2472 - Alewyn P. Burger, Michael A. Henning, Jan H. van Vuuren:
On the ratios between packing and domination parameters of a graph. 2473-2478 - Yi-Zheng Fan, Shi-Cai Gong, Yi Wang, Yu-Bin Gao:
First eigenvalue and first eigenvectors of a nonsingular unicyclic mixed graph. 2479-2487 - L. Sunil Chandran, Anita Das, Chintan D. Shah:
Cubicity, boxicity, and vertex cover. 2488-2496 - Guoce Xin, Terence Y. J. Zhang:
Enumeration of bilaterally symmetric 3-noncrossing partitions. 2497-2509 - Tongsuo Wu, Qiong Liu, Li Chen:
Zero-divisor semigroups and refinements of a star graph. 2510-2518 - Carlos M. da Fonseca, Ricardo Mamede:
On (0, 1)-matrices with prescribed row and column sum vectors. 2519-2527 - Byungchan Kim:
A short note on the overpartition function. 2528-2532 - Kyung-Won Hwang, Naeem N. Sheikh:
A note on convex subsets of Zk. 2533-2534 - Abhijin Adiga:
Cubicity of threshold graphs. 2535-2537 - Richard H. Hammack:
On direct product cancellation of graphs. 2538-2543 - Eric C. Mwambene:
Cayley graphs on left quasi-groups and groupoids representing k-generalised Petersen graphs. 2544-2547 - Jonathan Hulgan:
Concise proofs for adjacent vertex-distinguishing total colorings. 2548-2550 - Peter Katrenic, Gabriel Semanisin:
A note on the Path Kernel Conjecture. 2551-2554 - Rao Li:
Finding Hamiltonian cycles in {quasi-claw, K1, 5, K1, 5+e}-free graphs with bounded Dilworth numbers. 2555-2558 - Konstantinos Drakakis, Rod Gow, Liam O'Carroll:
On the symmetry of Welch- and Golomb-constructed Costas arrays. 2559-2563 - Andrey A. Dobrynin, Leonid S. Melnikov:
4-chromatic edge critical Grötzsch-Sachs graphs. 2564-2566 - Hossein Karami, Seyed Mahmoud Sheikholeslami, Abdollah Khodkar:
Lower bounds on the signed domination numbers of directed graphs. 2567-2570 - L. Sunil Chandran, K. Ashik Mathew:
An upper bound for Cubicity in terms of Boxicity. 2571-2574 - Xueliang Li, Jianhua Tu, Zemin Jin:
Bipartite rainbow numbers of matchings. 2575-2578 - Jian-Hua Yin:
A generalization of a conjecture due to Erdos, Jacobson and Lehel. 2579-2583 - Yidong Sun, Huajun Zhang:
Two kinds of hook length formulas for complete m-ary trees. 2584-2588 - Qinglun Yan:
A new proof of the septuple product identity. 2589-2591 - Deborah Chun:
Deletion-contraction to form a polymatroid. 2592-2595 - Hong Yan, Liying Kang, Guangjun Xu:
The exact domination number of the generalized Petersen graphs. 2596-2607 - Terry A. McKee, Lutz Volkmann:
Parity and disparity subgraphs. 2608-2612 - Miguel Angel Fiol, Ernest Garriga:
Number of walks and degree powers in a graph. 2613-2614 - Ermelinda DeLaViña, Ryan Pepper, Bill Waller:
A note on dominating sets and average distance. 2615-2619 - Matthew Walsh:
Minimum broadcast tree decompositions. 2620-2625
Volume 309, Number 9, May 2009
- Weiduan Feng, Shaofang Hong, Jianrong Zhao:
Divisibility properties of power LCM matrices by power GCD matrices on gcd-closed sets. 2627-2639 - Yidong Sun:
Potential polynomials and Motzkin paths. 2640-2648 - Sook Min, SeungKyung Park:
The maximal-inversion statistic and pattern-avoiding permutations. 2649-2657 - Alberto Del Lungo, Claudio Marini, Elisa Mori:
A polynomial-time algorithm for finding zero-sums. 2658-2662 - Peter E. John, Horst Sachs:
Spectra of toroidal graphs. 2663-2681 - Yanling Shao, Jian Shen, Yubin Gao:
The kth upper bases of primitive non-powerful signed digraphs. 2682-2686 - Cui Zhang, Jin-Xin Zhou, Yan-Quan Feng:
Automorphisms of cubic Cayley graphs of order 2pq. 2687-2695 - R. S. D. Thomas:
Isonemal prefabrics with only parallel axes of symmetry. 2696-2711 - David Aukerman, Ben Kane, Lawrence Sze:
On simultaneous s-cores/t-cores. 2712-2720 - Ju-Mok Oh:
A classification of cubic s-regular graphs of order 14p. 2721-2726 - Bolian Liu, Muhuo Liu:
On the spread of the spectrum of a graph. 2727-2732 - Yuichiro Miyamoto, Tomomi Matsui:
Perfectness and imperfectness of unit disk graphs on triangular lattice points. 2733-2744 - Ioan Tomescu:
Properties of connected graphs having minimum degree distance. 2745-2748 - Jonathan Cutler:
Trees through specified vertices. 2749-2754 - Dan McQuillan, James M. McQuillan:
Magic labelings of triangles. 2755-2762 - Fabio Pasticci, Thomas Westerbäck:
On rank and kernel of some mixed perfect codes. 2763-2774 - Wanzhou Ye, Liang Wang, Liguo Xu:
Properties of locally convergent sequences with respect to median filter. 2775-2781 - Daniel Soll, Volkmar Welker:
Type-B generalized triangulations and determinantal ideals. 2782-2797 - Premysl Holub, Liming Xiong:
On distance local connectivity and the hamiltonian index. 2798-2807 - Haitao Cao, Kejun Chen, Ruizhong Wei:
Super-simple balanced incomplete block designs with block size 4 and index 5. 2808-2814 - David Renault:
The vertex-transitive TLF-planar graphs. 2815-2833 - William Y. C. Chen, Sabrina X. M. Pang, Ellen X. Y. Qu, Richard P. Stanley:
Pairs of noncrossing free Dyck paths and noncrossing partitions. 2834-2838 - Youssef Boudabbous, Pierre Ille:
Indecomposability graph and critical vertices of an indecomposable graph. 2839-2846 - Mike J. Grannell, Vladimir P. Korzhik:
Orientable biembeddings of cyclic Steiner triple systems from current assignments on Möbius ladder graphs. 2847-2860 - Dániel Gerbner, Balázs Patkós:
Profile vectors in the lattice of subspaces. 2861-2869 - Tingting Li, Jianji Su:
A new lower bound on the number of trivially noncontractible edges in contraction critical 5-connected graphs. 2870-2876 - Peter Borg, Fred C. Holroyd:
The Erdos-Ko-Rado properties of various graphs containing singletons. 2877-2885 - Jun Yuan, Aixia Liu, Shiying Wang:
Sufficient conditions for bipartite graphs to be super-k-restricted edge connected. 2886-2896 - Pinar Anapa, Ibrahim Günaltili, Hendrik Van Maldeghem:
Planar and affine spaces. 2897-2904 - David Offner:
Some Turán type results on the hypercube. 2905-2912 - Mark Walters:
Rectangles as sums of squares. 2913-2921 - Florian Pfender:
A note on cycle spectra of line graphs. 2922-2924 - Rong Luo, Yue Zhao:
An application of Vizing and Vizing-like adjacency lemmas to Vizing's Independence Number Conjecture of edge chromatic critical graphs. 2925-2929 - Jinhua Wang:
Perfect dexagon triple systems with given subsystems. 2930-2933 - Shmuel Onn:
Two graph isomorphism polytopes. 2934-2936 - Xiaomin Li, Dengxin Li, Hong-Jian Lai:
The supereulerian graphs in the graph family C(l, k). 2937-2942 - Peter Dankelmann, Angelika Hellwig, Lutz Volkmann:
Inverse degree and edge-connectivity. 2943-2947 - Bogdan Oporowski, David Zhao:
Coloring graphs with crossings. 2948-2951 - Paul A. Russell:
Families intersecting on an interval. 2952-2956 - Darko Dimitrov, Elad Horev, Roi Krakovski:
Polychromatic colorings of rectangular partitions. 2957-2960
Volume 309, Number 10, May 2009
- Ahmed Ainouche:
beta-neighborhood closures for graphs. 2961-2967 - Ahmed Ainouche:
beta-degree closures for graphs. 2968-2973 - William Y. C. Chen, Amy M. Fu, Iris F. Zhang:
Faulhaber's theorem on power sums. 2974-2981 - Xianwei Sun, Gennian Ge:
Resolvable group divisible designs with block size four and general index. 2982-2989 - Bostjan Bresar, Tadeja Kraner Sumenjak:
Cube intersection concepts in median graphs. 2990-2997 - Qin Ma, Jian-Liang Wu, Xiao Yu:
Planar graphs without 5-cycles or without 6-cycles. 2998-3005 - Cheryl E. Praeger, Cai Heng Li, Linda Stringer:
Common circulant homogeneous factorisations of the complete digraph. 3006-3012 - Ronald J. Gould, Jeffrey S. Powell, Brian C. Wagner, Thor Whalen:
Minimum degree and pan-k-linked graphs. 3013-3022 - Bart De Bruyn:
On the intersection of distance-j-ovoids and subpolygons of generalized polygons. 3023-3031 - Aristidis Sapounakis, Ioannis Tasoulas, Panagiotis Tsikouras:
Enumeration of strings in Dyck paths: A bijective approach. 3032-3039 - Péter L. Erdös, Lajos Soukup:
Quasi-kernels and quasi-sinks in infinite graphs. 3040-3048 - Stavros D. Nikolopoulos, Leonidas Palios, Charis Papadopoulos:
Maximizing the number of spanning trees in Kn-complements of asteroidal graphs. 3049-3060 - Elizabeth J. Billington, Nicholas J. Cavenagh, Benjamin R. Smith:
Path and cycle decompositions of complete equipartite graphs: Four parts. 3061-3073 - Zbigniew R. Bogdanowicz:
Undirected simple connected graphs with minimum number of spanning trees. 3074-3082 - Federico Ardila, Elitza N. Maneva:
Pruning processes and a new characterization of convex geometries. 3083-3091 - Y. H. Peng, Gee-Choon Lau:
Chromatic classes of 2-connected (n, n+4)-graphs with three triangles and one induced 4-cycle. 3092-3101 - Khurram Shafique, Ronald D. Dutton:
Partitioning a graph into alliance free sets. 3102-3105 - Nevena Francetic, Mateja Sajna:
More on almost self-complementary graphs. 3106-3112 - Christian M. Reidys:
Large components in random induced subgraphs of n-cubes. 3113-3124 - Eyal Loz:
Graphs of given degree and diameter obtained as abelian lifts of dipoles. 3125-3130 - Zhihong He, Torsten Korneffel, Dirk Meierling, Lutz Volkmann, Stefan Winzen:
Complementary cycles in regular multipartite tournaments, where one cycle has length five. 3131-3149 - Ju-Mok Oh:
A classification of cubic s-regular graphs of order 16p. 3150-3155 - András Gyárfás, Penny E. Haxell:
Large monochromatic components in colorings of complete 3-uniform hypergraphs. 3156-3160 - Jianji Su, Xiaofeng Guo, Liqiong Xu:
Removable edges in a k-connected graph and a construction method for k-connected graphs. 3161-3165 - Josep Conde, Joan Gimbert:
On the existence of graphs of diameter two and defect two. 3166-3172 - Zhi-Hong Chen, Peter C. B. Lam, Wai-Chee Shiu:
Collapsible graphs and reductions of line graphs. 3173-3184 - Hungyung Chang, Xuding Zhu:
Colouring games on outerplanar graphs and trees. 3185-3196 - Hirobumi Mizuno, Iwao Sato:
A new Bartholdi zeta function of a digraph II. 3197-3204 - John P. McSorley, Philip Feinsilver:
Multivariate matching polynomials of cyclically labelled graphs. 3205-3218 - Dibyendu De, Neil Hindman:
Image partition regularity near zero. 3219-3232 - L. Sunil Chandran, Mathew C. Francis, Santhosh Suresh:
Boxicity of Halin graphs. 3233-3237 - Pak Tung Ho:
The toroidal crossing number of K4, n. 3238-3248 - Loni Delaplane, Talmage James Reid, Haidong Wu, Xiangqian Zhou:
On minor-minimally 3-connected binary matroids. 3249-3254 - Washiela Fish, Jennifer D. Key, Eric C. Mwambene:
Graphs, designs and codes related to the n-cube. 3255-3269 - Robert Janczewski, Adrian Kosowski, Michal Malafiejski:
The complexity of the L(p, q)-labeling problem for bipartite planar graphs of small degree. 3270-3279 - Robert R. Rubalcaba, Matt Walsh:
Minimum fractional dominating functions and maximum fractional packing functions. 3280-3291 - Nancy E. Clarke:
A witness version of the Cops and Robber game. 3292-3298 - Alexander Engström:
Complexes of directed trees and independence complexes. 3299-3309 - Peter Borg:
On t-intersecting families of signed sets and permutations. 3310-3317 - Alain Plagne:
A remark on Haas' method. 3318-3322 - Daqing Yang:
Activation strategy for relaxed asymmetric coloring games. 3323-3335 - Li Shang, Heping Zhang:
Degree conditions for graphs to be lambda3-optimal and super-lambda3. 3336-3345 - Hongmei Liu, Weiping Wang:
Some identities on the Bernoulli, Euler and Genocchi polynomials via power sums and alternate power sums. 3346-3363 - Yuanping Zhang, Xiaogang Liu, Bingyan Zhang, Xuerong Yong:
The lollipop graph is determined by its Q-spectrum. 3364-3369 - He Chen, Xueliang Li, Jianhua Tu:
Complete solution for the rainbow numbers of matchings. 3370-3380 - Christian Sommer:
A note on coloring sparse random graphs. 3381-3384 - Zan-Bo Zhang, Yueping Li, Dingjun Lou:
M-alternating Hamilton paths and M-alternating Hamilton cycles. 3385-3392 - Pablo Spiga:
CI-property of elementary abelian 3-groups. 3393-3398 - Stasys Jukna, Alexander S. Kulikov:
On covering graphs by complete bipartite subgraphs. 3399-3403 - Abderrahim Boussaïri, Pierre Ille:
The recognition of the class of indecomposable digraphs under low hemimorphy. 3404-3407 - Bahattin Yildiz:
A Combinatorial construction of the Gray map over Galois rings. 3408-3412 - Xinmin Hou, You Lu:
On the {k}-domination number of Cartesian products of graphs. 3413-3419 - Konstantinos Panagiotou, Angelika Steger:
A note on the chromatic number of a dense random graph. 3420-3423 - Jonathan Ariel Barmak, Elias Gabriel Minian:
Automorphism groups of finite posets. 3424-3426 - Anja Kohl:
The L(d, 1)-number of powers of paths. 3427-3430 - Zhiping Wang, Yutang Zou, Haiying Liu, Zhongtuo Wang:
Graham's pebbling conjecture on product of thorn graphs of complete graphs. 3431-3435 - Christopher Belford, Nándor Sieben:
Rubbling and optimal rubbling of graphs. 3436-3446 - Odile Favaron, Hossein Karami, R. Khoeilar, Seyed Mahmoud Sheikholeslami:
On the Roman domination number of a graph. 3447-3451 - Peter Dankelmann, Ivan Gutman, Simon Mukwembi, Henda C. Swart:
The edge-Wiener index of a graph. 3452-3457 - Sivaramakrishnan Sivasubramanian:
Average distance in graphs and eigenvalues. 3458-3462
Volume 309, Number 11, June 2009
- Olivier Delmas, André Raspaud:
Preface. 3463-3464 - Fabrice Bazzaro, Cyril Gavoille:
Localized and compact data-structure for comparability graphs. 3465-3484 - Flavia Bonomo, Maria Chudnovsky, Guillermo Durán:
Partial characterizations of clique-perfect graphs II: Diamond-free and Helly circular-arc graphs. 3485-3499 - P. V. Skums, S. V. Suzdal, R. I. Tyshkevich:
Edge intersection graphs of linear 3-uniform hypergraphs. 3500-3517 - Pierre Ille:
A proof of a conjecture of Sabidussi on graphs idempotent under the lexicographic product. 3518-3522 - Weifan Wang:
The edge-face coloring of graphs embedded in a surface of characteristic zero. 3523-3533 - Shinya Fujita:
Degree conditions for the partition of a graph into cycles, edges and isolated vertices. 3534-3540 - André Raspaud, Heiko Schröder, Ondrej Sýkora, Lubomir Torok, Imrich Vrto:
Antibandwidth and cyclic antibandwidth of meshes and hypercubes. 3541-3552 - Frédéric Havet:
Choosability of the square of planar subcubic graphs with large girth. 3553-3563 - Stephan Dominique Andres:
Lightness of digraphs in surfaces and directed game chromatic number. 3564-3579 - Mingchu Li, Yongrui Cui, Liming Xiong, Yuan Tian, He Jiang, Xu Yuan:
Circumferences and minimum degrees in 3-connected claw-free graphs. 3580-3587 - Antoni Marczyk:
An Ore-type condition for arbitrarily vertex decomposable graphs. 3588-3594 - Éric Duchêne, Sylvain Gravier:
Geometrical extensions of Wythoff's game. 3595-3608 - Anant P. Godbole, Nathaniel G. Watson, Carl R. Yerger:
Threshold and complexity results for the cover pebbling game. 3609-3624 - Andrei Gagarin, Wendy J. Myrvold, John Chambers:
The obstructions for toroidal graphs with no K3, 3's. 3625-3631 - Sylvain Coulonges, Arnaud Pêcher, Annegret Katrin Wagler:
Triangle-free strongly circular-perfect graphs. 3632-3643 - Kahina Meslem, Méziane Aïder:
On an extension of distance hereditary graphs. 3644-3652 - Haruhide Matsuda, Hajime Matsumura:
Degree conditions and degree bounded trees. 3653-3658 - Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
Note on upper bound graphs and forbidden subposets. 3659-3663 - Simone Dantas, Sulamita Klein, Célia Picinin de Mello, Aurora Morgana:
The Graph Sandwich Problem for P4-sparse graphs. 3664-3673 - Isma Bouchemakh, Saliha Ouatiki:
On the domatic and the total domatic numbers of the 2-section graph of the order-interval hypergraph of a finite poset. 3674-3679 - Hortensia Galeana-Sánchez, Mucuy-kak Guevara:
Some sufficient conditions for the existence of kernels in infinite digraphs. 3680-3693 - Daniel Gonçalves, Pascal Ochem:
On star and caterpillar arboricity. 3694-3702 - Denise Amar, Evelyne Flandrin, Grzegorz Gancarzewicz:
A degree condition implying that every matching is contained in a hamiltonian cycle. 3703-3713 - François Genest:
Circle graphs and the cycle double cover conjecture. 3714-3725 - Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
Arbitrarily vertex decomposable suns with few rays. 3726-3732
Volume 309, Number 12, June 2009
- Limin Zhang, Wenjun Shi, Xianzhen Huang, Guangrong Li:
New results on chromatic index critical graphs. 3733-3737 - Teturo Kamae:
Uniform sets and complexity. 3738-3747 - Gabriel Verret:
Shifts in Cayley graphs. 3748-3756 - Marios Mavronicolas, Loizos Michael:
A substitution theorem for graceful trees and its applications. 3757-3766 - Ko-Wei Lih, Daphne Der-Fen Liu, Wei-Fan Wang:
On (d, 1)-total numbers of graphs. 3767-3773 - Geoffrey Pearce:
On transitive decompositions of disconnected graphs. 3774-3778 - Liming Xiong, Minmin Zong:
Traceability of line graphs. 3779-3785 - Stephan Brandt, Jozef Miskuf, Dieter Rautenbach:
Edge irregular total labellings for graphs of linear size. 3786-3792 - Bertrand Lemaire, Marc Le Menestrel:
Generalized homothetic biorders. 3793-3810 - Michael Ferrara, Ronald J. Gould, Gerard Tansey, Thor Whalen:
Disjoint hamiltonian cycles in bipartite graphs. 3811-3820 - Ragnar Freij:
Equivariant discrete Morse theory. 3821-3829 - Feng-Zhen Zhao:
Sums of products of Cauchy numbers. 3830-3842 - Andreas Brandstädt, Van Bang Le, Dieter Rautenbach:
A forbidden induced subgraph characterization of distance-hereditary 5-leaf powers. 3843-3852 - Endre Boros, Vladimir Gurvich:
Vertex- and edge-minimal and locally minimal graphs. 3853-3865 - Jiaojiao Wu:
Some results on the incidence coloring number of a graph. 3866-3870 - Lali Barrière, Cristina Dalfó, Miguel Angel Fiol, Margarida Mitjana:
The generalized hierarchical product of graphs. 3871-3881 - Dominique Barth, Hervé Fournier, Romain Ravaux:
On the shape of decomposable trees. 3882-3887 - Wenchang Chu, Chenying Wang:
Bilateral inversions and terminating basic hypergeometric series identities. 3888-3904 - Birgit van Dalen:
Stability results for uniquely determined sets from two directions in discrete tomography. 3905-3916 - Yuejian Peng, Cheng Zhao:
On non-strong jumping numbers and density structures of hypergraphs. 3917-3929 - Junling Zhou, Yanxun Chang:
Existence of good large sets of Steiner triple systems. 3930-3935 - Brian Drake:
Limits of areas under lattice paths. 3936-3953 - Ryoh Fuji-Hara, Koji Momihara, Mieko Yamada:
Perfect difference systems of sets and Jacobi sums. 3954-3961 - Tian-Xiao He, Renzo Sprugnoli:
Sequence characterization of Riordan arrays. 3962-3974 - Pascale Charpin, Tor Helleseth, Victor A. Zinoviev:
Divisibility properties of classical binary Kloosterman sums. 3975-3984 - József Balogh, Alexandr V. Kostochka, Noah Prince, Michael Stiebitz:
The Erdos-Lovász Tihany conjecture for quasi-line graphs. 3985-3991 - Ágnes Tóth:
On the ultimate lexicographic Hall-ratio. 3992-3997 - Gregory R. Conner, Christopher P. Grant:
Neighborhood monotonicity, the extended Zermelo model, and symmetric knockout tournaments. 3998-4010 - Jianglu Wang, Min Li:
Fully cycle extendability of K1, 4-restricted graphs. 4011-4016 - Jakub Teska:
On 2-walks in chordal planar graphs. 4017-4026 - Hanna Furmanczyk, Adrian Kosowski, Bernard Ries, Pawel Zylinski:
Mixed graph edge coloring. 4027-4036 - Fabien Lange, Michel Grabisch:
The interaction transform for functions on lattices. 4037-4048 - Iliya Bouyukliev:
Classification of Griesmer codes and dual transform. 4049-4068 - R. Julian R. Abel, Diana Combe, Georgina Price, William D. Palmer:
Existence of generalized Bhaskar Rao designs with block size 3. 4069-4078 - Toufik Mansour, Yidong Sun:
Identities involving Narayana polynomials and Catalan numbers. 4079-4088 - Gee-Choon Lau, Y. H. Peng:
On the chromaticity of complete multipartite graphs with certain edges added. 4089-4094 - Jianbing Niu, Cun-Quan Zhang:
Cliques, minors and apex graphs. 4095-4107 - Eva Yu-Ping Deng, Mark Dukes, Toufik Mansour, Susan Y. J. Wu:
Symmetric Schröder paths and restricted involutions. 4108-4115 - Laura Sheppardson:
Intersections of largest bonds in k-connected graphs. 4116-4122 - Jan Florek, Kazimierz Florek:
Billiard and the five-gap theorem. 4123-4129 - Jeremy Holden, Dan McQuillan, James M. McQuillan:
A conjecture on strong magic labelings of 2-regular graphs. 4130-4136 - Haiying Wang:
The sum numbers and the integral sum numbers of the graph Kn+1\\E(K1, r). 4137-4143 - Sizhong Zhou:
Independence number, connectivity and (a, b, k)-critical graphs. 4144-4148 - Sonny Ben-Shimon, Michael Krivelevich:
Random regular graphs of non-constant degree: Concentration of the chromatic number. 4149-4161 - Wangsen Feng:
Bounds on maximum b-matchings. 4162-4165 - Romeo Rizzi:
Approximating the maximum 3-edge-colorable subgraph problem. 4166-4170 - Zsolt Lengvárszky:
On the combinatorics of an origami model. 4171-4175 - Niranjan Balachandran, Niraj Khare:
Graphs with restricted valency and matching number. 4176-4180 - Nicola Apollonio:
Integrality properties of edge path tree families. 4181-4184 - Peter J. Cameron:
Decompositions of complete multipartite graphs. 4185-4186 - David Callan:
Pattern avoidance in "flattened" partitions. 4187-4191 - Robert Connelly:
Comments on generalized Heron polynomials and Robbins' conjectures. 4192-4196 - Jeffrey O. Shallit:
Hamming distance for conjugates. 4197-4199 - Aziz Moukrim, Eric Sanlaville:
A polynomial algorithm for recognizing the Am-order class. 4200-4204 - Li-Da Tong:
Geodetic sets and Steiner sets in graphs. 4205-4207 - David Cariolaro:
A theorem in edge colouring. 4208-4209 - Nathan Keller, Haran Pilpel:
Linear transformations of monotone functions on the discrete cube. 4210-4214
Volume 309, Number 13, July 2009
- Kyohei Kozawa, Yota Otachi, Koichi Yamazaki:
On spanning tree congestion of graphs. 4215-4224 - Karl Strambach, Izabella Stuhl:
Translation groups of Steiner loops. 4225-4227 - Pierre Hansen, Damir Vukicevic:
Variable neighborhood search for extremal graphs. 23. On the Randic index and the chromatic number. 4228-4234 - Rongxia Hao, Jianbing Niu, Xiaofeng Wang, Cun-Quan Zhang, Taoye Zhang:
A note on Berge-Fulkerson coloring. 4235-4240 - Xi-Ying Yuan, Hai-Ying Shan, Yue Liu:
On the Laplacian spectral radii of trees. 4241-4246 - Tao Jiang:
Canonical Ramsey numbers and properly colored cycles. 4247-4252 - Robert F. Bailey:
Error-correcting codes from permutation groups. 4253-4265 - Kenta Ozeki:
A degree sum condition for graphs to be prism hamiltonian. 4266-4269 - Shan Zhou, Heping Zhang:
Minimal 2-matching-covered graphs. 4270-4279 - Gerard J. Chang, Chen-Ying Lin, Li-Da Tong:
Independent arcs of acyclic orientations of complete r-partite graphs. 4280-4286 - Francesco M. Malvestuto:
Canonical and monophonic convexities in hypergraphs. 4287-4298 - Hossein Hajiabolhassan:
On colorings of graph powers. 4299-4305 - Rico Zenklusen, Bernard Ries, Christophe Picouleau, Dominique de Werra, Marie-Christine Costa, Cédric Bentz:
Blockers and transversals. 4306-4314 - Ying Liu, Yue Liu:
The ordering of unicyclic graphs with the smallest algebraic connectivity. 4315-4325 - Vladimir Nikiforov:
Complete r-partite subgraphs of dense r-graphs. 4326-4331 - George F. Georgakopoulos, Dimitris J. Kavvadias, Leonidas G. Sioutis:
Nash equilibria in all-optical networks. 4332-4342 - David S. Lyubshin, Sergey V. Savchenko:
Cayley digraphs with normal adjacency matrices. 4343-4348 - Guanghui Wang, Hao Li:
Color degree and alternating cycles in edge-colored graphs. 4349-4354 - B. Javad Ebrahimi, Nafiseh Jahanbakht, Ebadollah S. Mahmoodian:
Vertex domination of generalized Petersen graphs. 4355-4361 - Norbert Polat:
Netlike partial cubes, V: Completion and netlike classes. 4362-4376 - Caroline J. Klivans, Kathryn L. Nyman, Bridget Eileen Tenner:
Relations on generalized degree sequences. 4377-4383 - Aleksandrs Slivkins, Jehoshua Bruck:
Interleaving schemes on circulant graphs with two offsets. 4384-4398 - Ramin Javadi, Behnaz Omoomi:
On b-coloring of the Kneser graphs. 4399-4408 - Wai Chee Shiu, Lian-zhu Zhang:
The maximum Randic index of chemical trees with k pendants. 4409-4416 - Teturo Kamae, Hui Rao, Bo Tan, Yu-Mei Xue:
Super-stationary set, subword problem and the complexity. 4417-4427 - Gerry Myerson, Jacky Poon, Jamie Simpson:
Incongruent restricted disjoint covering systems. 4428-4434 - Ernst Schuster:
Uniformly resolvable designs with index one, block sizes three and five and up to five parallel classes with blocks of size five. 4435-4442 - Ronald D. Dutton:
On a graph's security number. 4443-4447 - Yanmei Hong, Zhao Zhang, Qinghai Liu:
Edges of degree k in minimally restricted k-edge connected graphs. 4448-4455 - Endre Boros, Vladimir Gurvich, Kazuhisa Makino:
Minimal and locally minimal games and game forms. 4456-4468 - Min-Jen Jou, Jenq-Jong Lin:
Trees with the second largest number of maximal independent sets. 4469-4474 - Josephine Emms, David M. Evans:
Constructing continuum many countable, primitive, unbalanced digraphs. 4475-4480 - Toufik Mansour, Nohad Mbarieky:
Partitions of a set satisfying certain set of conditions. 4481-4488 - J. A. Dias da Silva, Melvyn B. Nathanson:
Maximal Sidon sets and matroids. 4489-4494 - Wensong Lin, Xuding Zhu:
Circular game chromatic number of graphs. 4495-4501 - Shuqin Fan, Xiaozhe Wang:
Primitive normal polynomials with the specified last two coefficients. 4502-4513 - Louis Esperet, Xuding Zhu:
Game colouring of the square of graphs. 4514-4521 - Péter Csikvári:
On a conjecture of V. Nikiforov. 4522-4526 - Amin Coja-Oghlan, Mihyun Kang:
The evolution of the min-min random graph process. 4527-4544 - Jonathan Chappelon:
Regular Steinhaus graphs of odd degree. 4545-4554 - Bing Wang, Zhao Zhang:
On cyclic edge-connectivity of transitive graphs. 4555-4563 - Michael Kiermaier, Sascha Kurz:
Maximal integral point sets in affine planes over finite fields. 4564-4575 - Gadi Aleksandrowicz, Gill Barequet:
Counting polycubes without the dimensionality curse. 4576-4583 - Radomír Halas, Marek Jukl:
On Beck's coloring of posets. 4584-4589 - András Gyárfás, Gábor N. Sárközy, Endre Szemerédi:
Stability of the path-path Ramsey number. 4590-4595 - Huajing Lu, Yingqian Wang, Weifan Wang, Yuehua Bu, Mickaël Montassier, André Raspaud:
On the 3-colorability of planar graphs without 4-, 7- and 9-cycles. 4596-4607 - Gek Ling Chia, Siew-Hui Ong, Li Y. Tan:
On graphs whose square have strong hamiltonian properties. 4608-4613 - Daqing Yang:
Generalization of transitive fraternal augmentations for directed graphs and its applications. 4614-4623 - Yaming Yu:
Bounds on the location of the maximum Stirling numbers of the second kind. 4624-4627 - Jia Shen:
Packing and covering k-chain free subsets in Boolean lattices. 4628-4634 - Haixing Zhao, Ruying Liu:
On the minimum real roots of the adjoint polynomial of a graph. 4635-4641 - Shengning Qiao, Shenggui Zhang:
Degree sum conditions for oriented forests in digraphs. 4642-4645 - Manu Basavaraju, L. Sunil Chandran:
A note on acyclic edge coloring of complete bipartite graphs. 4646-4648 - Shiying Wang, Shangwei Lin:
The k-restricted edge connectivity of undirected Kautz graphs. 4649-4652 - Christian Löwenstein, Dieter Rautenbach, Friedrich Regen:
On spanning tree congestion. 4653-4655 - Kaori Umezawa, Koichi Yamazaki:
Tree-length equals branch-length. 4656-4660
Volume 309, Number 14, July 2009
- Lars Døvling Andersen, Chris Rodger:
Preface. 4661-4662 - Jennifer D. Key, Jamshid Moori, Bernardo Gabriel Rodrigues:
Ternary codes from graphs on triples. 4663-4681 - Dezheng Xie, Cun-Quan Zhang:
Flows, flow-pair covers and cycle double covers. 4682-4689 - David Cariolaro, Hung-Lin Fu:
Excessive near 1-factorizations. 4690-4696 - Vladimir D. Tonchev:
Generalized weighing matrices and self-orthogonal codes. 4697-4699 - Darryn E. Bryant:
Completing partial commutative quasigroups constructed from partial Steiner triple systems is NP-complete. 4700-4704 - Liqun Pu, Hung-Lin Fu, Hao Shen:
Directed 3-cycle decompositions of complete directed graphs with quadratic leaves. 4705-4715 - Jeffrey H. Dinitz, Alan C. H. Ling, Peter Danziger:
Maximum uniformly resolvable designs with block sizes 2 and 4. 4716-4721 - Marco Buratti, Gloria Rinaldi:
A non-existence result on cyclic cycle-decompositions of the cocktail party graph. 4722-4726 - Saad I. El-Zanati, G. F. Seelinger, Papa Amar Sissokho, L. E. Spence, Charles Vanden Eynden:
On partitions of finite vector spaces of low dimension over GF(2). 4727-4735 - David Cariolaro, Anthony J. W. Hilton:
An application of Tutte's Theorem to 1-factorization of regular graphs of high degree. 4736-4745 - Peter D. Johnson Jr.:
The fractional chromatic number, the Hall ratio, and the lexicographic product. 4746-4749 - Peter Borg:
A short proof of a cross-intersection theorem of Hilton. 4750-4753 - Peter Borg, Fred C. Holroyd:
The Erdos-Ko-Rado properties of set systems defined by double partitions. 4754-4761 - Alexandr V. Kostochka, Gexin Yu:
Ore-type conditions implying 2-factors consisting of short cycles. 4762-4771 - Frank E. Bennett, Nicole Zwicker, Yanxun Chang:
Existence of r-fold perfect (v, K, 1)-Mendelsohn designs with K SUBSET OF OR EQUAL TO {4, 5, 6, 7}. 4772-4783 - Michael D. Plummer, Xiaoya Zha:
On certain spanning subgraphs of embeddings with applications to domination. 4784-4792 - Herbert Fleischner, Arthur M. Hobbs, Michael Tapfuma Muzheve:
Hamiltonicity in vertex envelopes of plane cubic graphs. 4793-4809 - Mike J. Grannell, Terry S. Griggs, Kathleen A. S. Quinn:
Smallest defining sets of directed triple systems. 4810-4818 - Zhi-Hong Chen, Hong-Jian Lai, Liming Xiong, Huiya Yan, Mingquan Zhan:
Hamilton-connected indices of graphs. 4819-4827 - Elizabeth J. Billington, Charles Curtis Lindner:
Embedding 5-cycle systems into pentagon triple systems. 4828-4834 - Peter J. Cameron:
A generalisation of t-designs. 4835-4842 - Shuchao Li, Xuechao Li:
Edge coloring of graphs with small maximum degrees. 4843-4852 - Ron Aharoni, Erol Hallufgil:
Coloring by two-way independent sets. 4853-4860 - Peter Danziger, Salvatore Milici, Gaetano Quattrocchi:
Minimum embedding of a P4-design into a balanced incomplete block design of index lambda. 4861-4870 - Hung-Lin Fu, Yuan-Hsun Lo:
Multicolored parallelisms of Hamiltonian cycles. 4871-4876 - M. A. Ollis, Ambrose D. Sterr:
From graceful labellings of paths to cyclic solutions of the Oberwolfach problem. 4877-4882 - Sibel Özkan, C. A. Rodger:
Hamilton decompositions of graphs with primitive complements. 4883-4888
Volume 309, Number 15, August 2009
- Mirko Hornák, Stanislav Jendrol':
Preface. 4889 - Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, I: General results. 4890-4902 - Sylwia Cichacz, Jakub Przybylo, Mariusz Wozniak:
Decompositions of pseudographs into closed trails of even sizes. 4903-4908 - Dafik, Mirka Miller, Joe Ryan, Martin Baca:
On super (a, d)-edge-antimagic total labeling of disconnected graphs. 4909-4915 - Stephan Matos Camacho, Ingo Schiermeyer:
Colourings of graphs with two consecutive odd cycle lengths. 4916-4919 - Diego Scheide, Michael Stiebitz:
On Vizing's bound for the chromatic index of a multigraph. 4920-4925 - Margit Voigt:
Precoloring extension for 2-connected graphs with maximum degree three. 4926-4930 - Michael Stiebitz, Zsolt Tuza, Margit Voigt:
On list critical graphs. 4931-4941 - Frantisek Kardos, Jozef Miskuf:
Maximum vertex and face degree of oblique graphs. 4942-4948 - Jochen Harant, Stefan Senitsch:
A generalization of Tutte's theorem on Hamiltonian cycles in planar graphs. 4949-4951 - Enrique García Moreno Esteva, Tommy R. Jensen:
A note on semiextensions of stable circuits. 4952-4954 - Tomasz Dzido, Robert Fidytek:
On some three color Ramsey numbers for paths and cycles. 4955-4958
Volume 309, Number 16, August 2009
- William J. Keith:
Distribution of the full rank in residue classes for odd moduli. 4960-4968 - M. Josune Albizuri, José Manuel Zarzuelo:
Conference structures and consistency. 4969-4976 - Christian Huck:
On the existence of U-polygons of class c>=4 in planar point sets. 4977-4981 - José Antonio de la Peña, N. Tello:
The iterated Prisoner's Dilemma in societies of deterministic players. 4982-4991 - Klaus Altmann, Benjamin Nill, Sabine Schwentner, Izolda Wiercinska:
Flow polytopes and the graph of reflexive polytopes. 4992-4999 - Akira Saito, Liming Xiong:
Closure, stability and iterated line graphs with a 2-factor. 5000-5010 - Josep Rifà, Victor A. Zinoviev:
On a class of binary linear completely transitive codes with arbitrary covering radius. 5011-5016 - Hong Bian, Fuji Zhang:
The graph of perfect matching polytope and an extreme problem. 5017-5023 - Leonidas S. Pitsoulis, Konstantinos Papalamprou, Gautam Appa, Balázs Kotnyek:
On the representability of totally unimodular matrices on bidirected graphs. 5024-5042 - Jason I. Brown, Danielle Cox:
The closure of the set of roots of strongly connected reliability polynomials is the entire complex plane. 5043-5047 - Adnen Sboui:
Special numbers of rational points on hypersurfaces in the n-dimensional projective space over a finite field. 5048-5059 - Aicke Hinrichs, Christian Richter:
Saturated packings and reduced coverings obtained by perturbing tilings. 5060-5068 - Stepan Holub:
Polynomial-time algorithm for fixed points of nontrivial morphisms. 5069-5076 - James McLaughlin, Andrew V. Sills, Peter Zimmer:
Lifting Bailey pairs to WP-Bailey pairs. 5077-5091 - Nantel Bergeron, François Descouens, Mike Zabrocki:
A non-commutative generalization of k-Schur functions. 5092-5105 - Erik E. Westlund, Jiuqiang Liu, Donald L. Kreher:
6-regular Cayley graphs on abelian groups of odd order are hamiltonian decomposable. 5106-5110 - Haitao Cao, F. Yan:
Super-simple group divisible designs with block size 4 and index 5. 5111-5119 - Konstantinos Georgiou, Evangelos Kranakis, Danny Krizanc:
Random maximal independent sets and the unfriendly theater seating arrangement problem. 5120-5129 - Simon R. Blackburn, Stefanie Gerke:
Connectivity of the uniform random intersection graph. 5130-5140 - András Csernenszky, C. Ivett Mándity, András Pluhár:
On Chooser-Picker positional games. 5141-5146 - Jean-Luc Baril, Olivier Togni:
Neighbor-distinguishing k-tuple edge-colorings of graphs. 5147-5157 - Horst Martini, Margarita Spirova:
On regular 4-coverings and their application for lattice coverings in normed planes. 5158-5168 - Christine T. Cheng:
On computing the distinguishing and distinguishing chromatic numbers of interval graphs and other results. 5169-5182 - Shenglin Zhou, Huili Dong, Weidong Fang:
Finite classical groups and flag-transitive triplanes. 5183-5195 - Maria Monks:
Endomorphisms of the shift dynamical system, discrete derivatives, and applications. 5196-5205 - Adriano M. Garsia, Nolan Wallach, Guoce Xin, Mike Zabrocki:
Hilbert series of invariants, constant terms and Kostka-Foulkes polynomials. 5206-5230 - Klas Markström:
Extremal hypergraphs and bounds for the Turán density of the 4-uniform K5. 5231-5234 - Ajit A. Diwan, Namrata P. Tholiya:
Non-separating trees in connected graphs. 5235-5237 - Lingsheng Shi:
Bounds on Randic indices. 5238-5241 - Xiumei Wang, Jinjiang Yuan, Sujing Zhou:
Edge-deletable IM-extendable graphs with minimum number of edges. 5242-5247 - Ralf Goertz:
Coprime ordering of cyclic planar difference sets. 5248-5252 - György Elekes:
A note on a problem of Erdos on right angles. 5253-5254
Volume 309, Number 17, September 2009
- Brett Stevens, Glenn Hurlbert, Bradley Jackson:
Preface. 5255-5258 - Alfred W. Hales, Nora Hartsfield:
The directed genus of the de Bruijn graph. 5259-5263 - J. Robert Johnson:
Universal cycles for permutations. 5264-5270 - Ian Shields, Brendan J. Shields, Carla D. Savage:
An update on the middle levels problem. 5271-5277 - Zongliang Jiang, Carla D. Savage:
On the existence of symmetric chain decompositions in a quotient of the Boolean lattice. 5278-5283 - Stirling Chow, Frank Ruskey:
Gray codes for column-convex polyominoes and a new class of distributive lattices. 5284-5297 - Martín Matamala, Eduardo Moreno:
Minimum Eulerian circuits and minimum de Bruijn sequences. 5298-5304 - Frank Ruskey, Aaron Williams:
The coolest way to generate combinations. 5305-5320 - Glenn Hurlbert, Tobias Johnson, Joshua Zahl:
On universal cycles for multisets. 5321-5327 - Bradley W. Jackson, Joe Buhler, Ray Mayer:
A recursive construction for universal cycles of 2-subspaces. 5328-5331 - Karel Casteels, Brett Stevens:
Universal cycles of (n-1)-partitions of an n-set. 5332-5340 - Brad Jackson, Brett Stevens, Glenn Hurlbert:
Research problems on Gray codes and universal cycles. 5341-5348
- Ulrich Knauer, Roland H. Kaschek:
Preface. 5349-5351 - Martin A. Michels, Ulrich Knauer:
The congruence classes of paths and cycles. 5352-5359 - Andrei V. Kelarev, Joe Ryan, John Yearwood:
Cayley graphs as classifiers for data mining: The influence of asymmetries. 5360-5369 - Roland H. Kaschek:
On unretractive graphs. 5370-5380 - Ivy Chakrabarty, Shamik Ghosh, T. K. Mukherjee, Malay K. Sen:
Intersection graphs of ideals of rings. 5381-5392 - Sayan Panma, Ulrich Knauer, Sr. Arworn:
On transitive Cayley graphs of strong semilattices of right (left) groups. 5393-5403 - Sanming Zhou:
Classification of a family of symmetric graphs with complete 2-arc-transitive quotients. 5404-5410 - Suohai Fan:
Generalized symmetry of graphs - A survey. 5411-5419 - Jens Kötters:
Almost all graphs are rigid - revisited. 5420-5424
- Dragan Marusic:
Preface: Special issue of discrete mathematics on Hamiltonicity problem for vertex-transitive (Cayley) graphs. 5425 - Yong Qin, Wenjun Xiao, Stefko Miklavic:
Connected graphs as subgraphs of Cayley graphs: Conditions on Hamiltonicity. 5426-5431 - Tomaz Pisanski, Janez Zerovnik:
Hamilton cycles in graph bundles over a cycle with tree as a fibre. 5432-5436 - Stefko Miklavic, Primoz Sparl:
On Hamiltonicity of circulant digraphs of outdegree three. 5437-5443 - Klavdija Kutnar, Primoz Sparl:
Hamilton paths and cycles in vertex-transitive graphs of order 6p. 5444-5460 - Brian Alspach, Jiping Liu:
On the Hamilton connectivity of generalized Petersen graphs. 5461-5473 - Cheng-Kuan Lin, Jimmy J. M. Tan, Hua-Min Huang, D. Frank Hsu, Lih-Hsing Hsu:
Mutually independent hamiltonian cycles for the pancake graphs and the star graphs. 5474-5483 - Dave Witte Morris, Joy Morris, Kerri Webb:
Hamiltonian cycles in (2, 3, c)-circulant digraphs. 5484-5490 - Klavdija Kutnar, Dragan Marusic:
Hamilton cycles and paths in vertex-transitive graphs - Current directions. 5491-5500 - Igor Pak, Rados Radoicic:
Hamiltonian paths in Cayley graphs. 5501-5508
Volume 309, Number 18, September 2009
- Peter Horák, Ladislav Stacho:
Preface. 5509 - Jaroslav Nesetril:
A surprising permanence of old motivations (a not-so-rigid story). 5510-5526 - Otokar Grosek, Peter Horák, Pavol Zajac:
On complexity of round transformations. 5527-5534 - Anthony Bonato, Pawel Pralat:
The good, the bad, and the great: Homomorphisms and cores of random graphs. 5535-5539 - Richard C. Brewster, Timothy Graves:
Edge-switching homomorphisms of edge-coloured graphs. 5540-5546 - Andrzej Dudek, Esmeralda Nastase, Vojtech Rödl:
On k-chromatically connected graphs. 5547-5550 - Peter Horák:
On perfect Lee codes. 5551-5561 - Xuding Zhu:
Colouring graphs with bounded generalized colouring number. 5562-5568 - Srichan Arworn, Piotr Wojtylak:
An algorithm for the number of path homomorphisms. 5569-5573 - Jean-Claude Bermond, Ricardo C. Corrêa, Min-Li Yu:
Optimal gathering protocols on paths under interference constraints. 5574-5587 - Anthony Bonato, Petr A. Golovach, Gena Hahn, Jan Kratochvíl:
The capture time of a graph. 5588-5595 - Haitze J. Broersma, Jun Fujisawa, Bert Marchal, Daniël Paulusma, A. N. M. Salman, Kiyoshi Yoshimoto:
lambda-backbone colorings along pairwise disjoint stars and matchings. 5596-5609 - Jens Gramm, Tzvika Hartman, Till Nierhoff, Roded Sharan, Till Tantau:
On the complexity of SNP block partitioning under the perfect phylogeny model. 5610-5617 - Min Chih Lin, Jayme Luiz Szwarcfiter:
Characterizations and recognition of circular-arc graphs and subclasses: A survey. 5618-5635 - Borut Luzar, Riste Skrekovski, Martin Tancer:
Injective colorings of planar graphs with few colors. 5636-5649 - Mariusz Meszka, Alexander Rosa, Irmina A. Ziolo:
Steiner almost self-complementary graphs and halving near-Steiner triple systems. 5650-5654 - Jørgen Bang-Jensen:
Problems and conjectures concerning connectivity, paths, trees and cycles in tournament-like digraphs. 5655-5667 - Mitre Costa Dourado, John G. Gimbel, Jan Kratochvíl, Fábio Protti, Jayme Luiz Szwarcfiter:
On the computation of the hull number of a graph. 5668-5674 - Selda Küçükçifçi, Curt Lindner, Gaetano Quattrocchi:
Embeddings of P3-designs into bowtie and almost bowtie systems. 5675-5677 - André Raspaud, Weifan Wang:
Linear coloring of planar graphs with large girth. 5678-5686 - Javier Barajas, Oriol Serra:
On the chromatic number of circulant graphs. 5687-5696 - David Morgan:
A dynamic distributed approach to representing proper interval graphs. 5697-5702 - Pavol Hell, David G. Kirkpatrick:
Linear-time certifying algorithms for near-graphical sequences. 5703-5713 - Yi Sun, Fei Ma, Tsunehiko Kameda:
Generating asymptotically optimal broadcasting schedules to minimize average waiting time. 5714-5723 - Herbert Fleischner, Roland Häggkvist:
Circuit double covers in special types of cubic graphs. 5724-5728 - Gary MacGillivray, Mark H. Siggers:
On the complexity of H-colouring planar graphs. 5729-5738 - Luisa Gargano, Mikael Hammar:
A note on submodular set cover on matroids. 5739-5744 - Daniel Král, Pavel Nejedlý:
Distance constrained labelings of K4-minor free graphs. 5745-5756 - Richard C. Brewster, Gary MacGillivray, Laura Shepherd:
The circular chromatic number of hypergraphs. 5757-5765 - Kathie Cameron:
Brambles and independent packings in chordal graphs. 5766-5769 - Boting Yang, Danny Dyer, Brian Alspach:
Sweeping graphs with large clique number. 5770-5780 - Peter Adams, Hayri Ardal, Ján Manuch, Vu Dinh Hoa, Moshe Rosenfeld, Ladislav Stacho:
Spanning cubic graph designs. 5781-5788 - Reza Naserasr, Yared Nigussie, Riste Skrekovski:
Homomorphisms of triangle-free graphs without a K5-minor. 5789-5798 - Stephan Dominique Andres:
Asymmetric directed graph coloring games. 5799-5802
Volume 309, Number 19, October 2009
- Teresa W. Haynes, Michael A. Henning, Ping Zhang:
A dedication to Professor Gary Chartrand. 5803-5805 - Teresa W. Haynes, Michael A. Henning, Ping Zhang:
A survey of stratified domination in graphs. 5806-5819 - Paul J. P. Grobler, Christina M. Mynhardt:
Secure domination critical graphs. 5820-5827 - José Cáceres, Ortrud R. Oellermann:
On 3-Steiner simplicial orderings. 5828-5833 - Mike Ferrara, Jesse Gilbert, Mike Jacobson, Thor Whalen:
Irregularity strength of digraphs. 5834-5840 - Heather Jordon, Richard McBride, Shailesh K. Tipnis:
The convex hull of degree sequences of signed graphs. 5841-5848 - Tínaz Ekim, John Gimbel:
Partitioning graphs into complete and empty graphs. 5849-5856 - David L. Craft, Arthur T. White:
3-maps. 5857-5869 - Ralph J. Faudree, Michael Ferrara, Ronald J. Gould, Michael S. Jacobson:
tKp-saturated graphs of minimum size. 5870-5876 - Peter Dankelmann, David P. Day, David Erwin, Simon Mukwembi, Henda C. Swart:
Domination with exponential decay. 5877-5883 - Miranda L. Roden, Peter J. Slater:
Liar's domination in graphs. 5884-5890 - Ralph J. Faudree, Linda M. Lesniak, Ingo Schiermeyer:
On the circumference of a graph and its complement. 5891-5893 - Ronald D. Dutton, Robert C. Brigham:
On global domination critical graphs. 5894-5897
Volume 309, Number 20, October 2009
- Zdenek Dvorák, Bernard Lidický, Riste Skrekovski:
Planar graphs without 3-, 7-, and 8-cycles are 3-choosable. 5899-5904 - Miguel Couceiro, Erkko Lehtonen:
Generalizations of Swierczkowski's lemma and the arity gap of finite functions. 5905-5912 - Victor J. W. Guo, Ying-Jie Lin, Yan Liu, Cai Zhang:
A q-analogue of Zhang's binomial coefficient identities. 5913-5919 - Jian Liu, Jiuqiang Liu:
Set systems with cross L-intersection and k-wise L-intersecting families. 5920-5925 - Yanxun Chang:
Transitive resolvable idempotent quasigroups and large sets of resolvable Mendelsohn triple systems. 5926-5931 - Tatjana Gerzen:
Edge search in graphs with restricted test sets. 5932-5942 - Yanfeng Luo, Xing Gao:
On the extendability of Bi-Cayley graphs of finite abelian groups. 5943-5949 - Sarada Herke, Christina M. Mynhardt:
Radial trees. 5950-5962 - Mykhaylo Tyomkyn:
A proof of the rooted tree alternative conjecture. 5963-5967 - Fabien Vignes-Tourneret:
The multivariate signed Bollobás-Riordan polynomial. 5968-5981 - Zhibin Chen, Wenan Zang:
Odd-K4's in stability critical graphs. 5982-5985 - Ian D. Gray, Jim A. MacDougall:
Vertex-magic labelings of regular graphs II. 5986-5999 - Omid Amini, Frédéric Mazoit, Nicolas Nisse, Stéphan Thomassé:
Submodular partition functions. 6000-6008 - Dianhua Wu, Pingzhi Fan:
Constructions of optimal quaternary constant weight codes via group divisible designs. 6009-6013 - Jing Jian Li, Zai Ping Lu:
Cubic s-arc transitive Cayley graphs. 6014-6025 - Geng-sheng Zhang, Yu-qin Yang, Xiang-hui Zhao:
A construction of dz-disjunct matrices by orthogonal space and discussion on their design parameters. 6026-6034 - Bin Liu, Jianfeng Hou, Jianliang Wu, Guizhen Liu:
Total colorings and list total colorings of planar graphs without intersecting 4-cycles. 6035-6043 - Albert Guan, Xuding Zhu:
Adaptable choosability of planar graphs with sparse short cycles. 6044-6047 - Gohar Ali, Martin Baca, Yuqing Lin, Andrea Semanicová-Fenovcíková:
Super-vertex-antimagic total labelings of disconnected graphs. 6048-6054 - Andrzej Zak:
Harmonious order of graphs. 6055-6064 - Andreas Holtkamp, Lutz Volkmann:
On the connectivity of p-diamond-free graphs. 6065-6069 - Christine Bessenrodt, Guo-Niu Han:
Symmetry distribution between hook length and part length for partitions. 6070-6073 - Michael Ferrara, Christine Lee, Phil Wallis, Ellen Gethner:
deBruijn-like sequences and the irregular chromatic number of paths and cycles. 6074-6080 - Jin-Xin Zhou:
Tetravalent s-transitive graphs of order 4p. 6081-6086 - Haihui Zhang, Baogang Xu:
Acyclic 5-choosability of planar graphs with neither 4-cycles nor chordal 6-cycles. 6087-6091 - Florian Roussel, Irena Rusu, Henri Thuillier:
The Strong Perfect Graph Conjecture: 40 years of attempts, and its resolution. 6092-6113 - Bostjan Bresar, Manoj Changat, Joseph Mathews, Iztok Peterin, Prasanth G. Narasimha-Shenoi, Aleksandra Tepeh Horvat:
Steiner intervals, geodesic intervals, and betweenness. 6114-6125 - Eiichi Bannai, Osamu Shimabukuro, Hajime Tanaka:
Finite Euclidean graphs and Ramanujan graphs. 6126-6134 - Sherry H. F. Yan, Xuezi Liu:
2-noncrossing trees and 5-ary trees. 6135-6138 - Jean-Marc Schlenker:
On weakly convex star-shaped polyhedra. 6139-6145 - Aung Kyaw:
Spanning trees with at most 3 leaves in K1, 4-free graphs. 6146-6148 - J. P. Grossman, Gregory Minton:
Inversions in ranking data. 6149-6151
Volume 309, Number 21, November 2009
- Pavol Hell, Zhishi Pan, Tsai-Lien Wong, Xuding Zhu:
Adaptable chromatic number of graph products. 6153-6159 - Suresh Manjanath Hegde, Sudhakar Shetty:
Strongly indexable graphs and applications. 6160-6168 - Olof Heden:
On the length of the tail of a vector space partition. 6169-6180 - Michael A. Henning, John McCoy:
Total domination in planar graphs of diameter two. 6181-6189 - Oliver Cooley:
Proof of the Loebl-Komlós-Sós conjecture for large, dense graphs. 6190-6228 - Toru Araki:
Connected k-tuple twin domination in de Bruijn and Kautz digraphs. 6229-6234 - William Y. C. Chen, Henry Y. Gao, Jia He:
Labeled partitions with colored permutations. 6235-6244 - Mathieu Guay-Paquet, Jeffrey O. Shallit:
Avoiding squares and overlaps over the natural numbers. 6245-6254 - Xuelian Wen, Zihui Yang:
Minimum degree of minimal defect n-extendable bipartite graphs. 6255-6264 - Yoshimi Egawa, Keiko Kotani:
4-factors in 2-connected star-free graphs. 6265-6270 - Jian-Hua Yin:
Conditions for r-graphic sequences to be potentially K(r)m+1-graphic. 6271-6276 - Henry Liu, Yury Person:
Highly connected coloured subgraphs via the regularity lemma. 6277-6287 - Min Tang:
On a generalization of a theorem of Erdos and Fuchs. 6288-6293 - Min Tang, Yong-Gao Chen:
Some extensions of a property of linear representation functions. 6294-6298 - Ronald J. Gould:
A look at cycles containing specified elements of a graph. 6299-6311 - David A. Pike, Robert C. Vandell, Matthew Walsh:
Hamiltonicity and restricted block-intersection graphs of t-designs. 6312-6315 - Marcin Anholcer, Maciej Kalkowski, Jakub Przybylo:
A new upper bound for the total vertex irregularity strength of graphs. 6316-6317 - Mei Lu, Huiqing Liu, Feng Tian:
An improved upper bound for the Laplacian spectral radius of graphs. 6318-6321 - Xueliang Li, Jianxi Liu:
Complete solution to a conjecture on the Randic index of triangle-free graphs. 6322-6324 - Gab-Byung Chae:
Corrigendum to counting labeled claw-free cubic graphs by connectivity. 6325
Volume 309, Number 22, November 2009
- Mariusz Meszka:
Preface. 6327 - Rafal Kalinowski, Monika Pilsniak, Mariusz Wozniak, Irmina A. Ziolo:
On-line arbitrarily vertex decomposable suns. 6328-6336 - Roman Cada, Evelyne Flandrin, Hao Li:
Hamiltonicity and pancyclicity of cartesian products of graphs. 6337-6343 - Ervin Györi, Cory Palmer:
A new type of edge-derived vertex coloring. 6344-6352 - Kenjiro Ogawa, Satoshi Tagusari, Morimasa Tsuchiya:
On double bound graphs and forbidden subposets. 6353-6358 - Kiyoshi Ando:
Subgraph induced by the set of degree 5 vertices in a contraction critically 5-connected graph. 6359-6367 - Zbigniew Lonc, Monika Pszczola:
Edge decompositions into two kinds of graphs. 6368-6374 - Joanna Polcyn, Andrzej Rucinski:
Short paths in epsilon-regular pairs and small diameter decompositions of dense graphs. 6375-6381 - Zdzislaw Skupien:
Sparse hamiltonian 2-decompositions together with exact count of numerous Hamilton cycles. 6382-6390 - Csilla Bujtás, Zsolt Tuza:
Color-bounded hypergraphs, II: Interval hypergraphs and hypertrees. 6391-6401 - Méziane Aïder, Sylvain Gravier, Kahina Meslem:
Isometric embeddings of subdivided connected graphs into hypercubes. 6402-6407 - Tiziana Calamoneri, Annalisa Massini, L'ubomír Török, Imrich Vrto:
Antibandwidth of complete k-ary trees. 6408-6414 - Susan A. van Aardt, Frank Bullock, Joanna Górska, Zdzislaw Skupien:
On detour homogeneous digraphs. 6415-6424 - Jean-Luc Fouquet, Henri Thuillier, Jean-Marie Vanherpe, A. Pawel Wojda:
On isomorphic linear partitions in cubic graphs. 6425-6433 - Marcin Anholcer:
Product irregularity strength of graphs. 6434-6439 - Charles J. Colbourn, Gennian Ge, Alan C. H. Ling:
Graph designs for the eight-edge five-vertex graphs. 6440-6445 - Halina Bielak:
Size Ramsey numbers for some regular graphs. 6446-6449
Volume 309, Numbers 23-24, December 2009
- Michael A. Henning, Christian Löwenstein, Dieter Rautenbach:
Remarks about disjoint dominating sets. 6451-6458 - Z. Chen, Dianhua Wu, Pingzhi Fan:
Applications of additive sequence of permutations. 6459-6463 - Boram Park, Suh-Ryung Kim, Yoshio Sano:
The competition numbers of complete multipartite graphs and mutually orthogonal Latin squares. 6464-6469 - Zhaoping Meng, Lijun Ji, Beiliang Du:
Uniformly resolvable three-wise balanced designs with block sizes four and six. 6470-6482 - Jun Fujisawa:
Weighted degrees and heavy cycles in weighted graphs. 6483-6495 - Oleg V. Borodin, Anna O. Ivanova:
2-distance (Delta+2)-coloring of planar graphs with girth six and Delta>=18. 6496-6502 - Tomoki Yamashita:
A degree sum condition with connectivity for relative length of longest paths and cycles. 6503-6507 - Michael W. Hero, Jeb F. Willenbring:
Stable Hilbert series as related to the measurement of quantum entanglement. 6508-6514 - Yuanyuan Liu, Qingde Kang:
Large sets of extended directed triple systems with even orders. 6515-6529 - Shu-Guang Guo:
Restricted sumsets in a finite abelian group. 6530-6534 - Philippe Jégou, Samba Ndojh Ndiaye:
On the notion of cycles in hypergraphs. 6535-6543 - Long Yu:
Blocking numbers and fixing numbers of convex bodies. 6544-6554 - Shiying Wang, Ruixia Wang:
The structure of strong arc-locally in-semicomplete digraphs. 6555-6562 - Simon Rénier:
Characterization, parity, and power sequences of locally finite doubly stochastic matrices. 6563-6571 - Alexandr V. Kostochka, Lale Özkahya, Douglas R. Woodall:
A Brooks-type bound for squares of K4-minor-free graphs. 6572-6584 - Sandi Klavzar, Matjaz Kovse:
Induced cycles in crossing graphs of median graphs. 6585-6589 - Ju-Mok Oh:
Arc-transitive elementary abelian covers of the Pappus graph. 6590-6611 - Elmar Teufl, Stephan G. Wagner:
Exact and asymptotic enumeration of perfect matchings in self-similar graphs. 6612-6625 - Robert Brignall, Shalosh B. Ekhad, Rebecca Smith, Vincent Vatter:
Almost avoiding permutations. 6626-6631 - Agelos Georgakopoulos:
A short proof of Fleischner's theorem. 6632-6634 - David J. Galvin:
An upper bound for the number of independent sets in regular graphs. 6635-6640 - M. A. Makarov:
On an infinite permutation similar to the Thue-Morse word. 6641-6643 - Hiu-Fai Law:
Spanning tree congestion of the hypercube. 6644-6648
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-10-22 02:18 CEST 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:
