Skip to search form
Skip to main content
Skip to account menu
Semantic Scholar
Semantic Scholar's Logo
Search 226,404,496 papers from all fields of science
Search
Sign In
Create Free Account
Split (graph theory)
Known as:
Split decomposition
In graph theory, a split of an undirected graph is a cut whose cut-set forms a complete bipartite graph. A graph is prime if it has no splits. The…
Expand
Wikipedia
(opens in a new tab)
Create Alert
Alert
Related topics
Related topics
9 relations
Bridge (graph theory)
Cut (graph theory)
Directed graph
Dominating set
Expand
Papers overview
Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
The Buneman index via polyhedral split decomposition
Shungo Koichi
Advances in Applied Mathematics
2014
Corpus ID: 123023708
2012
2012
Molecular phylogenetics of the genus Physalia (Cnidaria: Siphonophora) in New Zealand coastal waters reveals cryptic diversity
D. R. Pontin
,
R. Cruickshank
Hydrobiologia
2012
Corpus ID: 254545862
Physalia is a genus of pelagic colonial hydrozoans often known by common names such as ‘Portuguese-man-of-war’ or ‘bluebottle…
Expand
2011
2011
Practical and Efficient Split Decomposition via Graph-Labelled Trees
E. Gioan
,
C. Paul
,
Marc Tedder
,
D. Corneil
Algorithmica
2011
Corpus ID: 16827495
Split decomposition of graphs was introduced by Cunningham (under the name join decomposition) as a generalization of the modular…
Expand
2010
2010
Polyhedral Split Decomposition of Tropical Polytopes for Directed Distances
Shungo Koichi
2010
Corpus ID: 18673280
In the last decade, tropical geometry has been attracted a lot of attention in various fields such as the algebraic geometry…
Expand
2009
2009
Split decomposition over an abelian group, Part 2: Group-valued split systems with weakly compatible support
A. Dress
Discrete Applied Mathematics
2009
Corpus ID: 25151246
2006
2006
R A ] 1 6 D ec 2 00 6 The split decomposition of a tridiagonal pair
K. Nomura
,
Paul M. Terwilliger
2006
Corpus ID: 1474689
Let K denote a field and let V denote a vector space over K with finite positive dimension. We consider a pair of linear…
Expand
2005
2005
Graph decompositions definable in monadic second-order logic
B. Courcelle
Electron. Notes Discret. Math.
2005
Corpus ID: 43872399
2004
2004
Geometric Study on the Split Decomposition of Finite Metrics ∗
H. Hirai
2004
Corpus ID: 18090292
This paper sheds a new light on the split decomposition theory and T-theory from the viewpoint of convex analysis and polyhedral…
Expand
2001
2001
Split Decomposition and Distance Labelling: An Optimal Scheme For Distance Hereditary Graphs
C. Gavoille
,
C. Paul
Electron. Notes Discret. Math.
2001
Corpus ID: 32634731
1990
1990
Split decomposition of undirected graphs
T. Ma
,
J. Spinrad
ACM-SIAM Symposium on Discrete Algorithms
1990
Corpus ID: 34718325
The split decomposition of a graph, which is also known as the join decomposition [GHS], ms], was developed by Cunningham [Cu…
Expand
By clicking accept or continuing to use the site, you agree to the terms outlined in our
Privacy Policy
(opens in a new tab)
,
Terms of Service
(opens in a new tab)
, and
Dataset License
(opens in a new tab)
ACCEPT & CONTINUE