|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 25 publication records. Showing 25 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Gerd Fricke, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Kevin R. Hutson |
γ-graphs of graphs.  |
Discussiones Mathematicae Graph Theory  |
2011 |
DBLP BibTeX RDF |
|
| 1 | Brian C. Dean, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Jason Lewis, Alice A. McRae |
Matchability and k-maximal matchings. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, John M. Harris, Douglas F. Rall |
Braodcast Chromatic Numbers of Graphs. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Jean E. Dunbar, David J. Erwin, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
Broadcasts in graphs. |
Discrete Applied Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Wayne Goddard, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Renu Laskar |
Generalized subgraph-restricted matchings in graphs. |
Discrete Mathematics |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Dee Parks, Jan Arne Telle |
Iterated colorings of graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Paul A. Dreyer Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
Roman domination in graphs. |
Discrete Mathematics |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Odile Favaron, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall |
On k-dependent domination. |
Discrete Mathematics |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning |
Domination in Graphs Applied to Electric Power Networks. |
SIAM J. Discrete Math. |
2002 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Douglas F. Rall |
Acyclic domination. |
Discrete Mathematics |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashraf M. Abdelbar, Stephen T. Hedetniemi, Sandra Mitchell Hedetniemi |
The complexity of approximating MAPs for belief networks with bounded probabilities. |
Artif. Intell. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Gerd Fricke, Teresa W. Haynes, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Michael A. Henning |
On perfect neighborhood sets in graphs. |
Discrete Mathematics |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Christina M. Mynhardt |
Irredundant and perfect neighbourhood sets in trees. |
Discrete Mathematics |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ashraf M. Abdelbar, Sandra Mitchell Hedetniemi |
Approximating MAPs for Belief Networks is NP-Hard and Other Theorems. |
Artif. Intell. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Ernest J. Cockayne, Johannes H. Hattingh, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae |
Using maximality and minimality conditions to construct inequality chains. |
Discrete Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jing-Ho Yan, Gerard J. Chang, Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi |
k-Path Partitions in Trees. |
Discrete Applied Mathematics |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Jean E. Dunbar, Frederick C. Harris Jr., Sandra Mitchell Hedetniemi, Stephen T. Hedetniemi, Alice A. McRae, Renu C. Laskar |
Nearly perfect sets in graphs. |
Discrete Mathematics |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan |
Edge Insertion for Optimal Triangulations. |
Discrete & Computational Geometry |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Marshall W. Bern, Herbert Edelsbrunner, David Eppstein, Sandra L. Mitchell, Tiow Seng Tan |
Edge Insertion for Optional Triangulations. |
LATIN |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra Mitchell Hedetniemi, Andrzej Proskurowski, Maciej M. Syslo |
Interior graphs of maximal outerplane graphs. |
J. Comb. Theory, Ser. B |
1985 |
DBLP DOI BibTeX RDF |
|
| 1 | Terry Beyer, Sandra Mitchell Hedetniemi |
Constant Time Generation of Rooted Trees. |
SIAM J. Comput. |
1980 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell, Stephen T. Hedetniemi |
Linear Algorithms for Edge-Coloring Trees and Unicyclic Graphs. |
Inf. Process. Lett. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell |
Linear Algorithms to Recognize Outerplanar and Maximal Outerplanar Graphs. |
Inf. Process. Lett. |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell, Terry Beyer, W. Jones |
Linear Algorithms for Isomorphism of Maximal Outerplanar Graphs. |
J. ACM |
1979 |
DBLP DOI BibTeX RDF |
|
| 1 | Sandra L. Mitchell, Ernest J. Cockayne, Stephen T. Hedetniemi |
Linear Algorithms on Recursive Representations of Trees. |
J. Comput. Syst. Sci. |
1979 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #25 of 25 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")