Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 235,423,158 papers from all fields of science
Search
Sign In
Create Free Account
Clique-sum
Known as:
Seymour's decomposition theorem
In graph theory, a branch of mathematics, a clique-sum is a way of combining two graphs by gluing them together at a clique, analogous to the…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
28 relations
Apollonian network
Approximation algorithm
Clique (graph theory)
Four color theorem
Expand
Broader (1)
Graph operations
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
Finding a Maximum-Weight Convex Set in a Chordal Graph
J. Cardinal
,
Jean-Paul Doignon
,
Keno Merckx
J. Graph Algorithms Appl.
2018
Corpus ID: 49432163
We consider a natural combinatorial optimization problem on chordal graphs, the class of graphs with no induced cycle of length…
Expand
2015
2015
Non-chordal patterns associated with the positive definite completion problem
E. M. Klem
2015
Corpus ID: 124147788
A partial matrix, is a matrix for which some entries are specified and some unspecified. In general completion problems ask…
Expand
2013
2013
The Strong Largeur d’Arborescence
R. Steenkamp
2013
Corpus ID: 53511894
An important graph parameter is tree-width. The tree-width of a graph G, which we denote by tw(G), is defined as the smallest…
Expand
2012
2012
Efficiently recognizing , decomposing and triangulating hole-and diamond-free graphs
Anne Berry
,
A. Brandstädt
,
V. Giakoumakis
,
Frédéric Maffray
2012
Corpus ID: 3770250
We show that the atoms by clique separator decomposition of holeand diamond-free graphs are of three simple types: clique…
Expand
2011
2011
The Yin and Yang atomic structure of diamond-free hole-free graphs
Anne Berry
,
A. Brandstädt
,
V. Giakoumakis
2011
Corpus ID: 11945028
We show that the atoms by clique separator decomposition of a diamond-free hole-free graph are of three simple types: clique…
Expand
2011
2011
Ibarra, Louis The clique-separator graph for chordal graphs. Discrete Appl. Math. 157 (2009), no. 8, 1737-1749
Aleksandra Tepeh
2011
Corpus ID: 125512137
2010
2010
Generalizing Seymour's Decomposition Theorem: hopes and fears
V. Zwam
2010
Corpus ID: 116798727
2010
2010
Clique separator decomposition in less than nm
Anne Berry
,
Romain Pogorelcnik
2010
Corpus ID: 54178314
We address the problem of computing the atoms of the decomposition by clique minimal separators of a graph G (also called the…
Expand
Review
2008
Review
2008
Invited Talks Symmetry , Hadwiger number , pointwise limit of graphs
L. Babai
,
D. West
2008
Corpus ID: 2483385
A vertex k-coloring of a graph G is distinguishing if the only automorphism of G that preserves the colors is the identity map…
Expand