scientific article; zbMATH DE number 512932

MaRDI QIDQ4281647zbMATH OpenFDO

Authors Alain Cournier, M. A. Habib

Publication date 9 June 1999

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10)

Cited in

(22)

• Critically indecomposable graphs
• The recognition of the class of indecomposable digraphs under low hemimorphy
• Indecomposability graph and critical vertices of an indecomposable graph
• Modular decomposition and transitive orientation
• A k-structure generalization of the theory of 2-structures
• Minimal indecomposable graphs
• The \(C_{3}\)-structure of the tournaments.
• An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures
• Editing to prime graphs
• Prime orientable graphs
• Decomposability index of tournaments
• Indecomposability graph and indecomposability recognition
• Recognition of prime graphs from a prime subgraph
• Some Algorithms on Conditionally Critical Indecomposable Graphs
• Decomposition tree of a lexicographic product of binary structures
• A tight lower bound for primitivity in k-structures
• The simplicity index of tournaments
• Nesting of prime substructures in k-ary relations
• Birecognition of prime graphs, and minimal prime graphs
• Irreducible pairings and indecomposable tournaments
• Subprime and superprime graphs
• Indecomposable tournaments with minimum Slater index

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4281647)