×

zbMATH — the first resource for mathematics

Eschen, Elaine M.

Compute Distance To:
Author ID: eschen.elaine-m Recent zbMATH articles by "Eschen, Elaine M."
Published as: Eschen, Elaine; Eschen, Elaine M.
Documents Indexed: 24 Publications since 1993

Publications by Year

Citations contained in zbMATH

19 Publications have been cited 137 times in 127 Documents Cited by Year
Group connectivity of certain graphs. Zbl 1224.05267
Chen, Jingjing; Eschen, Elaine; Lai, Hong-Jian
31
2008
The complexity of the list partition problem for graphs. Zbl 1151.05045
Cameron, Kathie; Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
15
2007
An \(O(n^ 2)\) algorithm for circular-arc graph recognition. Zbl 0801.68128
Eschen, Elaine M.; Spinrad, Jeremy P.
15
1993
The list partition problem for graphs. Zbl 1318.05072
Cameron, Kathie; Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
11
2004
The induced matching and chain subgraph cover problems for convex bipartite graphs. Zbl 1188.68209
Brandstädt, Andreas; Eschen, Elaine M.; Sritharan, R.
10
2007
On graphs without a \(C_{4}\) or a diamond. Zbl 1213.05244
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R.
9
2011
Algorithms for unipolar and generalized split graphs. Zbl 1300.05251
Eschen, Elaine M.; Wang, Xiaoqiang
8
2014
On potentially \((K_4-e)\)-graphic sequences. Zbl 1049.05027
Eschen, Elaine M.; Niu, Jianbing
7
2004
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. Zbl 1417.05150
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik
6
2016
\(2K_{2}\) vertex-set partition into nonempty parts. Zbl 1230.05233
Cook, Kathryn; Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; de Figueiredo, Celina M. H.; Klein, Sulamita
6
2010
Perfect codes and independent dominating sets. Zbl 0976.05044
Klostermeyer, William F.; Eschen, Elaine M.
4
2000
A characterization of some graph classes with no long holes. Zbl 0842.05074
Eschen, Elaine; Sritharan, R.
4
1995
Recognition of some perfectly orderable graph classes. Zbl 1019.68075
Eschen, Elaine M.; Johnson, Julie L.; Spinrad, Jeremy P.; Sritharan, R.
3
2003
The \(s\)-Hamiltonian index. Zbl 1223.05166
Lili, Zhang; Eschen, Elaine; Lai, Hong-Jian; Shao, Yehong
2
2008
Weakly triangulated comparability graphs. Zbl 0937.05070
Eschen, Elaine; Hayward, Ryan B.; Spinrad, Jeremy; Sritharan, R.
2
1998
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Zbl 1222.05055
Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.; Stewart, Lorna
1
2011
\(2K_2\) vertex-set partition into nonempty parts. Zbl 1341.05205
Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; De Figueiredo, Celina M. H.; Klein, Sulamita
1
2008
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs. Zbl 1123.68089
Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
1
2007
Disjoint clique cutsets in graphs without long holes. Zbl 1061.05067
Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D. T.; Sritharan, R.
1
2005
Efficient domination for some subclasses of \(P_6\)-free graphs in polynomial time. Zbl 1417.05150
Brandstädt, Andreas; Eschen, Elaine M.; Friese, Erik
6
2016
Algorithms for unipolar and generalized split graphs. Zbl 1300.05251
Eschen, Elaine M.; Wang, Xiaoqiang
8
2014
On graphs without a \(C_{4}\) or a diamond. Zbl 1213.05244
Eschen, Elaine M.; Hoàng, Chính T.; Spinrad, Jeremy P.; Sritharan, R.
9
2011
On the complexity of deciding whether the distinguishing chromatic number of a graph is at most two. Zbl 1222.05055
Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.; Stewart, Lorna
1
2011
\(2K_{2}\) vertex-set partition into nonempty parts. Zbl 1230.05233
Cook, Kathryn; Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; de Figueiredo, Celina M. H.; Klein, Sulamita
6
2010
Group connectivity of certain graphs. Zbl 1224.05267
Chen, Jingjing; Eschen, Elaine; Lai, Hong-Jian
31
2008
The \(s\)-Hamiltonian index. Zbl 1223.05166
Lili, Zhang; Eschen, Elaine; Lai, Hong-Jian; Shao, Yehong
2
2008
\(2K_2\) vertex-set partition into nonempty parts. Zbl 1341.05205
Dantas, Simone; Eschen, Elaine M.; Faria, Luerbio; De Figueiredo, Celina M. H.; Klein, Sulamita
1
2008
The complexity of the list partition problem for graphs. Zbl 1151.05045
Cameron, Kathie; Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
15
2007
The induced matching and chain subgraph cover problems for convex bipartite graphs. Zbl 1188.68209
Brandstädt, Andreas; Eschen, Elaine M.; Sritharan, R.
10
2007
An \(O( n^{3})\)-time recognition algorithm for hhds-free graphs. Zbl 1123.68089
Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
1
2007
Disjoint clique cutsets in graphs without long holes. Zbl 1061.05067
Eschen, Elaine M.; Hoàng, Chính T.; Petrick, Mark D. T.; Sritharan, R.
1
2005
The list partition problem for graphs. Zbl 1318.05072
Cameron, Kathie; Eschen, Elaine M.; Hoàng, Chính T.; Sritharan, R.
11
2004
On potentially \((K_4-e)\)-graphic sequences. Zbl 1049.05027
Eschen, Elaine M.; Niu, Jianbing
7
2004
Recognition of some perfectly orderable graph classes. Zbl 1019.68075
Eschen, Elaine M.; Johnson, Julie L.; Spinrad, Jeremy P.; Sritharan, R.
3
2003
Perfect codes and independent dominating sets. Zbl 0976.05044
Klostermeyer, William F.; Eschen, Elaine M.
4
2000
Weakly triangulated comparability graphs. Zbl 0937.05070
Eschen, Elaine; Hayward, Ryan B.; Spinrad, Jeremy; Sritharan, R.
2
1998
A characterization of some graph classes with no long holes. Zbl 0842.05074
Eschen, Elaine; Sritharan, R.
4
1995
An \(O(n^ 2)\) algorithm for circular-arc graph recognition. Zbl 0801.68128
Eschen, Elaine M.; Spinrad, Jeremy P.
15
1993
all top 5

