Domination Graphs with Nontrivial Components
- 期刊名称Graphs and Combinatorics
- 作者David C. Fisher; David Guichard; J. Richard Lundgren; Sarah K. Merz; K. Brooks Reid
- 卷第17卷
- 期第2期
- 印刷ISSN0911-0119
- 电子ISSN1435-5914
- 文件大小123.84KB
- 发表时间2001-06
- DOI10.1007/s003730170036
- 页码227-236
Packing paths in digraphsRichard C. Brewster; Pavol Hell; Sarah H. Pantel; Romeo Rizzi; Anders Yeo · 2003
When the greedy algorithm failsJørgen Bang-Jensen; Gregory Gutin; Anders Yeo · 2004
Kernels in planar digraphsGregory Gutin; Ton Kloks; Chuan Min Lee; Anders Yeo · 2005
Orientations of digraphs almost preserving diameterGregory Gutin; Anders Yeo · 2002
Upper bounds on ATSP neighborhood sizeGregory Gutin; Anders Yeo · 2003
Anti-matroidsGregory Gutin; Anders Yeo · 2002
Total Domination in Partitioned GraphsAllan Frendrup; Preben Dahl Vestergaard; Anders Yeo · 2009
Girth and Total Domination in GraphsMichael A. Henning; Anders Yeo · 2012
From the managing editorJin Akiyama · Graphs and Combinatorics · 1993
On the vertex packing problemC. De Simone · Graphs and Combinatorics · 1993
Sperner capacitiesL. Gargano; J. Körner; U. Vaccaro · Graphs and Combinatorics · 1993
The excess of complex Hadamard matricesH. Kharaghani; Jennifer Seberry · Graphs and Combinatorics · 1993
Gadget classificationMartin Loebl · Graphs and Combinatorics · 1993
Triple placement of graphsMariusz Woźniak; A. Paweł Wojda · Graphs and Combinatorics · 1993
Symmetric Association Schemes of Class 2Hiroshi Iwane · Graphs and Combinatorics · 1993
Searching for counterfeit coinsMartin Aigner; Anping Li · Graphs and Combinatorics · 1997