Maximal Graphs with Given Connectivity and Edge-Connectivity
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Ferdinand Gliviak (1975)
Matematický časopis
Similarity:
Simic, Slobodan K. (1981)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Cvetković, D., Rowlinson, P. (1988)
Publications de l'Institut Mathématique. Nouvelle Série
Similarity:
Abdollah Khodkar, Rui Xu (2007)
Discussiones Mathematicae Graph Theory
Similarity:
In this note we give a characterization of the complete bipartite graphs which have an even (odd) [a,b]-factor. For general graphs we prove that an a-edge connected graph G with n vertices and with δ(G) ≥ max{a+1,an/(a+b) + a - 2} has an even [a,b]-factor, where a and b are even and 2 ≤ a ≤ b. With regard to the edge-connectivity this result is slightly better than one of the similar results obtained by Kouider and Vestergaard in 2004 and unlike their results, this result has no restriction...
Z. Filáková, Peter Mihók, Gabriel Semanišin (1997)
Mathematica Slovaca
Similarity:
Michal Šabo (1991)
Czechoslovak Mathematical Journal
Similarity: