|
|
|
|
| LEADER |
02439nmm a2200445 u 4500 |
| 001 |
EB002120010 |
| 003 |
EBX01000000000000001258067 |
| 005 |
00000000000000.0 |
| 007 |
cr||||||||||||||||||||| |
| 008 |
221028 ||| eng |
| 020 |
|
|
|a 9780080867885
|
| 020 |
|
|
|a 1281789593
|
| 020 |
|
|
|a 9786611789596
|
| 020 |
|
|
|a 9780444890061
|
| 020 |
|
|
|a 008086788X
|
| 020 |
|
|
|a 9781281789594
|
| 020 |
|
|
|a 0444890068
|
| 050 |
|
4 |
|a QA166
|
| 100 |
1 |
|
|a Hedetniemi, S. T.
|
| 245 |
0 |
0 |
|a Topics on domination
|c [edited by] S.T. Hedetniemi, R.C. Laskar
|
| 246 |
3 |
1 |
|a Domination
|
| 260 |
|
|
|a Amsterdam
|b North-Holland
|c 1991, 1991
|
| 300 |
|
|
|a 280 pages
|b illustrations
|
| 505 |
0 |
|
|a Includes bibliographical references and index
|
| 505 |
0 |
|
|a Front Cover; Topics on Domination; Copyright Page; Contents; Part I: Introduction; Chapter 1. Introduction; Part II: Theoretical; Chapter 2. Chessboard domination problems; Chapter 3. On the queen domination problem; Chapter 4. Recent problems and results about kernels in directed graphs; Chapter 5. Critical concepts in domination; Chapter 6. The bondage number of a graph; Chapter 7. Chordal graphs and upper irredundance, upper domination and independence; Chapter 8. Regular totally domatically full graphs; Chapter 9. Domatically critical and domatically full graphs
|
| 653 |
|
|
|a Graph theory / http://id.loc.gov/authorities/subjects/sh85056471
|
| 653 |
|
|
|a Graphes, théorie des / ram
|
| 653 |
|
|
|a MATHEMATICS / Graphic Methods / bisacsh
|
| 653 |
|
|
|a Théorie des graphes
|
| 653 |
|
|
|a Graph theory
|
| 653 |
|
|
|a Graph theory / fast / (OCoLC)fst00946584
|
| 700 |
1 |
|
|a Laskar, R. C.
|
| 041 |
0 |
7 |
|a eng
|2 ISO 639-2
|
| 989 |
|
|
|b ZDB-1-ELC
|a Elsevier eBook collection Mathematics
|
| 490 |
0 |
|
|a Annals of discrete mathematics
|
| 776 |
|
|
|z 008086788X
|
| 776 |
|
|
|z 9780080867885
|
| 856 |
4 |
0 |
|u https://www.sciencedirect.com/science/bookseries/01675060/48
|x Verlag
|3 Volltext
|
| 082 |
0 |
|
|a 511/.5
|
| 520 |
|
|
|a The contributions in this volume are divided into three sections: theoretical, new models and algorithmic. The first section focuses on properties of the standard domination number & ggr;(G), the second section is concerned with new variations on the domination theme, and the third is primarily concerned with finding classes of graphs for which the domination number (and several other domination-related parameters) can be computed in polynomial time
|