zbMATH — the first resource for mathematics

Algorithm for identifying $$(2,2)$$-bipartite graphs. (English) Zbl 1358.05287
Summary: The objective of the present paper is to provide an algorithm to identify if the given graph is $$(2,2)$$-bipartite. In the process, we investigate some interesting properties of $$(2,2)$$-bipartite graphs.
MSC:
 05C85 Graph algorithms (graph-theoretic aspects) 05C38 Paths and cycles 05C12 Distance in graphs 05C15 Coloring of graphs and hypergraphs
Full Text: