default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDDiscrete Mathematics, Volume 287
Volume 287, Number 1-3, October 2004
- Stefka Bouyuklieva
:
Some optimal self-orthogonal and self-dual codes. 1-10 - Zhibo Chen:
On k-pairable graphs. 11-15 - Michel Grabisch:
The Möbius transform on symmetric ordered structures and its application to capacities on finite sets. 17-34 - H. K. Hsiao, S. S. Yu, Yu-Kuang Zhao:
Word-paired catenations of regular languages. 35-43 - Mehri Javanian, Hosam M. Mahmoud, Mohammad Q. Vahidi-Asl:
Paths in m-ary interval trees. 45-53 - L. Ji:
On the 3BD-closed set B3( 4, 5 ). 55-67 - Rao Li:
Hamiltonicity of 2-connected K1, 4, K1, 4+e-free graphs. 69-76 - Gérard Maze:
Partitions modulo n and circulant matrices. 77-84 - John P. McSorley, Thomas Dale Porter:
Generating sequences of clique-symmetric graphs via Eulerian digraphs. 85-91 - Jérôme Renault:
View-obstruction: a shorter proof for 6 lonely runners. 93-101 - Jichang Wu, Xueliang Li, Lusheng Wang:
Removable edges in a cycle of a 4-connected graph. 103-111 - Ming Yao Xu, Young-Gheel Baik, Hyo-Seob Sim:
Arc-transitive circulant digraphs of odd prime-power order. 113-119
- Ken-ichi Kawarabayashi:
Rooted minor problems in highly connected graphs. 121-123 - Padmavathamma, Ramachandra Raghavendra, B. M. Chandrashekara:
A new bijective proof of a partition theorem of K. Alladi. 125-128 - Michael H. Albert, Robert E. L. Aldred, Mike D. Atkinson, Hans P. van Ditmarsch, Chris C. Handley, Derek A. Holton:
Restricted permutations and queue jumping. 129-133 - Robert E. L. Aldred, Derek A. Holton, Dingjun Lou, Ning Zhong:
Characterizing 2k-critical graphs and n-extendable graphs. 135-139 - Gilbert B. Cagaanan, Sergio R. Canoy Jr.:
On the hull sets and hull number of the cartesian product of graphs. 141-144 - Jordan Carlson, Daniel Stolarski:
The correct solution to Berlekamp's switching game. 145-150 - Amine El Sahili:
Paths with two blocks in k-chromatic digraphs. 151-153 - Dae San Kim, Dong Chan Kim:
Character sums and MacWilliams identities. 155-160 - Daniel Král:
Hajós' theorem for list coloring. 161-163 - Terry A. McKee:
Biclique comparability digraphs of bipartite graphs and minimum ranks of partial matrices. 165-170 - Michael D. Plummer, Xiaoya Zha:
On the p-factor-criticality of the Klein bottle. 171-175 - Yidong Sun:
The statistic "number of udu's" in Dyck paths. 177-186 - Raphael Yuster:
The number of edge-disjoint transitive triples in a tournament. 187-191
- Lutz Volkmann:
The Petersen graph is not 1-factorable: postscript to The Petersen graph is not 3-edge-colorable - a new proof' [Discrete Math. 268 (2003) 325-326]. 193-194
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-02-21 19:37 CET 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:
