Partitions of graphs into one or two independent sets and cliques
Discrete Mathematics
r-dominating cliques in graphs with hypertree structure
Discrete Mathematics
Coloring precolored perfect graphs
Journal of Graph Theory
Complexity of graph partition problems
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
The complexity of some problems related to Graph 3-COLORABILITY
Discrete Applied Mathematics
Journal of Combinatorial Theory Series B
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
Algorithmic Graph Theory and Perfect Graphs (Annals of Discrete Mathematics, Vol 57)
List matrix partitions of chordal graphs
Theoretical Computer Science - Graph colorings
(p, k)-coloring problems in line graphs
Theoretical Computer Science
Digraph matrix partitions and trigraph homomorphisms
Discrete Applied Mathematics
Discrete Applied Mathematics
Distance paired-domination problems on subclasses of chordal graphs
Theoretical Computer Science
On injective colourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
On 2-subcolourings of chordal graphs
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
Cover-incomparability graphs and chordal graphs
Discrete Applied Mathematics
Discrete Applied Mathematics
Dichotomy for tree-structured trigraph list homomorphism problems
Discrete Applied Mathematics
Two fixed-parameter algorithms for the cocoloring problem
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Survey: Colouring, constraint satisfaction, and complexity
Computer Science Review
Partitioning cographs into cliques and stable sets
Discrete Optimization
Partitioning extended P4-laden graphs into cliques and stable sets
Information Processing Letters
Cycle transversals in perfect graphs and cographs
Theoretical Computer Science
WG'12 Proceedings of the 38th international conference on Graph-Theoretic Concepts in Computer Science
Graph partitions with prescribed patterns
European Journal of Combinatorics
Fixed-parameter algorithms for the cocoloring problem
Discrete Applied Mathematics
Hi-index | 0.00 |
We consider the following generalization of split graphs: A graph is said to be a (k,l)-graph if its vertex set can be partitioned into k independent sets and l cliques. (Split graphs are obtained by setting k = l = 1.) Much of the appeal of split graphs is due to the fact that they are chordal, a property not shared by (k,l)-graphs in general. (For instance, being a (k,0)-graph is equivalent to being k-colourable.) However, if we keep the assumption of chordality, nice algorithms and characterization theorems are possible, Indeed, our main result is a forbidden subgraph characterization of chordal (k,l)-graphs. We also give an O(n(m + n)) recognition algorithm for chordal (k,l)-graphs. When k = 1, our algorithm runs in time O(m + n).In particular, we obtain a new simple and efficient greedy algorithm for the recognition of split graphs, from which it is easy to derive the well known forbidden subgraph characterization of split graphs. The algorithm and the characterization extend, in a natural way, to the 'list' (or 'pre-colouring extension') version of the split partition problem--given a graph with some vertices pre-assigned to the independent set, or to the clique, is there a split partition extending this pre-assignment? Another way to think of our main result is the following min-max property of chordal graphs: for each integer r ≥ 1, the maximum number of independent Kr,'s (i.e., of vertex disjoint subgraphs of G, each isomorphic to Kr, with no edges joining two of the subgraphs) equals the minimum number of cliques of G that meet all the Kr's of G.