On the X-join decomposition for undirected graphs

DOI10.1016/0166-218X(79)90043-XzbMath0439.05041MaRDI QIDQ1142232

Michel A. Habib, M. C. Maurer

Publication date: 1979

Published in: Discrete Applied Mathematics (Search for Journal in Brave)

zbMATH Keywords

decomposition; substitution; join of graphs; lexicographic sum; join operation; R- congruence

Mathematics Subject Classification ID

05C99: Graph theory

Related Items

A polynomial algorithm to find an independent set of maximum weight in a fork-free graph, On some complexity properties of N-free posets and posets with bounded decomposition diameter, On finding the jump number of a partial order by substitution decomposition, \(P_ 4\)-trees and substitution decomposition, Modular decomposition and transitive orientation, A \(k\)-structure generalization of the theory of 2-structures, Complexity of list coloring problems with a fixed total number of colors, A linear algorithm to decompose inheritance graphs into modules, An \(O(n^ 2)\) incremental algorithm for modular decomposition of graphs and 2-structures, Decomposition of Directed Graphs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Graph derivatives
• Comparability graphs and a new matroid
• A decomposition property of basic acyclic graphs
• On certain polytopes associated with graphs
• Graphs indecomposable with respect to the X-join
• On the composition and decomposition of clutters
• Graph substitution and set packing polytopes
• Transitiv orientierbare Graphen
• The group of an X-join of graphs
• Graph Structures
• Algèbre des relations de congruence