Perfect Graphs with No Balanced Skew-Partition are 2-Clique-Colorable.
Irena PenevPublished in: J. Graph Theory (2016)
Keyphrases
- independent set
- maximum clique
- graph properties
- series parallel
- quasi cliques
- graph representation
- graph theory
- graph theoretic
- random graphs
- data sets
- vertex set
- maximal cliques
- maximal clique enumeration
- maximum independent set
- labeled graphs
- association graph
- graph structures
- spanning tree
- graph databases
- graph matching
- directed graph