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...
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Taylor & Francis Group
2018-12-01
|
| Series: | AKCE International Journal of Graphs and Combinatorics |
| Subjects: | |
| Online Access: | http://dx.doi.org/10.1016/j.akcej.2017.11.001 |