Skip to search formSkip to main contentSkip to account menu

Skew partition

In graph theory, a skew partition of a graph is a partition of its vertices into two subsets, such that the induced subgraph formed by one of the two… 
Wikipedia (opens in a new tab)

Related topics

Related topics

10 relations
Biconnected componentClique (graph theory)Complement graphGraph theory

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2018
2018
The Sandwich Problem for Decompositions and Almost Monotone Properties
We consider the graph sandwich problem and introduce almost monotone properties, for which the sandwich problem can be reduced to… 
2017
2017
A Tableau Formula of Double Grothendieck Polynomials for 321-Avoiding Permutations
In this article, we prove a tableau formula for the double Grothendieck polynomials associated to 321-avoiding permutations. The… 
2016
2016
Perfect Graphs with No Balanced Skew‐Partition are 2‐Clique‐Colorable
A graph G is perfect if for all induced subgraphs H of G, χ(H)=ω(H) . A graph G is Berge if neither G nor its complement contains… 
2016
2016
The (k, ℓ) unpartitioned probe problem NP-complete versus polynomial dichotomy
2013
2013
Combinatorial optimization with 2-joins
2010
2010
On the resolution of Wely module in the case of two- rowed skew-shape (p+t,q)/(t,0)
In this paper, the resolution of Weyl module in the case of the skew-partition (p+t,q)/(t,0), where F and r D F are free module… 
2008
2008
CONJECTURE ON SKEW PARTITIONS
We present an affirmative answer to Stanley’s zrank conjecture, namely, the zrank and the rank are equal for any skew partition… 
2007
2007
The Complexity of the List Partition Problem for Graphs
The $k$-partition problem is as follows: Given a graph $G$ and a positive integer $k$, partition the vertices of $G$ into at most… 
2005
2005
On the structure of self-complementary graphs
2004
2004
The list partition problem for graphs
We consider the problem of partitioning the vertex-set of a graph into at most k parts A1, A2,..., Ak, where it may be specified… 
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)