default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 308
Volume 308, Number 1, January 2008
- Svetoslav Savchev, Fang Chen:
Long n-zero-free sequences in finite cyclic groups. 1-8 - Béla Bollobás, Vladimir Nikiforov:
Joints in graphs. 9-19 - Raffaele Mosca:
Stable sets of maximum weight in (P7, banner)-free graphs. 20-33 - Kim A. S. Factor, Larry J. Langley:
Characterization of digraphs with equal domination graphs and underlying graphs. 34-43 - Joanna Raczek
, Joanna Cyman:
Total restrained domination numbers of trees. 44-50 - Sheng-Liang Yang:
Some identities involving the binomial sequences. 51-58 - Michael Pinsker:
Monoidal intervals of clones on infinite sets. 59-70 - Zhi-Hong Sun:
Congruences involving Bernoulli polynomials. 71-112 - Pei Wang, Xuezheng Lv:
The codiameter of a 2-connected graph. 113-122 - Edy Tri Baskoro, Yus Mochamad Cholily, Mirka Miller:
Enumerations of vertex orders of almost Moore digraphs with selfrepeats. 123-128 - Vladimir Gurvich:
On cyclically orientable graphs. 129-135 - Yufa Shen, Wenjie He, Guoping Zheng, Yanning Wang, Lingmin Zhang:
On choosability of some complete multipartite graphs and Ohba's conjecture. 136-143 - Mohammad Ghebleh, Mahdad Khatirinejad:
Planarity of iterated line graphs. 144-147 - Taíse Santiago Costa Oliveira:
"Catalan traffic" and integrals on the Grassmannian of lines. 148-152
Volume 308, Numbers 2-3, February 2008
- Mario Gionfriddo, Curt Lindner, Guglielmo Lunardon, Alexander Rosa:
Preface. 153 - Mario Gionfriddo, Gaetano Quattrocchi:
Embedding balanced P3-designs into (balanced) P4-designs. 155-160 - Preben D. Vestergaard:
A short update on equipackable graphs. 161-165 - Reinhard Laue, Alfred Wassermann:
Simple 8-(31, 12, 3080), 8-(40, 12, 16200) and 8-(40, 12, 16520) designs from PSL(3, 5) and PSL(4, 3). 166-174 - Giuseppe Mazzuoccolo:
Primitive 2-factorizations of the complete graph. 175-179 - Sandro Rajola, Maria Scafati Tallini:
The size of m-irreducible blocking sets and of the sets of class [0, n1, ..., nl]. 180-183 - Vito Abatangelo, Bambina Larato:
Complete caps in PG(3, q) with q odd. 184-187 - Rita Procesi, Rosaria Rota:
Complementary multiplicative hyperrings. 188-191 - Ian Anderson, Donald A. Preece:
Some da capo directed power-sequence Zn+1 terraces with n an odd prime power. 192-206 - Alexander Kreuzer, Kay Sörensen:
Spaces with congruence. 207-213 - Charles Curtis Lindner, Alexander Rosa:
Perfect dexagon triple systems. 214-219 - Helmut Karzel, Mario Marchi:
Introduction of measures for segments and angles in a general absolute plane. 220-230 - Lucia Gionfriddo:
Hexagon quadrangle systems. 231-241 - Emanuele Munarini, Claudio Perelli Cippo, Andrea Scagliola, Norma Zagaglia Salvi:
Double graphs. 242-254 - Sveva Freni:
An equivalence relation in finite planar spaces. 255-266 - Irene Sciriha, Patrick W. Fowler:
On nut and core singular fullerenes. 267-276 - Vojislav Petrovic, Miroslav Treml:
3-Kings in 3-partite tournaments. 277-286 - Giuseppa Carrá Ferro, Daniela Ferrarello:
Ideals and graphs, Gröbner bases and decision procedures in graphs. 287-298 - Eva Ferrara Dentice, Giuseppe Marino:
Classification of Veronesean caps. 299-302 - Elizabeth J. Billington, Christopher A. Rodger:
Resolvable 4-cycle group divisible designs with two associate classes: Part size even. 303-307 - Alberto Cavicchioli, Fulvia Spaggiari:
Graphs encoding 3-manifolds of genus 2. 308-318 - Sergei L. Bezrukov, Dalibor Froncek, Steven J. Rosenberg, Petr Kovár:
On biclique coverings. 319-323 - Slobodan K. Simic, Enzo Maria Li Marzi, Francesco Belardo:
On the index of caterpillars. 324-330 - Salvatore Milici:
Minimum embedding of P3-designs into TS(v, lambda). 331-338 - Leo Storme:
Weighted {delta(q+1), delta;k-1, q}-minihypers. 339-354 - Zoran Radosavljevic, Bojana Mihailovic, Marija Rasajski:
Decomposition of Smith graphs in maximal reflexive cacti. 355-366 - Peter Dukes, Charles J. Colbourn, Violet R. Syrotiuk:
Directed complete bipartite graph decompositions: Indirect constructions. 367-374 - Deirdre Luyckx:
On maximal partial spreads of H(2n+1, q2). 375-379 - Simona Bonvicini:
Frattini-based starters in 2-groups. 380-381 - Selda Küçükçifçi:
The intersection problem for PBD(5*, 3)s. 382-385 - Peter J. Cameron, Daniele A. Gewurz, Francesca Merola:
Product action. 386-394 - Jan Degraer, Kris Coolsaet:
Classification of some strongly regular subgraphs of the McLaughlin graph. 395-400 - Hans-Joachim Kroll, Rita Vincenti:
Antiblocking systems and PD-sets. 401-407 - Hans-Joachim Kroll, Rita Vincenti:
PD-sets for binary RM-codes and the codes related to the Klein quadric and to the Schubert variety of PG(5, 2). 408-414 - Helmut Karzel, Silvia Pianta:
Binary operations derived from symmetric permutation sets and applications to absolute geometry. 415-421 - Florica Kramer, Horst Kramer:
A survey on the distance-colouring of graphs. 422-426 - Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
Tight blocking sets in some maximum packings of lambdaKn. 427-438 - Yanxun Chang, Giovanni Lo Faro, Antoinette Tripodi:
Determining the spectrum of Meta(K4+e>K4, lambda) for any lambda. 439-456 - Meinard Müller, Masakazu Jimbo:
Cyclic sequences of k-subsets with distinct consecutive unions. 457-464 - Terry S. Griggs, Giovanni Lo Faro, Gaetano Quattrocchi:
On some colouring of 4-cycle systems with specified block colour patterns. 465-478
Volume 308, Number 4, February 2008
- Raimundas Vidunas:
Askey-Wilson relations and Leonard pairs. 479-495 - Frédéric Havet, Min-Li Yu:
(p, 1)-Total labelling of graphs. 496-513 - Christian M. Reidys:
Combinatorics of sequential dynamical systems. 514-528 - Markus Kuba, Alois Panholzer:
On edge-weighted recursive trees and inversions in random permutations. 529-540 - Wenchang Chu, Chuanan Wei:
Legendre inversions and balanced hypergeometric series identities. 541-549 - Sheng-Liang Yang:
An identity of symmetry for the Bernoulli polynomials. 550-554 - Hye Kyung Kim, Jaeun Lee:
A generalized characteristic polynomial of a graph having a semifree action. 555-564 - Rumen N. Daskalov:
On the maximum size of some (k, r)-arcs in PG(2, q). 565-570 - Jia Huang, Jun-Ming Xu:
The bondage numbers and efficient dominations of vertex-transitive graphs. 571-582 - Koko Kalambay Kayibi:
A decomposition theorem for the linking polynomial of two matroids. 583-596 - Kiyoshi Ando, Atsushi Kaneko, Ken-ichi Kawarabayashi:
Contractible edges in minimally k-connected graphs. 597-602 - Arash Behzad, Mehdi Behzad, Cheryl E. Praeger:
On the domination number of the generalized Petersen graphs. 603-610 - Hatem M. Bahig:
On a generalization of addition chains: Addition-multiplication chains. 611-616
Volume 308, Numbers 5-6, March 2008
- Keith Edwards:
Preface. 619 - Ian Anderson, Donald A. Preece:
A general approach to constructing power-sequence terraces for Zn. 631-644 - Anthony J. W. Hilton:
(r, r+1)-factorizations of (d, d+1)-graphs. 645-669 - Peter Dankelmann, Henda C. Swart, Paul van den Berg:
Diameter and inverse degree. 670-673 - Robin W. Whitty:
Rook polynomials on two-dimensional surfaces and graceful labellings of graphs. 674-683 - Ian Anderson, Leigh H. M. Ellison:
Further results on logarithmic terraces. 684-695 - Elizabeth J. Billington, Dean G. Hoffman:
Equipartite and almost-equipartite gregarious 4-cycle systems. 696-714 - Zoran Radosavljevic, Bojana Mihailovic, Marija Rasajski:
On bicyclic reflexive graphs. 715-725 - Arrigo Bonisoli, Simona Bonvicini:
Primitive one-factorizations and the geometry of mixed translations. 726-733 - Henning Fernau, Joseph F. Ryan, Kiki A. Sugeng:
A sum labelling for the generalised friendship graph. 734-740 - Nicholas J. Cavenagh, Diane M. Donovan, Emine Sule Yazici:
Minimal homogeneous Steiner 2-(v, 3) trades. 741-752 - Selda Küçükçifçi, Güven Yücetürk:
Maximum packing for perfect four-triple configurations. 753-762 - Nicolas Lichiardopol:
Cycles in a tournament with pairwise zero, one or two given vertices in common. 763-771 - Charles J. Colbourn:
Strength two covering arrays: Existence tables and projection. 772-786 - Gil Kaplan, Arieh Lev, Yehuda Roditty:
Bertrand's postulate, the prime number theorem and product anti-magic graphs. 787-794 - Janka Rudasová, Roman Soták:
Vertex-distinguishing proper edge colourings of some regular graphs. 795-802 - Douglas R. Woodall:
The average degree of an edge-chromatic critical graph. 803-819 - Melita Gorse Pihler, Janez Zerovnik:
Partial cubes are distance graphs. 820-826 - Ervin Györi, Mirko Hornák, Cory Palmer, Mariusz Wozniak:
General neighbour-distinguishing index of a graph. 827-831 - Tatsuya Maruta, Maori Shinohara, Mito Takenaka:
Constructing linear codes from some orbits of projectivities. 832-841 - Mito Takenaka, Kei Okamoto, Tatsuya Maruta:
On optimal non-projective ternary linear codes. 842-854 - Christina M. Mynhardt:
Trees with depression three. 855-864 - Méziane Aïder:
Bipartite almost distance-hereditary graphs. 865-871 - Ron Shaw:
The polynomial degrees of Grassmann and Segre varieties over GF(2). 872-879 - Andrei Gagarin, Vadim E. Zverovich:
A generalised upper bound for the k-tuple domination number. 880-885 - Qingde Kang, Hongtao Zhao:
More large sets of resolvable MTS and resolvable DTS with odd orders. 886-895 - Graham A. Case, David A. Pike:
Pancyclic PBD block-intersection graphs. 896-900 - C. A. Baker, Anthony Bonato, Julia M. Nowlin Brown, Tamás Szonyi:
Graphs with the n-e.c. adjacency property constructed from affine planes. 901-912 - Luis Cereceda, Jan van den Heuvel, Matthew Johnson:
Connectedness of the graph of vertex-colourings. 913-919 - Peter J. Cameron, Bill Jackson, Jason D. Rudd:
Orbit-counting polynomials for graphs and codes. 920-930 - Giuseppe Mazzuoccolo:
On 2-factorizations whose automorphism group acts doubly transitively on the factors. 931-939 - Jini Williams, Fred C. Holroyd:
Semi-total graph colourings, the beta parameter, and total chromatic number. 940-954 - Shin-ichi Iwai, Kenjiro Ogawa, Morimasa Tsuchiya:
A note on chordal bound graphs and posets. 955-961 - Andrea C. Burgess, David A. Pike:
Colouring even cycle systems. 962-973 - Elena V. Konstantinova:
On reconstruction of signed permutations distorted by reversal errors. 974-984 - Jianliang Wu, Ping Wang:
Equitable coloring planar graphs with large girth. 985-990 - Abdón Sánchez-Arroyo:
The Erdos-Faber-Lovász conjecture for dense hypergraphs. 991-992 - Vladimir I. Levenshtein:
A conjecture on the reconstruction of graphs from metric balls of their vertices. 993-998
Volume 308, Number 7, April 2008
- Marcel Wild:
Weakly submodular rank functions, supermatroids, and the flat lattice of a distributive supermatroid. 999-1017 - Alice Hubenko:
On a cyclic connectivity property of directed graphs. 1018-1024 - C. C. Huang, S. S. Yu:
Prefix-primitivity-preserving homomorphisms. 1025-1032 - Ethan Berkove, Jenna Van Sickle, Ben Hummon, Joy Kogut:
An analysis of the (colored cudes)3 puzzle. 1033-1045 - Vladimir P. Korzhik:
Exponentially many nonisomorphic orientable triangular embeddings of K12s. 1046-1071 - Vladimir P. Korzhik, Jin Ho Kwak:
A new approach to constructing exponentially many nonisomorphic nonorientable triangular embeddings of complete graphs. 1072-1079 - Johannes H. Hattingh, Elizabeth Jonck, Ernst J. Joubert, Andrew R. Plummer:
Nordhaus-Gaddum results for restrained domination and total restrained domination in graphs. 1080-1087 - Chia-Fen Chang, Bor-Liang Chen, Hung-Lin Fu:
Near automorphisms of cycles. 1088-1092 - T. L. Alderson, Keith E. Mellinger:
Classes of optical orthogonal codes from arcs in root subspaces. 1093-1101 - R. Julian R. Abel, Esther R. Lamken, Jinhua Wang:
A few more Kirkman squares and doubly near resolvable BIBDs with block size 3. 1102-1123 - Justie Su-tzu Juan, Gerard J. Chang:
Adaptive group testing for consecutive positives. 1124-1129 - David Collins, Tamás Lengyel:
The game of 3-Euclid. 1130-1136 - Nolan McMurray, Talmage James Reid, Laura Sheppardson, Bing Wei, Haidong Wu:
On deletions of largest bonds in graphs. 1137-1141 - Mariusz Grech, Artur Jez, Andrzej Kisielewicz:
Graphical complexity of products of permutation groups. 1142-1152 - Daphne Der-Fen Liu:
Radio number for trees. 1153-1164 - Jean R. S. Blair, Wayne Goddard, Stephen T. Hedetniemi, Steven B. Horton, Patrick Jones, Grzegorz Kubicki:
On domination and reinforcement numbers in trees. 1165-1175 - Bostjan Bresar, Aleksandra Tepeh Horvat:
Crossing graphs of fiber-complemented graphs. 1176-1184 - Paolo Dulio, Virgilio Pannone:
Joining caterpillars and stability of the tree center. 1185-1190 - Michael Drmota, Thomas Stoll:
Newman's phenomenon for generalized Thue-Morse sequences. 1191-1208 - Nancy S. S. Gu, Nelson Y. Li, Toufik Mansour:
2-Binary trees: Bijections and related issues. 1209-1221 - Daniël Paulusma, Kiyoshi Yoshimoto:
Relative length of longest paths and longest cycles in triangle-free graphs. 1222-1229 - Mark S. MacLean, Paul M. Terwilliger:
The subconstituent algebra of a bipartite distance-regular graph; thin modules with endpoint two. 1230-1259 - Nawarat Ananchuen, Watcharaphong Ananchuen, Michael D. Plummer:
Matching properties in connected domination critical graphs. 1260-1267 - Mirko Hornák, Mariusz Wozniak:
On arbitrarily vertex decomposable trees. 1268-1281 - Toru Kojima:
Bandwidth of the strong product of two connected graphs. 1282-1295 - Yaojun Chen, T. C. Edwin Cheng, C. T. Ng:
Hamilton-connectivity of 3-domination critical graphs with alpha=delta+1 >= 5. 1296-1307 - Carlos M. da Fonseca, E. Marques De Sá:
Fibonacci numbers, alternating parity sequences and faces of the tridiagonal Birkhoff polytope. 1308-1318 - Vladimir P. Korzhik:
Minimal non-1-planar graphs. 1319-1327 - Young-Ming Chen:
The Chung-Feller theorem revisited. 1328-1329 - Cheng-Kuan Lin, Hua-Min Huang, Jimmy J. M. Tan, Lih-Hsing Hsu:
On spanning connected graphs. 1330-1333 - Xueliang Li, Jianhua Tu:
NP-completeness of 4-incidence colorability of semi-cubic graphs. 1334-1340