Crossref Citations
This article has been cited by the following publications. This list is generated based on data provided by
Crossref.
Street, Anne Penfold
1995.
Combinatorics Advances.
p.
307.
Gray, Brenton D.
and
Ramsay, Colin
1999.
Some results on defining sets of t-designs.
Bulletin of the Australian Mathematical Society,
Vol. 59,
Issue. 2,
p.
203.
Donovan, Diane
Khodkar, Abdollah
and
Street, Anne Penfold
2003.
Designs 2002.
p.
103.
Adams, Peter
Mahdian, Mohammad
and
Mahmoodian, E.S.
2004.
On the forced matching numbers of bipartite graphs.
Discrete Mathematics,
Vol. 281,
Issue. 1-3,
p.
1.
Harary, Frank
Slany, Wolfgang
and
Verbitsky, Oleg
2005.
STACS 2005.
Vol. 3404,
Issue. ,
p.
182.
Hatami, Hamed
and
Maserrat, Hossein
2005.
On the computational complexity of defining sets.
Discrete Applied Mathematics,
Vol. 149,
Issue. 1-3,
p.
101.
Boros, Endre
Sz‘`onyi, Tamás
and
Tichler, Krisztián
2005.
On defining sets for projective planes.
Discrete Mathematics,
Vol. 303,
Issue. 1-3,
p.
17.
Grannell, Mike J.
Griggs, Terry S.
and
Street, Anne Penfold
2006.
A Flaw in the Use of Minimal Defining Sets for Secret Sharing Schemes.
Designs, Codes and Cryptography,
Vol. 40,
Issue. 2,
p.
225.
Harary, Frank
Slany, Wolfgang
and
Verbitsky, Oleg
2007.
On the Computational Complexity of the Forcing Chromatic Number.
SIAM Journal on Computing,
Vol. 37,
Issue. 1,
p.
1.
Gács, András
and
Szőnyi, Tamás
2008.
Random constructions and density results.
Designs, Codes and Cryptography,
Vol. 47,
Issue. 1-3,
p.
267.
Donovan, Diane
Lefevre, James
Waterhouse, Mary
and
Yazıcı, Emine Şule
2009.
On Defining Sets of Full Designs with Block Size Three.
Graphs and Combinatorics,
Vol. 25,
Issue. 6,
p.
825.
Lefevre, James
and
Waterhouse, Mary
2010.
On defining sets of full designs.
Discrete Mathematics,
Vol. 310,
Issue. 21,
p.
3000.
Kolotoğlu, Emre
and
Yazıcı, Emine Şule
2010.
On Minimal Defining Sets of Full Designs and Self-Complementary Designs, and a New Algorithm for Finding Defining Sets of t-Designs.
Graphs and Combinatorics,
Vol. 26,
Issue. 2,
p.
259.
Donovan, Diane
Lefevre, James
Waterhouse, Mary
and
Yazıcı, Emine Şule
2012.
Defining Sets of Full Designs with Block Size Three II.
Annals of Combinatorics,
Vol. 16,
Issue. 3,
p.
507.
Demirkale, Fatih
and
Yazıcı, Emine Şule
2014.
On The Spectrum of Minimal Defining Sets of Full Designs.
Graphs and Combinatorics,
Vol. 30,
Issue. 1,
p.
141.
Xu, Shou-Jun
Zhang, Heping
and
Cai, Jinzhuan
2015.
Complete forcing numbers of catacondensed hexagonal systems.
Journal of Combinatorial Optimization,
Vol. 29,
Issue. 4,
p.
803.
Xu, Shou-Jun
Liu, Xiu-Song
Chan, Wai Hong
and
Zhang, Heping
2016.
Complete forcing numbers of primitive coronoids.
Journal of Combinatorial Optimization,
Vol. 32,
Issue. 1,
p.
318.
Wei, Lina
Bian, Hong
Yu, Haizheng
and
Lin, Guocan
2023.
Complete forcing numbers of catacondensed phenylene systems.
Filomat,
Vol. 37,
Issue. 24,
p.
8309.
He, Xin
and
Zhang, Heping
2023.
Complete forcing numbers of complete and almost-complete multipartite graphs.
Journal of Combinatorial Optimization,
Vol. 46,
Issue. 2,