A note on graphs with large girth and small minus domination number (Englisch)
- Neue Suche nach: Lee, J.
- Neue Suche nach: Sohn, M. Y.
- Neue Suche nach: Kim, H. K.
- Neue Suche nach: Lee, J.
- Neue Suche nach: Sohn, M. Y.
- Neue Suche nach: Kim, H. K.
In:
DISCRETE APPLIED MATHEMATICS
;
91
, 1/3
;
299-304
;
1999
-
ISSN:
- Aufsatz (Zeitschrift) / Print
-
Titel:A note on graphs with large girth and small minus domination number
-
Beteiligte:
-
Erschienen in:DISCRETE APPLIED MATHEMATICS ; 91, 1/3 ; 299-304
-
Verlag:
- Neue Suche nach: ELSEVIER
-
Erscheinungsdatum:01.01.1999
-
Format / Umfang:6 pages
-
ISSN:
-
Medientyp:Aufsatz (Zeitschrift)
-
Format:Print
-
Sprache:Englisch
- Neue Suche nach: 510
- Weitere Informationen zu Dewey Decimal Classification
-
Klassifikation:
DDC: 510 -
Datenquelle:
© Metadata Copyright the British Library Board and other contributors. All rights reserved.
Inhaltsverzeichnis – Band 91, Ausgabe 1/3
Zeige alle Jahrgänge und Ausgaben
Die Inhaltsverzeichnisse werden automatisch erzeugt und basieren auf den im Index des TIB-Portals verfügbaren Einzelnachweisen der enthaltenen Beiträge. Die Anzeige der Inhaltsverzeichnisse kann daher unvollständig oder lückenhaft sein.
- 1
-
Clustering bipartite and chordal graphs: Complexity, sequential and parallel algorithmsAbbas, Nesrine et al. | 1999
- 25
-
Minimal connected enclosures on an embedded planar graphAlexopoulos, Christos et al. | 1999
- 39
-
Separable partitionsAlon, Noga et al. | 1999
- 53
-
Matrices with maximum exponents in the class of doubly stochastic primitive matricesBo, Zhou et al. | 1999
- 67
-
Stabbing information of a simple polygonEverett, Hazel et al. | 1999
- 83
-
On the cut-off point for combinatorial group testingFischer, Paul et al. | 1999
- 93
-
Minimizing broadcast costs under edge reductions in tree networksHambrusch, Susanne E. et al. | 1999
- 119
-
A combinatorial problem in database securityHorak, Peter et al. | 1999
- 127
-
The b-chromatic number of a graphIrving, Robert W. et al. | 1999
- 143
-
Generalized partitions of graphsMacgillivray, Gary et al. | 1999
- 155
-
On the algorithmic complexity of twelve covering and independence parameters of graphsManlove, David F. et al. | 1999
- 177
-
Inducing an order on cellular automata by a grouping operationMazoyer, Jacques et al. | 1999
- 197
-
Underdiagonal lattice paths with unrestricted stepsMerlini, Donatella et al. | 1999
- 215
-
Retractions of finite distance functions onto tree metricsMoulton, Vincent et al. | 1999
- 235
-
Data-dependent bounds for the General and the Asymmetric Stacker-Crane problemsRighini, Giovanni et al. | 1999
- 243
-
Induced permutation automata and coverings of strongly connected automataUemura, Kenji et al. | 1999
- 251
-
On the complexity of postoptimality analysis of 0-1 programsVan Hoesel, Stan et al. | 1999
- 265
-
Compatible Hamilton decompositions of directed wrapped butterfly graphsVerrall, H. et al. | 1999
- 265
-
Compatible Hamilton decomposition of directed wrapped butterfly graphsVerrall, H. et al. | 1999
- 277
-
On the nonexistence of extremal self-dual codesZhang, Shengyuan et al. | 1999
- 287
-
Construction of a simple elimination scheme for a chordal comparability graph in linear timeBorie, Richard B. et al. | 1999
- 293
-
Even and odd pairs in comparability and in P4-comparability graphsde Figueiredo, Celina M.H. et al. | 1999
- 299
-
A note on graphs with large girth and small minus domination numberLee, J. / Sohn, M. Y. / Kim, H. K. et al. | 1999
- 305
-
Optimal binary trees with order constraintsSebo, András et al. | 1999