-factorization of complete bipartite graphs
- 作者Jian Wang; Beiliang Du
- 卷第308卷
- 期第9期
- 印刷ISSN0012-365X
- 文件大小159.22KB
- 发表时间2008
- DOI10.1016/j.disc.2006.09.046
- 页码1665-1673
Mostar indexDošlić, Tomislav; Martinjak, Ivica; Škrekovski, Riste; Tipurić Spužević, Sanja; Zubac, Ivana · Journal of Mathematical Chemistry · 2018
Computing the bipartite edge frustration of fullerene graphsTomislav Došlić; Damir Vukičević · 2007
Global forcing number for maximal matchingsVukičević, Damir; Zhao, Shuang; Sedlar, Jelena; Xu, Shou-Jun; Došlić, Tomislav · Discrete Mathematics · 2018
Splinoid interpolation on finite posetsTomislav Došlić; Douglas J. Klein · 2005
Enumerative aspects of secondary structuresTomislav Došlić; Dragutin Svrtan; Darko Veljan · 2004
Global Forcing Number of Benzenoid GraphsTomislav Došlić · 2007
Saturation number of fullerene graphsTomislav Došlić · 2008
Leapfrog fullerenes have many perfect matchingsTomislav Došlić · 2008