Recognizing line-polar bipartite graphs in time O(n)

Authors:
Tınaz Ekim;Jing Huang
Affiliations:
Bogazici University, Industrial Engineering Department, 34342, Bebek-Istanbul, Turkey;Department of Mathematics and Statistics, University of Victoria, P.O. Box 3060 STN CSC, Victoria, B.C., V8W 3R4, Canada
Venue:
Discrete Applied Mathematics
Year:
2010

Citing 5
Cited 3

About recognizing (&agr; &bgr;) classes of polar graphs

Discrete Mathematics
Polar cographs

Discrete Applied Mathematics
Polarity of chordal graphs

Discrete Applied Mathematics
Polar Permutation Graphs

Combinatorial Algorithms
A forbidden subgraph characterization of line-polar bipartite graphs

Discrete Applied Mathematics

Recognizing polar planar graphs using new results for monopolarity

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Polar permutation graphs are polynomial-time recognisable

European Journal of Combinatorics
Algorithms for unipolar and generalized split graphs

Discrete Applied Mathematics

Quantified Score

Hi-index	0.05

Visualization

Abstract

A graph is polar if the vertex set can be partitioned into A and B in such a way that A induces a complete multipartite graph and B induces a disjoint union of cliques (i.e., the complement of a complete multipartite graph). Polar graphs naturally generalize several classes of graphs such as bipartite graphs, cobipartite graphs and split graphs. Recognizing polar graphs is an NP-complete problem in general, and thus it is of interest to restrict the problem to special classes of graphs. Cographs and chordal graphs are among those whose polarity can be recognized in polynomial time. The line-graphs of bipartite graphs are another class of graphs whose polarity has been characterized recently in terms of forbidden subgraphs, but no polynomial time algorithm is given. In this paper, we present an O(n) algorithm which decides whether the line-graph of an input bipartite graph is polar and constructs a polar partition when one exists.