Forbidden subgraph decomposition

Authors:
Irena Rusu;Jeremy Spinrad
Affiliations:
I.R.I.N., Université de Nantes, 2, Rue de la Houssiniere, B.P. 92208, 44322 Nantes Cedex 3, France;Box 1679-B, CS Dept., Vanderbilt University, Nashville, TN
Venue:
Discrete Mathematics
Year:
2002

Citing 10
Cited 0

Decomposition of perfect graphs

Journal of Combinatorial Theory Series B
Locally perfect graphs

Journal of Combinatorial Theory Series B
Completely separable graphs

Discrete Applied Mathematics - Computational combinatiorics
Efficient and practical modular decomposition

SODA '97 Proceedings of the eighth annual ACM-SIAM symposium on Discrete algorithms
Linear-time modular decomposition and efficient transitive orientation of comparability graphs

SODA '94 Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms
Domination graphs: examples and counterexamples

Discrete Applied Mathematics
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness
Efficient Parallel and Linear Time Sequential Split Decomposition (Extended Abstract)

Proceedings of the 14th Conference on Foundations of Software Technology and Theoretical Computer Science
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
The complexity of satisfiability problems

STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing

Quantified Score

Hi-index	0.05

Visualization

Abstract

We define a new form of graph decomposition, based on forbidding a fixed bipartite graph from occurring as an induced subgraph of edges which cross a partition of the vertices. We show that the generalized join decomposition proposed by Hsu (J. Combin. Theory Ser. B 43 (1987) 70) is NP-complete, while some other decompositions which can be described in this way can be found in polynomial time.