Discrete Applied Mathematics logo Elsevier logo

Publisher: Elsevier

Volume 127, Number 3, 1 May 2003
Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content

< previous issue | next issue > | all issues

IFC (non-1st issue/vol)
pp. CO2-CO2(1)

The power of small coalitions in graphs
pp. 399-414(16)
Authors: Bermond J.-C.; Bond J.; Peleg D.; Perennes S.

Sparse Hypercube-a minimal k-line broadcast graph
pp. 431-446(16)
Authors: Fujita S.; Farley A.M.

On sum coloring of graphs
pp. 477-488(12)
Author: Salavatipour M.R.

Reconstructing minimal rooted trees
pp. 489-503(15)
Author: Semple C.

A complete adaptive algorithm for propositional satisfiability
pp. 523-534(12)
Authors: Bruni R.; Sassano A.

A new proof of Wojcicka's conjecture
pp. 545-554(10)
Authors: Chen Y.; Tian F.

Total balancedness condition for Steiner tree games
pp. 555-563(9)
Authors: Fang Q.; Cai M.; Deng X.

On the domination search number
pp. 565-580(16)
Authors: Fomin F.V.; Kratsch D.; Muller H.

Bipartite-perfect graphs
pp. 581-599(19)
Author: Bang Le V.

Connectivity of vertex and edge transitive graphs
pp. 601-613(13)
Author: Meng J.

Maximal value of the zeroth-order Randic index
pp. 615-626(12)
Author: Pavlovic L.

The disjunctivities of omega-languages
pp. 627-641(15)
Authors: Yeh Y.T.; Yu S.S.

On cutting a few vertices from a graph
pp. 643-649(7)
Authors: Feige U.; Krauthgamer R.; Nissim K.

Parametric min-cuts analysis in a network
pp. 679-689(11)
Authors: Aneja Y.P.; Chandrasekaran R.; Nair K.P.K.

< previous issue | next issue > | all issues

Key:
Free Content - Free Content
New Content - New Content
Subscribed Content - Subscribed Content
Free Trial Content - Free Trial Content
Share this item with others: These icons link to social bookmarking sites where readers can share and discover new web pages.
Page Help Click here for Page Help
Shopping cart
Tools
Sign in






Need to register?
Sign up here
Text size: A | A | A | A