Domination in graphs
Work detail
Responding to the increasing interest in, and demand for, in-depth publications in the field, this stimulating new resource presents the latest in graph domination by leading researchers from around the world - furnishing known results, open research problems, and proof techniques. Maintaining standardized terminology and notation throughout for greater accessibility, Domination in Graphs covers recent developments in domination in graphs and digraphs...dominating functions...combinatorial problems on chessboards...Vizing's conjecture...domination algorithms and complexity...varieties of domination...domatic numbers...changing and unchanging domination numbers...and more.
Overview
Shared work-level identity and catalog context.
Contributors
People credited with this work in the active catalog.
- Open Author
Teresa Haynes
- Open Author
Peter Slater
- Open Author
Stephen Hedetniemi
- Open Author
Teresa W. Haynes
- Open Author
Peter J. Slater
- Open Author
S. T. Hedetniemi
- Open Author
Michael A. Henning
Editions
Publication-specific versions linked to this work only.
