Google
Google Scholar
Semantic Scholar
MS Academic
CiteSeerX
ORCIDDiscrete Mathematics, Volume 256
Volume 256, Number 1-2, September 2002
- R. Julian R. Abel, Ahmed M. Assaf:
Modified group divisible designs with block size 5 and lambda=1. 1-22 - Noga Alon, József Balogh, Béla Bollobás, Tamás Szabó:
Game domination number. 23-33 - Curtis A. Barefoot:
Block-cutvertex trees and block-cutvertex partitions. 35-54 - Nicholas J. Cavenagh:
Further decompositions of complete tripartite graphs into 5-cycles. 55-81 - David Coulson:
A 15-colouring of 3-space omitting distance one. 83-90 - Ajit A. Diwan, Manish P. Kurhekar:
Plane triangulations are 6-partitionable. 91-103 - Igor Fabrici:
On vertex-degree restricted subgraphs in polyhedral graphs. 105-114 - Odile Favaron, Teresa W. Haynes, Stephen T. Hedetniemi, Michael A. Henning, Debra J. Knisley:
Total irredundance in graphs. 115-127 - Peter C. Fishburn, William T. Trotter:
Containment orders for similar ellipses with a common center. 129-136 - Alan M. Frieze
, Michael Krivelevich:
Hamilton cycles in random subgraphs of pseudo-random graphs. 137-150 - Ronald J. Gould, Florian Pfender:
Pancyclicity in claw-free graphs. 151-160 - Wolfgang Haas:
Binary and ternary codes of covering radius one: some new lower bounds. 161-178 - Gena Hahn, Jan Kratochvíl, Jozef Sirán, Dominique Sotteau:
On the injective chromatic number of graphs. 179-192 - Jochen Harant, Zdenek Ryjácek, Ingo Schiermeyer:
Forbidden subgraphs implying the MIN-algorithm gives a maximum independent set. 193-201 - Anthony J. W. Hilton, H. R. Hind:
Non-conformable subgraphs of non-conformable graphs. 203-224 - Matthew D. Kearse, Peter B. Gibbons:
A new lower bound on upper irredundance in the queens' graph. 225-242 - Ayman Khalfalah, Sachin Lodha, Endre Szemerédi:
Tight bound for the density of sequence of integers the sum of no two of which is a perfect square. 243-255 - Dongju Kim, Daekeun Lim:
2-connected and 2-edge-connected Steinhaus graphs. 257-265 - Mekkia Kouider, Maryvonne Mahéo:
Some bounds for the b-chromatic number of a grap. 267-277 - Bruce M. Landman, Aaron Robertson:
On generalized van der Waerden triples. 279-290 - Sungchul Lee:
Worst case asymptotics of power-weighted Euclidean functionals. 291-300 - Cai Heng Li:
On isomorphisms of finite Cayley graphs--a survey. 301-334 - Hirobumi Mizuno, Iwao Sato:
L-functions for images of graph coverings by some operations. 335-347 - Michael Molloy, Laura Sedgwick:
Isomorphism certificates for undirected graphs. 349-359 - Blanca Rosa Pérez-Salvador, Sergio de-los-Cobos-Silva, Miguel Angel Gutiérrez-Ándrade, Adolfo Torres-Chazaro:
A reduced formula for the precise number of (0, 1)-matrices in A(R, S). 361-372 - Burkard Polster:
Centering small generalized polygons-projective pottery at work. 373-386 - Yonutz Stanchescu:
Planar sets containing no three collinear points and non-averaging sets of integers. 387-395 - Shu-Dong Wang, Dong-Ling Chen, Shan-Chen Pang:
The incidence coloring number of Halin graphs and outerplanar graphs. 397-405 - Liming Xiong, Zhanhong Liu:
Hamiltonian iterated line graphs. 407-422 - József Balogh, András Pluhár:
The interval number of dense graphs. 423-429 - Paul S. Bonsma, Nicola Ueffing, Lutz Volkmann:
Edge-cuts leaving components of order at least three. 431-439 - Gerard J. Chang, Li-Da Tong, Jing-Ho Yan, Hong-Gwa Yeh:
A note on the Gallai-Roy-Vitaver Theorem. 441-444 - Vasek Chvátal, Irena Rusu, R. Sritharan:
Dirac-type characterizations of graphs without long chordless cycles. 445-448 - Alina Copeland, Frank W. Schmidt, Rodica Simion:
On two determinants with interesting factorizations. 449-458 - Ales Drápal:
Yet another approach to the extended ternary Golay code. 459-464 - Nicholas A. Hamilton:
Strongly regular graphs from differences of quadrics. 465-469 - Masaaki Harada, Patric R. J. Östergård:
Self-dual and maximal self-orthogonal codes over F7. 471-477 - Olof Heden:
On the reconstruction of perfect codes. 479-485 - Lih-Hsing Hsu:
A note on the ultimate categorical matching in a graph. 487-488 - Ilia Krasikov, Arieh Lev, Bhalchandra D. Thatte:
Upper bounds on the automorphism group of a graph0. 489-493 - Gregory L. Mayhew:
Extreme weight classes of de Bruijn sequences. 495-497 - Oren Nechushtan:
On the space chromatic number. 499-507 - Ofer Shafir:
Universal graphs without large bipartite graphs assuming GCH. 509-512 - Richard Stong:
Orthogonal Matchings. 513-518 - Chunxiang Wang, Jingzhong Mao:
A proof of a conjecture of minus domination in graphs. 519-521
Volume 256, Number 3, October 2002
- Gilbert Labelle, Pierre Leroux:
Foreword. 523-525 - Brian Alspach, Marni Mishna:
Enumeration of Cayley graphs and digraph. 527-539 - Didier Arquès, Anne Micheli:
Enumeration of multi-colored rooted maps. 541-556 - Jean-Christophe Aval:
On certain spaces of lattice diagram determinants. 557-575 - Margaret M. Bayer, Gábor Hetyei:
Generalizations of Eulerian partially ordered sets, flag numbers, and the Mo"bius function. 577-593 - Bob Clarke:
Towards the inverse of a word. 595-607 - Robert Cori, Dominique Poulalhon:
Enumeration of (p, q)-parking functions . 609-623 - Sylvie Corteel, Dominique Gouyou-Beauchamps:
Enumeration of sand piles. 625-643 - Emeric Deutsch, Svjetlan Feretic, Marc Noy:
Diagonally convex directed polyominoes and even trees: a bijection and related issues. 645-654 - Emeric Deutsch, Louis W. Shapiro:
A bijection between ordered trees and 2-Motzkin paths and its many consequences. 655-670 - Serge Dulucq, Jean-Guy Penaud:
Interpre'tation bijective d'une re'currence des nombres de Motzkin. 671-676 - Adriano M. Garsia, James Haglund:
A proof of the q, t-Catalan positivity conjecture. 677-717 - Louis H. Kalikow:
Symmetries in trees and parking functions. 719-741 - Gérald Ksavrelof, Jiang Zeng:
Nouvelles statistiques de partitions pour les q-nombres de Stirling de seconde espèce. 743-758 - Pierre Lalonde:
q-Enumeration of alternating sign matrices with exactly one -1. 759-773 - Yvan Le Borgne, Dominique Rossi:
On the identity of the sandpile group. 775-790 - Jean-Guy Penaud, Olivier Roques:
Tirage à pile ou face de mots de Fibonacci. 791-800 - Petko Valtchev, Rokia Missaoui, Pierre Lebrun:
A partition-based approach towards constructing Galois (concept) lattices. 801-829 - Mike Zabrocki:
q-Analogs of symmetric function operators. 831-853
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 2020-09-27 00:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
the dblp computer science bibliography is funded by:
