|
|
|
|
Venues (Conferences, Journals, ...)
|
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
No Growbag Graphs found.
|
|
|
|
|
Results
Found 23 publication records. Showing 23 according to the selection in the facets
| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a Sun in Building-Free Graphs.  |
Graphs and Combinatorics  |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. |
Discrete Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Xiaoqiang Wang |
Algorithms for Unipolar and Generalized Split Graphs |
CoRR |
2011 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond. |
Discrete Applied Mathematics |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathryn Cook, Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein |
2K2 vertex-set partition into nonempty parts. |
Discrete Mathematics |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
On graphs without a C4 or a diamond |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Jeremy Spinrad, R. Sritharan |
Finding a sun in building-free graphs |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, R. Sritharan, Lorna Stewart |
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two |
CoRR |
2009 |
DBLP BibTeX RDF |
|
| 1 | Simone Dantas, Elaine M. Eschen, Luerbio Faria, Celina M. Herrera de Figueiredo, Sulamita Klein |
2K2 vertex-set partition into nonempty parts. |
Electronic Notes in Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Zhang Lili, Elaine M. Eschen, Hong-Jian Lai, Yehong Shao |
The s-Hamiltonian index. |
Discrete Mathematics |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Jingjing Chen, Elaine M. Eschen, Hong-Jian Lai |
Group connectivity of certain graphs. |
Ars Comb. |
2008 |
DBLP BibTeX RDF |
|
| 1 | Andreas Brandstädt, Elaine M. Eschen, R. Sritharan |
The induced matching and chain subgraph cover problems for convex bipartite graphs. |
Theor. Comput. Sci. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The Complexity of the List Partition Problem for Graphs. |
SIAM J. Discrete Math. |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Nicolas Pinet, Alain Sigayret |
Consecutive-ones: Handling Lattice Planarity Efficiently. |
CLA |
2007 |
DBLP BibTeX RDF |
|
| 1 | Elaine M. Eschen, Jeremy Spinrad |
Finding Triangles in Restricted Classes of Graphs. |
Electronic Notes in Discrete Mathematics |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Chính T. Hoàng, Mark D. T. Petrick, R. Sritharan |
Disjoint clique cutsets in graphs without long holes. |
Journal of Graph Theory |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Kathie Cameron, Elaine M. Eschen, Chính T. Hoàng, R. Sritharan |
The list partition problem for graphs. |
SODA |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, William Klostermeyer, R. Sritharan |
Planar domination graphs. |
Discrete Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Julie L. Johnson, Jeremy Spinrad, R. Sritharan |
Recognition of Some Perfectly Orderable Graph Classes. |
Discrete Applied Mathematics |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Cun-Quan Zhang, Yunkai Liu, Elaine M. Eschen, Keqiang Wu |
Identifying Regulatory Signals in DNA-Sequences with a Non-statistical Approximation Approach. |
CSB |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Ryan Hayward, Jeremy Spinrad, R. Sritharan |
Weakly Triangulated Comparability Graphs. |
SIAM J. Comput. |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, R. Sritharan |
A Characterization of Some Graph Classes with No Long Holes. |
J. Comb. Theory, Ser. B |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Elaine M. Eschen, Jeremy Spinrad |
An O(n2) Algorithm for Circular-Arc Graph Recognition. |
SODA |
1993 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #23 of 23 (100 per page; Change: )
|
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")