P. Katerinis
Abstract
Abstract In this paper we prove that every 1‐tough bipartite graph which is not isomorphic to K1,1 has a 2‐factor. We also obtain a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem.
OpenAlex reports 15 citations for this work. Citation counts describe recorded attention and do not establish research quality.
A contribution statement is not available in the OpenAlex record.
Method details are not available in the OpenAlex metadata.
Findings are not separately available in the OpenAlex metadata.
Limitations are not available in the OpenAlex metadata.
Application details are not available in the OpenAlex metadata.
Abstract In this paper we prove that every 1‐tough bipartite graph which is not isomorphic to K1,1 has a 2‐factor. We also obtain a sufficient condition for the existence of a 2‐factor in a bipartite graph, in the spirit of Hall's theorem.
Key concepts: Bipartite graph, Complete bipartite graph, Mathematics, Combinatorics, Edge-transitive graph, Robertson–Seymour theorem, Discrete mathematics, Graph