Cited by 174 Authors

16 Li, Xiangwen
11 Brandstädt, Andreas
11 Yin, Jianhua
10 de Figueiredo, Celina M. Herrera
9 Dantas, Simone
9 Hell, Pavol
7 Lai, Hong-Jian
6 Feder, Tomás
6 Xu, Rui
5 Eschen, Elaine M.
5 Klein, Sulamita
5 Mosca, Raffaele
4 Giakoumakis, Vassilis
4 Luo, Rong
4 Shao, Yehong
4 Sritharan, R.
4 Teixeira, Rafael B.
4 Yang, Fan
4 Zhang, Xiaoxia
3 Faria, Luerbio
3 Hung, Ruowei
3 Kowaluk, Mirosław
3 Lê Văn Băng
3 Li, Hao
3 Li, Ping
3 Lingas, Andrzej
3 Maffray, Frédéric
3 Martin, Barnaby D.
3 Milanič, Martin
3 Paulusma, Daniël
3 Spinrad, Jeremy P.
3 Van Leeuwen, Erik Jan
3 Yu, Gexin
3 Zhan, Mingquan
2 Cameron, Kathie
2 Cardoso, Domingos Moreira
2 Chang, Maw-Shang
2 Dai, Xiangyu
2 Gavril, Fanica
2 Gravier, Sylvain
2 Hoàng, Chính T.
2 Hou, Xinmin
2 Hu, Lili
2 Huang, Ziwen
2 Kanj, Iyad A.
2 Komusiewicz, Christian
2 Kratsch, Dieter
2 Lai, Chunhui
2 Li, Liangchen
2 Lozin, Vadim Vladislavovich
2 Ma, Jianqing
2 MacKee, Terry Allan
2 Miao, Zhengke
2 Sorge, Manuel
2 Zhang, Cunquan
2 Zhou, Ju
1 Abueida, Atif A.
1 Alcón, Liliana
1 Bahrani, Maryam
1 Baptiste, Philippe
1 Berry, Anne
1 Bodirsky, Manuel
1 Bousquet, Nicolas
1 Busch, Arthur H.
1 Calamoneri, Tiziana
1 Cerioli, Márcia R.
1 Chen, Guihai
1 Cheng, Tai-Chiu Edwin
1 Cook, Kathryn
1 Dane, Piyush
1 Davari, Mohammad-Javad
1 de Werra, Dominique
1 Deng, Kecai
1 Deogun, Jitender S.
1 Edmonds, Jack R.
1 Eisenbeis, Christine
1 Fičur, Pavel
1 Floderus, Peter
1 Fox, Jacob
1 Friese, Erik
1 Furuya, Michitaka
1 Gastaldello, Mattia
1 Guan, Jing-Xin
1 Gutierrez, Marisa
1 Hayward, Ryan B.
1 Huang, Jing
1 Huang, Mingfang
1 Ito, Takehiro
1 Joos, Felix Claudius
1 Kamiński, Marcin Marek
1 Kang, Liying
1 Kaplan, Haim
1 Kára, Jan
1 Karthick, T.
1 Kashyap, Manav
1 Klavžar, Sandi
1 Kloks, Ton
1 Korpelainen, Nicholas
1 Kovalyov, Mikhail Yakovlevich
1 Krishnamurthy, Chandra Mohan
...and 74 more Authors

Citations by Year