Some results for chessboard separation problems
For a chessboard graph and a given graph parameter , a separation number is the minimum number of pawns for which some arrangement of those pawns on the board will produce a board where has some desired value. We extend previous results on independence and domination separation. We also consider sep...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artigo |
| Sprache: | Inglês |
| Veröffentlicht: |
Taylor & Francis Group
2018-12-01
|
| Schriftenreihe: | AKCE International Journal of Graphs and Combinatorics |
| Schlagworte: | |
| Online-Zugang: | http://dx.doi.org/10.1016/j.akcej.2017.11.001 |
| Tags: |
Keine Tags, Fügen Sie das erste Tag hinzu!
|