Search in Indecomposable Graphs

Authors:
Alain Cournier
Affiliations:
-
Venue:
WG '02 Revised Papers from the 28th International Workshop on Graph-Theoretic Concepts in Computer Science
Year:
2002

Citing 10
Cited 1

Primitivity is hereditary for 2-structures

Theoretical Computer Science
P4-trees and substitution decomposition

Discrete Applied Mathematics
Critically indecomposable partially ordered sets, graphs, tournaments and other binary relational structures

Discrete Mathematics
Indecomposable graphs

Discrete Mathematics
Minimal indecomposable graphs

Discrete Mathematics
Algorithm 447: efficient algorithms for graph manipulation

Communications of the ACM
On the Homogeneous Decomposition of Graphs

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
An Efficient Algorithm to Recognize Prime Undirected Graphs

WG '92 Proceedings of the 18th International Workshop on Graph-Theoretic Concepts in Computer Science
A New Linear Algorithm for Modular Decomposition

CAAP '94 Proceedings of the 19th International Colloquium on Trees in Algebra and Programming
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)

On indecomposability preserving elimination sequences

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we will present some properties of indecomposable graphs, furthermore we see how a search in an indecomposable graph can compute some of these properties. Endly we will see that using this search, when the vertices of an indecomposable graph G are visited in a given order O, the vertices of the complement of G (denoted G) can also be visited in the same order O.