Add to ORKGWe study path-pairability of Cartesian product of graphs and prove that the Cartesian product of the complete bipartite graph Km,m with itself is path-pairable. The result improves the known bound on the minimal value of the maximum degree of a path-pairable graph. Further results about path-pairability of graph products are presented
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
AbstractThe concept of a k-pairable graph was introduced by Z. Chen [On k-pairable graphs, Discrete ...
Given a graph $G=(V(G), E(G))$ and a set $P\subseteq V(G)$, the following concepts have been recentl...
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive a...
The study of a graph theory model of certain telecommunications network problems lead to the concept...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
We study linkedness of the Cartesian product of graphs and prove that the product of an a-linked and...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
summary:The concept of the $k$-pairable graphs was introduced by Zhibo Chen (On $k$-pairable graphs,...
A graph on 2k vertices is path-pairable if for any pairing of the vertices the pairs can be joined b...
This paper deals with the subject of minimal path decomposition of complete bipartite graphs. A path...
AbstractMotivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about sp...
AbstractThere are simple arithmetic conditions necessary for the complete bipartite graph Km,n to ha...
summary:Let $P_k$ and $S_k$ denote a path and a star, respectively, on $k$ vertices. We give necessa...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
AbstractThe concept of a k-pairable graph was introduced by Z. Chen [On k-pairable graphs, Discrete ...
Given a graph $G=(V(G), E(G))$ and a set $P\subseteq V(G)$, the following concepts have been recentl...
We study the inheritance of path-pairability in the Cartesian product of graphs and prove additive a...
The study of a graph theory model of certain telecommunications network problems lead to the concept...
This paper is concerned with the linkedness of Cartesian products of complete graphs. A graph with a...
We study linkedness of the Cartesian product of graphs and prove that the product of an a-linked and...
Abstract. The Cartesian product of graphs was introduced more than 50 years ago and many fundamental...
summary:The concept of the $k$-pairable graphs was introduced by Zhibo Chen (On $k$-pairable graphs,...
A graph on 2k vertices is path-pairable if for any pairing of the vertices the pairs can be joined b...
This paper deals with the subject of minimal path decomposition of complete bipartite graphs. A path...
AbstractMotivated by a 1994 result of Graham et al. (Amer. Math. Monthly 101(7) (1994) 664) about sp...
AbstractThere are simple arithmetic conditions necessary for the complete bipartite graph Km,n to ha...
summary:Let $P_k$ and $S_k$ denote a path and a star, respectively, on $k$ vertices. We give necessa...
AbstractUse vi,κi,λi,δi to denote order, connectivity, edge-connectivity and minimum degree of a gra...
AbstractWe complete the work started by Holton and Grant concerning the semi-stability of non-trivia...
AbstractThe concept of a k-pairable graph was introduced by Z. Chen [On k-pairable graphs, Discrete ...
Given a graph $G=(V(G), E(G))$ and a set $P\subseteq V(G)$, the following concepts have been recentl...