Solution of the Hamiltonian problem for self-complementary graphs
- 作者Siddani Bhaskara Rao
- 卷第27卷
- 期第1期
- 印刷ISSN0095-8956
- 电子ISSN1096-0902
- 文件大小1583.99KB
- 发表时间1979
- DOI10.1016/0095-8956(79)90065-0
- 页码13-41
Complexity of a disjoint matching problem on bipartite graphsPuleo, Gregory J. · Information Processing Letters · 2016
Characterization of a class of graphs related to pairs of disjoint matchingsAnush Tserunyan · 2009
An Application of Rado's Theorem to Disjoint Matchings in Bipartite GraphsMurty, U. S. R. · Journal of the London Mathematical Society · 1978
On the number of disjoint perfect matchings of regular graphs with given edge connectivityLu, Hongliang; Lin, Yuqing · Discrete Mathematics · 2017
[North-Holland Mathematics Studies] Combinatorial Mathematics, Proceedings of the International Colloquium on Graph Theory and Combinatorics Volume 75 || On Certain Families of Disjoint Perfect Matchings in K2nLentin, André · 1983
Efficient Communication by Phone CallsLebensold, Kenneth · Studies in Applied Mathematics · 1973
A Divisibility ProblemLebensold, Kenneth · Studies in Applied Mathematics · 1977
A Criterion for Extremal Polygons of a Vertex SetKenneth Lebensold · The American Mathematical Monthly · 1967
Extrema of a Class of Functions on a Finite SetLebensold, Kenneth W. · Canadian Journal of Mathematics · 1974
Mathematical NotesHartmanis, J.; Stearns, R. E.; Mukhopadhyay, S. N.; Chaudhuri, Jyoti; Johnson, H. H.; Lebensold, Kenneth; Tucker, Joe; Keiser, V. H.; Hardman, N. R.; Jordan, J. H.; Hirsch, Guy; Kripke, Bernard; Fulton, C. M.; Blundon, W. J.; Hanson, J. R.; Machuca, Raul; Szüsz, P. · The American Mathematical Monthly · 1967