Decomposition of complete bipartite graphs into factors with given diameters and radii
Eliška Tomová (1984)
Mathematica Slovaca
Similarity:
Eliška Tomová (1984)
Mathematica Slovaca
Similarity:
Faraha Ashraf, Martin Bača, Marcela Lascśaková, Andrea Semaničová-Feňovčíková (2017)
Discussiones Mathematicae Graph Theory
Similarity:
New graph characteristic, the total H-irregularity strength of a graph, is introduced. Estimations on this parameter are obtained and for some families of graphs the precise values of this parameter are proved.
Roditty, Y. (1986)
International Journal of Mathematics and Mathematical Sciences
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...
Gary Chartrand, Farrokh Saba, Hung Bin Zou (1985)
Časopis pro pěstování matematiky
Similarity:
K.M. Kathiresan, S. David Laurence (2015)
Discussiones Mathematicae Graph Theory
Similarity:
Let G = (V (G),E(G)) be a simple graph and H be a subgraph of G. G admits an H-covering, if every edge in E(G) belongs to at least one subgraph of G that is isomorphic to H. An (a, d)-H-antimagic total labeling of G is a bijection λ: V (G) ∪ E(G) → {1, 2, 3, . . . , |V (G)| + |E(G)|} such that for all subgraphs H′ isomorphic to H, the H′ weights [...] constitute an arithmetic progression a, a+d, a+2d, . . . , a+(n−1)d where a and d are positive integers and n is the number of subgraphs...
Andrey A. Dobrynin, Leonid S. Mel'nikov (2012)
Discussiones Mathematicae Graph Theory
Similarity:
Let G be a simple 4-regular plane graph and let S be a decomposition of G into edge-disjoint cycles. Suppose that every two adjacent edges on a face belong to different cycles of S. Such a graph G arises as a superposition of simple closed curves in the plane with tangencies disallowed. Studies of coloring of graphs of this kind were originated by Grötzsch. Two 4-chromatic graphs generated by circles in the plane were constructed by Koester in 1984 [10,11,12]. Until now, no other examples...
Ján Plesník (1982)
Mathematica Slovaca
Similarity: