


default search action
Discrete Mathematics, Volume 277
Volume 277, Number 1-3, February 2004
- Nawarat Ananchuen, Michael D. Plummer:

Matching properties in domination critical graphs. 1-13 - Christine Bachoc, Eiichi Bannai, Renaud Coulangeon:

Codes and designs in Grassmannian spaces. 15-28 - Abderrahim Boussaïri, Pierre Ille, Gérard Lopez, Stéphan Thomassé:

The C3-structure of the tournaments. 29-43 - Charles Delorme, Samuel Gonzalez, Oscar Ordaz, María Teresa Varela:

Barycentric sequences and barycentric Ramsey numbers stars. 45-56 - Linda Eroh, Ortrud Oellermann:

Bipartite rainbow Ramsey numbers. 57-72 - Rongquan Feng, Jin Ho Kwak:

Typical circulant double coverings of a circulant graph. 73-85 - Jieh Hsiang

, D. Frank Hsu, Yuh-Pyng Shieh:
On the hardness of counting problems of complete mappings. 87-100 - Dominic Lanphier, Jason Rosenhouse:

Cheeger constants of Platonic graphs. 101-113 - Frantisek Matús:

Towards classification of semigraphoids. 115-145 - Gregory L. McColm:

On the structure of random unlabelled acyclic graphs. 147-170 - Ali Shokoufandeh, Yi Zhao:

On a tiling conjecture of Komlo's for 3-chromatic graphs. 171-191 - Frank Van Bussel:

0-Centred and 0-ubiquitously graceful trees. 193-218 - Troy Vasiga, Jeffrey O. Shallit:

On the iteration of certain quadratic maps over GF(p). 219-240 - Steve Wilson, Antonio Breda d'Azevedo

:
Surfaces having no regular hypermaps. 241-274 - Alain Lascoux:

Sylvester's bijection between strict and odd partitions. 275-278 - Michele Conforti, Giovanni Rinaldi

, Laurence A. Wolsey:
On the cut polyhedron. 279-285 - Hong Feng, Zhizheng Zhang:

Combinatorial proofs of identities of Calkin and Hirschhorn. 287-294 - Liying Kang, Hye Kyung Kim, Moo Young Sohn:

Minus domination number in k-partite graphs. 295-300 - Daniel Král

:
On maximum face-constrained coloring of plane graphs with no short face cycles. 301-307 - Felix Lazebnik, Raymond Viglione:

On the connectivity of certain graphs of high girth. 309-319 - William D. Weakley:

Erratum to "Upper bounds for domination numbers of the queen's graph": [Discrete Mathematics 242 (2002) 229-243]. 321-

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.


Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID














